Backpropagation derivation using Leibniz notation: Difference between revisions

From Machinelearning
No edit summary
No edit summary
Line 7: Line 7:
In turn, <math>C</math> depends on <math>a^l_j</math> only through the activations of the <math>(l+1)</math>th layer. Thus we can write (using the chain rule once again):
In turn, <math>C</math> depends on <math>a^l_j</math> only through the activations of the <math>(l+1)</math>th layer. Thus we can write (using the chain rule once again):


<math display="block">\frac{\partial C}{\partial a^l_j} = \sum_{i=1}^n(l+1) \frac{\partial C}{\partial a^{l+1}_i} \frac{\partial a^{l+1}_i}{\partial a^l_j}</math>
<math display="block">\frac{\partial C}{\partial a^l_j} = \sum_{i=1}^{n(l+1)} \frac{\partial C}{\partial a^{l+1}_i} \frac{\partial a^{l+1}_i}{\partial a^l_j}</math>


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

Revision as of 22:48, 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 (using the chain rule once again):

Cajl=i=1n(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

Putting all this together, we obtain

Cwjkl=Cajlajlwjkl=(i{1,,n(l+1)}Cail+1ail+1ajl)σ'(zjl)akl1=(i{1,,n(l+1)}Cail+1σ(zil+1)wijl+1)σ'(zjl)akl1