# Neural Networks

### From Ufldl

(18 intermediate revisions not shown) | |||

Line 8: | Line 8: | ||

diagram to denote a single neuron: | diagram to denote a single neuron: | ||

- | [[Image:SingleNeuron.png| | + | [[Image:SingleNeuron.png|300px|center]] |

This "neuron" is a computational unit that takes as input <math>x_1, x_2, x_3</math> (and a +1 intercept term), and | This "neuron" is a computational unit that takes as input <math>x_1, x_2, x_3</math> (and a +1 intercept term), and | ||

- | outputs <math>h_{W,b}(x) = f(W^Tx) = f(\sum_{i=1}^3 W_{i}x_i +b)</math>, where <math>f : \Re \mapsto \Re</math> is | + | outputs <math>\textstyle h_{W,b}(x) = f(W^Tx) = f(\sum_{i=1}^3 W_{i}x_i +b)</math>, where <math>f : \Re \mapsto \Re</math> is |

called the '''activation function'''. In these notes, we will choose | called the '''activation function'''. In these notes, we will choose | ||

<math>f(\cdot)</math> to be the sigmoid function: | <math>f(\cdot)</math> to be the sigmoid function: | ||

Line 31: | Line 31: | ||

- | + | <div align=center> | |

- | [[Image:Sigmoid_Function.png|400px| | + | [[Image:Sigmoid_Function.png|400px|top|Sigmoid activation function.]] |

- | [[Image:Tanh_Function.png|400px| | + | [[Image:Tanh_Function.png|400px|top|Tanh activation function.]] |

+ | </div> | ||

The <math>\tanh(z)</math> function is a rescaled version of the sigmoid, and its output range is | The <math>\tanh(z)</math> function is a rescaled version of the sigmoid, and its output range is | ||

<math>[-1,1]</math> instead of <math>[0,1]</math>. | <math>[-1,1]</math> instead of <math>[0,1]</math>. | ||

- | Note that unlike | + | Note that unlike some other venues (including the OpenClassroom videos, and parts of CS229), we are not using the convention |

here of <math>x_0=1</math>. Instead, the intercept term is handled separately by the parameter <math>b</math>. | here of <math>x_0=1</math>. Instead, the intercept term is handled separately by the parameter <math>b</math>. | ||

Line 49: | Line 50: | ||

- | == Neural Network | + | == Neural Network model == |

- | + | ||

A neural network is put together by hooking together many of our simple | A neural network is put together by hooking together many of our simple | ||

- | + | "neurons," so that the output of a neuron can be the input of another. For | |

example, here is a small neural network: | example, here is a small neural network: | ||

Line 59: | Line 59: | ||

In this figure, we have used circles to also denote the inputs to the network. The circles | In this figure, we have used circles to also denote the inputs to the network. The circles | ||

- | labeled | + | labeled "+1" are called '''bias units''', and correspond to the intercept term. |

- | The leftmost layer of the network is called the | + | The leftmost layer of the network is called the '''input layer''', and the |

- | rightmost layer the | + | rightmost layer the '''output layer''' (which, in this example, has only one |

- | node). The middle layer of nodes is called the | + | node). The middle layer of nodes is called the '''hidden layer''', because its |

values are not observed in the training set. We also say that our example | values are not observed in the training set. We also say that our example | ||

- | neural network has 3 | + | neural network has 3 '''input units''' (not counting the bias unit), 3 |

- | hidden units | + | '''hidden units''', and 1 '''output unit'''. |

We will let <math>n_l</math> | We will let <math>n_l</math> | ||

Line 79: | Line 79: | ||

the value +1. We also let <math>s_l</math> denote the number of nodes in layer <math>l</math> (not counting the bias unit). | the value +1. We also let <math>s_l</math> denote the number of nodes in layer <math>l</math> (not counting the bias unit). | ||

- | We will write <math>a^{(l)}_i</math> to denote the | + | We will write <math>a^{(l)}_i</math> to denote the '''activation''' (meaning output value) of |

unit <math>i</math> in layer <math>l</math>. For <math>l=1</math>, we also use <math>a^{(1)}_i = x_i</math> to denote the <math>i</math>-th input. | unit <math>i</math> in layer <math>l</math>. For <math>l=1</math>, we also use <math>a^{(1)}_i = x_i</math> to denote the <math>i</math>-th input. | ||

Given a fixed setting of | Given a fixed setting of | ||

Line 95: | Line 95: | ||

In the sequel, we also let <math>z^{(l)}_i</math> denote the total weighted sum of inputs to unit <math>i</math> in layer <math>l</math>, | In the sequel, we also let <math>z^{(l)}_i</math> denote the total weighted sum of inputs to unit <math>i</math> in layer <math>l</math>, | ||

- | including the bias term (e.g., <math>z_i^{(2)} = \sum_{j=1}^n W^{(1)}_{ij} x_j + b^{(1)}_i</math>), so that | + | including the bias term (e.g., <math>\textstyle z_i^{(2)} = \sum_{j=1}^n W^{(1)}_{ij} x_j + b^{(1)}_i</math>), so that |

<math>a^{(l)}_i = f(z^{(l)}_i)</math>. | <math>a^{(l)}_i = f(z^{(l)}_i)</math>. | ||

+ | |||

+ | Note that this easily lends itself to a more compact notation. Specifically, if we extend the | ||

+ | activation function <math>f(\cdot)</math> | ||

+ | to apply to vectors in an element-wise fashion (i.e., | ||

+ | <math>f([z_1, z_2, z_3]) = [f(z_1), f(z_2), f(z_3)]</math>), then we can write | ||

+ | the equations above more | ||

+ | compactly as: | ||

+ | :<math>\begin{align} | ||

+ | z^{(2)} &= W^{(1)} x + b^{(1)} \\ | ||

+ | a^{(2)} &= f(z^{(2)}) \\ | ||

+ | z^{(3)} &= W^{(2)} a^{(2)} + b^{(2)} \\ | ||

+ | h_{W,b}(x) &= a^{(3)} = f(z^{(3)}) | ||

+ | \end{align}</math> | ||

+ | We call this step '''forward propagation.''' More generally, recalling that we also use <math>a^{(1)} = x</math> to also denote the values from the input layer, | ||

+ | then given layer <math>l</math>'s activations <math>a^{(l)}</math>, we can compute layer <math>l+1</math>'s activations <math>a^{(l+1)}</math> as: | ||

+ | :<math>\begin{align} | ||

+ | z^{(l+1)} &= W^{(l)} a^{(l)} + b^{(l)} \\ | ||

+ | a^{(l+1)} &= f(z^{(l+1)}) | ||

+ | \end{align}</math> | ||

+ | By organizing our parameters in matrices and using matrix-vector operations, we can take | ||

+ | advantage of fast linear algebra routines to quickly perform calculations in our network. | ||

+ | |||

+ | |||

+ | We have so far focused on one example neural network, but one can also build neural | ||

+ | networks with other '''architectures''' (meaning patterns of connectivity between neurons), including ones with multiple hidden layers. | ||

+ | The most common choice is a <math>\textstyle n_l</math>-layered network | ||

+ | where layer <math>\textstyle 1</math> is the input layer, layer <math>\textstyle n_l</math> is the output layer, and each | ||

+ | layer <math>\textstyle l</math> is densely connected to layer <math>\textstyle l+1</math>. In this setting, to compute the | ||

+ | output of the network, we can successively compute all the activations in layer | ||

+ | <math>\textstyle L_2</math>, then layer <math>\textstyle L_3</math>, and so on, up to layer <math>\textstyle L_{n_l}</math>, using the equations above that describe the forward propagation step. This is one | ||

+ | example of a '''feedforward''' neural network, since the connectivity graph | ||

+ | does not have any directed loops or cycles. | ||

+ | |||

+ | |||

+ | Neural networks can also have multiple output units. For example, here is a network | ||

+ | with two hidden layers layers <math>L_2</math> and <math>L_3</math> and two output units in layer <math>L_4</math>: | ||

+ | |||

+ | [[Image:Network3322.png|500px|center]] | ||

+ | |||

+ | To train this network, we would need training examples <math>(x^{(i)}, y^{(i)})</math> | ||

+ | where <math>y^{(i)} \in \Re^2</math>. This sort of network is useful if there're multiple | ||

+ | outputs that you're interested in predicting. (For example, in a medical | ||

+ | diagnosis application, the vector <math>x</math> might give the input features of a | ||

+ | patient, and the different outputs <math>y_i</math>'s might indicate presence or absence | ||

+ | of different diseases.) | ||

+ | |||

+ | |||

+ | {{Sparse_Autoencoder}} | ||

+ | |||

+ | |||

+ | {{Languages|神经网络|中文}} |

## Latest revision as of 19:38, 6 April 2013

Consider a supervised learning problem where we have access to labeled training
examples (*x*^{(i)},*y*^{(i)}). Neural networks give a way of defining a complex,
non-linear form of hypotheses *h*_{W,b}(*x*), with parameters *W*,*b* that we can
fit to our data.

To describe neural networks, we will begin by describing the simplest possible neural network, one which comprises a single "neuron." We will use the following diagram to denote a single neuron:

This "neuron" is a computational unit that takes as input *x*_{1},*x*_{2},*x*_{3} (and a +1 intercept term), and
outputs , where is
called the **activation function**. In these notes, we will choose
to be the sigmoid function:

Thus, our single neuron corresponds exactly to the input-output mapping defined by logistic regression.

Although these notes will use the sigmoid function, it is worth noting that
another common choice for *f* is the hyperbolic tangent, or tanh, function:

Here are plots of the sigmoid and tanh functions:

The tanh(*z*) function is a rescaled version of the sigmoid, and its output range is
[ − 1,1] instead of [0,1].

Note that unlike some other venues (including the OpenClassroom videos, and parts of CS229), we are not using the convention
here of *x*_{0} = 1. Instead, the intercept term is handled separately by the parameter *b*.

Finally, one identity that'll be useful later: If *f*(*z*) = 1 / (1 + exp( − *z*)) is the sigmoid
function, then its derivative is given by *f*'(*z*) = *f*(*z*)(1 − *f*(*z*)).
(If *f* is the tanh function, then its derivative is given by
*f*'(*z*) = 1 − (*f*(*z*))^{2}.) You can derive this yourself using the definition of
the sigmoid (or tanh) function.

## Neural Network model

A neural network is put together by hooking together many of our simple "neurons," so that the output of a neuron can be the input of another. For example, here is a small neural network:

In this figure, we have used circles to also denote the inputs to the network. The circles
labeled "+1" are called **bias units**, and correspond to the intercept term.
The leftmost layer of the network is called the **input layer**, and the
rightmost layer the **output layer** (which, in this example, has only one
node). The middle layer of nodes is called the **hidden layer**, because its
values are not observed in the training set. We also say that our example
neural network has 3 **input units** (not counting the bias unit), 3
**hidden units**, and 1 **output unit**.

We will let *n*_{l}
denote the number of layers in our network; thus *n*_{l} = 3 in our example. We label layer *l* as
*L*_{l}, so layer *L*_{1} is the input layer, and layer the output layer.
Our neural network has parameters (*W*,*b*) = (*W*^{(1)},*b*^{(1)},*W*^{(2)},*b*^{(2)}), where
we write
to denote the parameter (or weight) associated with the connection
between unit *j* in layer *l*, and unit *i* in layer *l* + 1. (Note the order of the indices.)
Also, is the bias associated with unit *i* in layer *l* + 1.
Thus, in our example, we have , and .
Note that bias units don't have inputs or connections going into them, since they always output
the value +1. We also let *s*_{l} denote the number of nodes in layer *l* (not counting the bias unit).

We will write to denote the **activation** (meaning output value) of
unit *i* in layer *l*. For *l* = 1, we also use to denote the *i*-th input.
Given a fixed setting of
the parameters *W*,*b*, our neural
network defines a hypothesis *h*_{W,b}(*x*) that outputs a real number. Specifically, the
computation that this neural network represents is given by:

In the sequel, we also let denote the total weighted sum of inputs to unit *i* in layer *l*,
including the bias term (e.g., ), so that
.

Note that this easily lends itself to a more compact notation. Specifically, if we extend the
activation function
to apply to vectors in an element-wise fashion (i.e.,
*f*([*z*_{1},*z*_{2},*z*_{3}]) = [*f*(*z*_{1}),*f*(*z*_{2}),*f*(*z*_{3})]), then we can write
the equations above more
compactly as:

We call this step **forward propagation.** More generally, recalling that we also use *a*^{(1)} = *x* to also denote the values from the input layer,
then given layer *l*'s activations *a*^{(l)}, we can compute layer *l* + 1's activations *a*^{(l + 1)} as:

By organizing our parameters in matrices and using matrix-vector operations, we can take advantage of fast linear algebra routines to quickly perform calculations in our network.

We have so far focused on one example neural network, but one can also build neural
networks with other **architectures** (meaning patterns of connectivity between neurons), including ones with multiple hidden layers.
The most common choice is a -layered network
where layer is the input layer, layer is the output layer, and each
layer is densely connected to layer . In this setting, to compute the
output of the network, we can successively compute all the activations in layer
, then layer , and so on, up to layer , using the equations above that describe the forward propagation step. This is one
example of a **feedforward** neural network, since the connectivity graph
does not have any directed loops or cycles.

Neural networks can also have multiple output units. For example, here is a network
with two hidden layers layers *L*_{2} and *L*_{3} and two output units in layer *L*_{4}:

To train this network, we would need training examples (*x*^{(i)},*y*^{(i)})
where . This sort of network is useful if there're multiple
outputs that you're interested in predicting. (For example, in a medical
diagnosis application, the vector *x* might give the input features of a
patient, and the different outputs *y*_{i}'s might indicate presence or absence
of different diseases.)

**Neural Networks** | Backpropagation Algorithm | Gradient checking and advanced optimization | Autoencoders and Sparsity | Visualizing a Trained Autoencoder | Sparse Autoencoder Notation Summary | Exercise:Sparse Autoencoder

Language : 中文