Backpropagation derivation using Leibniz notation: Difference between revisions

From Machinelearning
No edit summary
No edit summary
Line 13: Line 13:
Backpropagation works recursively starting at the later layers. Since we are trying to compute <math>\frac{\partial C}{\partial a^l_j}</math> for the <math>l</math>th layer, we can assume inductively that we have already computed <math>\frac{\partial C}{\partial a^{l+1}_i}</math>.
Backpropagation works recursively starting at the later layers. Since we are trying to compute <math>\frac{\partial C}{\partial a^l_j}</math> for the <math>l</math>th layer, we can assume inductively that we have already computed <math>\frac{\partial C}{\partial a^{l+1}_i}</math>.


It remains to find <math>\frac{\partial a^{l+1}_i}{\partial a^l_j}</math>. But <math>a^{l+1}_i = \sigma(z^{l+1}_i) = \sigma\left(\sum_j w^{l+1}_{ij}a^l_j + b^{l+1}_i\right)</math>
It remains to find <math>\frac{\partial a^{l+1}_i}{\partial a^l_j}</math>. But <math>a^{l+1}_i = \sigma(z^{l+1}_i) = \sigma\left(\sum_j w^{l+1}_{ij}a^l_j + b^{l+1}_i\right)</math> so we have
 
<math>\frac{\partial a^{l+1}_i}{\partial a^l_j} = \sigma'(z^{l+1}_i)w^{l+1}_{ij}</math>.

Revision as of 22:37, 8 November 2018

The cost function C depends on wjkl only through the activation of the jth neuron in the lth layer, i.e. on the value of ajl. Thus we can use the chain rule to expand:

Cwjkl=Cajlajlwjkl

We know that ajlwjkl=σ(zjl)akl1 because ajl=σ(zjl)=σ(kwjklakl1+bjl). We have used the chain rule again here.

In turn, C depends on ajl only through the activations of the (l+1)th layer. Thus we can write:

Cajl=i{1,,n(l+1)}Cail+1ail+1ajl

where n(l+1) is the number of neurons in the (l+1)th layer.

Backpropagation works recursively starting at the later layers. Since we are trying to compute Cajl for the lth layer, we can assume inductively that we have already computed Cail+1.

It remains to find ail+1ajl. But ail+1=σ(zil+1)=σ(jwijl+1ajl+bil+1) so we have

ail+1ajl=σ(zil+1)wijl+1.