05 Neural Networks

谁践踏了优雅 2021-11-11 16:31 209阅读 0赞

### Neural Networks ###

#### The ‘one learning algorithm’ hypothesis ####

1.  Neuron-rewiring experiments

#### Model Representation ####

##### Define #####

1.  Sigmoid(logistic) activation function
2.  bias unit
3.  input layer
4.  output layer
5.  hidden layer
6.  \$a\_i^\{(j)\}\$ : ‘activation’ of unit \$i\$ in layer \$j\$
7.  \$\\theta^\{(j)\}\$: matrix of weights controlling function mapping from layer \$j\$ to layer \$j + 1\$.

##### Calculate #####

\\\[a^\{(j)\} = g(z^\{(j)\})\\\]  
\\\[g(x) = \\frac\{1\}\{1 + e^\{-x\}\}\\\]  
\\\[z^\{(j + 1)\} = \\Theta^\{(j)\}a^\{(j)\}\\\]  
\\\[h\_\\theta(x) = a^\{(j + 1)\} = g(z^\{(j + 1)\})\\\]

##### Cost Function #####

\\\[  
J(\\Theta) = - \\frac\{1\}\{m\} \\sum\_\{i=1\}^m \\sum\_\{k=1\}^K \\left\[y^\{(i)\}\_k \\log ((h\_\\Theta (x^\{(i)\}))\_k) + (1 - y^\{(i)\}\_k)\\log (1 - (h\_\\Theta(x^\{(i)\}))\_k)\\right\] + \\\]

\\\[\\frac\{\\lambda\}\{2m\}\\sum\_\{l=1\}^\{L-1\} \\sum\_\{i=1\}^\{s\_l\} \\sum\_\{j=1\}^\{s\_\{l+1\}\} ( \\Theta\_\{j,i\}^\{(l)\})^2  
\\\]

##### Back-propagation Algorithm #####

###### Algorithm ######

1.  Hypothesis we have calculated all the \$a^\{(l)\}\$ and \$z^\{(l)\}\$
2.  set \$\\Delta^\{(l)\}\_\{i, j\} := 0\$ for all (l, i, j)
3.  using \$y^\{(t)\}\$, compute \$\\delta^\{L\} = a^\{(L)\} - y^\{(t)\}\$, where \$y^\{(t)\}\_\{k\}(i) \\in \{0, 1\}\$ indicates whether the current training example belongs to class k\{\$y^\{(t)\}\_\{k\}(k) = 1\$\}, or if it belongs to a different class = 0;
4.  For the hidden layer \$l = L - 1\$ down to 2, set  
    \\\[  
    \\delta^\{(l)\} = (\\Theta^\{(l)\})^T\\delta^\{(l + 1)\} .\* g’(z^\{(l)\})  
    \\\]
5.  remember remove \$\\delta\_0^\{(l)\}\$ by. `delta(2:end)`  
    \\\[  
    \\Delta^\{(l)\} = \\Delta^\{(l)\} + \\delta^\{(l + 1)\}(a^\{(l)\})^T  
    \\\]
6.  gradient  
    \\\[  
    \\frac\{\\partial\}\{\\partial\\Theta^\{(l)\}\_\{i,j\}\}J(\\Theta) = D^\{(l)\}\_\{i,j\} = \\frac\{1\}\{m\}\\Delta^\{(l)\}\_\{i,j\} +  
    \\begin\{cases\} \\frac\{\\lambda\}\{m\}\\Theta^\{(l)\}\_\{i, j\}, & \\text \{if j $\\geq$ 1\} \\\\ 0, & \\text\{if j = 0\} \\end\{cases\}  
    \\\]

###### Gradient Checking ######

1.  \\\[  
    \\frac\{d\}\{d\\Theta\}J(\\Theta) \\approx \\frac\{J(\\Theta + \\epsilon) - J(\\Theta - \\epsilon)\}\{2\\epsilon\}  
    \\\]
2.  A small value for \$\\epsilon\$ such as \$\\epsilon = 10^\{-4\}\$
3.  check that gradApprox \$\\approx\$ deltalVector

epsilon = 1e-4;
    for i = 1 : n
        thetaPlus = theta;
        thetaPlus(i) += epsilon;
        thetaMinus = theta;
        thetaMinus(i) -= epsilon;
        gradApprox(i) = (J(thetaPlus) - J(thetaMinus)) / (2 * epsilon);
    end;

###### Rolling and Unrolling ######

###### Random Initialization ######

Theta = rand(n, m)) * (2 * INIT_EPSILON) - INIT_EPSILON;

1.  initialize \$ \\Theta^\{(l)\}\_\{ij\} \\in \[-\\epsilon, \\epsilon\] \$
2.  else if we initializing all theta weights to zero, all nodes will update to the same value repeatedly when we back\_propagate.
3.  One effective strategy for choosing \$\\epsilon\_\{init\}\$ is to base the number of units in the network. A good choice of \$\\epsilon\_\{init\}\$ is \$\\epsilon\_\{init\} = \\frac\{\\sqrt\{6\}\}\{\\sqrt\{L\_\{in\} + L\_\{out\}\}\} \$

##### Training a Neural Network #####

1.  Randomly initialize weights

Theta = rand(n, m) * (2 * epsilon) - epsilon;

1.  Implement forward propagation to get \$h\_\\Theta(x^\{(i)\})\$ for any \$x^\{(i)\}\$
2.  Implement code to compute cost function \$J(\\Theta)\$
3.  Implement back-prop to compute partial derivatives \$ \\frac\{d(J\\Theta)\}\{d\\Theta\_\{jk\}^\{(l)\}\} \$
    
     *  \$ g’(z) = \\frac\{d\}\{dz\}g(z) = g(z)(1 - g(z))\$
     *  \$ sigmoid(z) = g(z) = \\frac\{1\}\{1 + e^\{-z\}\}\$
4.  Use gradient checking to compare \$ \\frac\{d(J\\Theta)\}\{d\\Theta\_\{jk\}^\{(l)\}\} \$ computed using back-propagation vs. using numerical estimate of gradient of \$J(\\Theta)\$  
    **Then disable gradient checking code**
5.  Use gradient descent or advanced optimization method with back-propagation to try to minimize \$J(\\Theta)\$ as a function of parameters \$\\Theta\$

转载于:https://www.cnblogs.com/QQ-1615160629/p/10963940.html