Linear Decoders
From Ufldl
(→Linear Decoder) |
(→Sparse Autoencoder Recap) |
||
| Line 1: | Line 1: | ||
【原文】： | 【原文】： | ||
== Sparse Autoencoder Recap == | == Sparse Autoencoder Recap == | ||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
In the sparse autoencoder, we had 3 layers of neurons: an input layer, a hidden layer and an output layer. In our previous description | In the sparse autoencoder, we had 3 layers of neurons: an input layer, a hidden layer and an output layer. In our previous description | ||
| Line 16: | Line 6: | ||
In these notes, we describe a modified version of the autoencoder in which some of the neurons use a different activation function. | In these notes, we describe a modified version of the autoencoder in which some of the neurons use a different activation function. | ||
This will result in a model that is sometimes simpler to apply, and can also be more robust to variations in the parameters. | This will result in a model that is sometimes simpler to apply, and can also be more robust to variations in the parameters. | ||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
Recall that each neuron (in the output layer) computed the following: | Recall that each neuron (in the output layer) computed the following: | ||
| Line 39: | Line 17: | ||
where <math>a^{(3)}</math> is the output. In the autoencoder, <math>a^{(3)}</math> is our approximate reconstruction of the input <math>x = a^{(1)}</math>. | where <math>a^{(3)}</math> is the output. In the autoencoder, <math>a^{(3)}</math> is our approximate reconstruction of the input <math>x = a^{(1)}</math>. | ||
| - | |||
| - | |||
| - | |||
| - | |||
<math> | <math> | ||
| Line 50: | Line 24: | ||
\end{align} | \end{align} | ||
</math> | </math> | ||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
<math> | <math> | ||
| Line 63: | Line 31: | ||
\end{align} | \end{align} | ||
</math> | </math> | ||
| - | |||
| - | |||
| - | |||
| - | |||
Because we used a sigmoid activation function for <math>f(z^{(3)})</math>, we needed to constrain or scale the inputs to be in the range <math>[0,1]</math>, | Because we used a sigmoid activation function for <math>f(z^{(3)})</math>, we needed to constrain or scale the inputs to be in the range <math>[0,1]</math>, | ||
| Line 73: | Line 37: | ||
no longer constrained to <math>[0,1]</math> and it's not clear what the best way is to scale the data to ensure it fits into the constrained range. | no longer constrained to <math>[0,1]</math> and it's not clear what the best way is to scale the data to ensure it fits into the constrained range. | ||
| - | + | == Linear Decoder == | |
| - | + | One easy fix for this problem is to set <math>a^{(3)} = z^{(3)}</math>. Formally, this is achieved by having the output | |
| + | nodes use an activation function that's the identity function <math>f(z) = z</math>, so that <math>a^{(3)} = f(z^{(3)}) = z^{(3)}</math>. | ||
| + | This particular activation function <math>f(\cdot)</math> is called the '''linear activation function''' (though perhaps | ||
| + | "identity activation function" would have been a better name). Note however that in the ''hidden'' layer of the network, we still use a sigmoid (or tanh) activation function, | ||
| + | so that the hidden unit activations are given by (say) <math>\textstyle a^{(2)} = \sigma(W^{(1)}x + b^{(1)})</math>, where <math>\sigma(\cdot)</math> is the sigmoid function, | ||
| + | <math>x</math> is the input, and <math>W^{(1)}</math> and <math>b^{(1)}</math> are the weight and bias terms for the hidden units. | ||
| + | It is only in the ''output'' layer that we use the linear activation function. | ||
| - | + | An autoencoder in this configuration--with a sigmoid (or tanh) hidden layer and a linear output layer--is called a '''linear decoder'''. | |
| + | In this model, we have <math>\hat{x} = a^{(3)} = z^{(3)} = W^{(2)}a + b^{(2)}</math>. Because the output <math>\hat{x} </math> is a now linear function of the hidden unit activations, by varying <math>W^{(2)}</math>, each output unit <math>a^{(3)}</math> can be made to produce values greater than 1 or less than 0 as well. This allows us to train the sparse autoencoder real-valued inputs without needing to pre-scale every example to a specific range. | ||
| - | + | Since we have changed the activation function of the output units, the gradients of the output units also change. Recall that for each output unit, we had set set the error terms as follows: | |
| + | :<math> | ||
| + | \begin{align} | ||
| + | \delta_i^{(3)} | ||
| + | = \frac{\partial}{\partial z_i} \;\; | ||
| + | \frac{1}{2} \left\|y - \hat{x}\right\|^2 = - (y_i - \hat{x}_i) \cdot f'(z_i^{(3)}) | ||
| + | \end{align} | ||
| + | </math> | ||
| + | where <math>y = x</math> is the desired output, <math>\hat{x}</math> is the output of our autoencoder, and <math>f(\cdot)</math> is our activation function. Because in | ||
| + | the output layer we now have <math>f(z) = z</math>, that implies <math>f'(z) = 1</math> and thus | ||
| + | the above now simplifies to: | ||
| + | :<math> | ||
| + | \begin{align} | ||
| + | \delta_i^{(3)} = - (y_i - \hat{x}_i) | ||
| + | \end{align} | ||
| + | </math> | ||
| + | :<math> | ||
| + | \begin{align} | ||
| + | \delta_i^{(3)} | ||
| + | = \frac{\partial}{\partial z_i} \;\; | ||
| + | \frac{1}{2} \left\|y - \hat{x}\right\|^2 = - (y_i - \hat{x}_i) \cdot f'(z_i^{(3)}) | ||
| + | \end{align} | ||
| + | </math> | ||
| + | |||
| + | |||
| + | Of course, when using backpropagation to compute the error terms for the ''hidden'' layer: | ||
| + | :<math> | ||
| + | \begin{align} | ||
| + | \delta^{(2)} &= \left( (W^{(2)})^T\delta^{(3)}\right) \bullet f'(z^{(2)}) | ||
| + | \end{align} | ||
| + | </math> | ||
| + | Because the hidden layer is using a sigmoid (or tanh) activation <math>f</math>, in the equation above <math>f'(\cdot)</math> should still be the | ||
| + | derivative of the sigmoid (or tanh) function. | ||
== Linear Decoder == | == Linear Decoder == | ||
