Library
Mathematics

The Intuition of Backpropagation

An exploration of backpropagation as a dynamic application of the chain rule to minimize error in neural networks.

Scene 1 of 5
The Network as a Function
InputWeights (W)
f(x;W)=yf(x; W) = y
Think of a neural network as a giant, flexible machine with thousands of knobs called weights. When we feed an input in, these knobs transform it through layers until an output emerges.
Step-by-step solver
1

Compute Cost

Define the error between the model output and actual target values.

C(w)=12(yytrue)2C(w) = \frac{1}{2}(y - y_{true})^2
2

Find Local Gradients

Apply the chain rule to find how the cost changes with respect to individual weights.

Cwij(l)=δj(l)ai(l1)\frac{\partial C}{\partial w_{ij}^{(l)}} = \delta_j^{(l)} a_i^{(l-1)}
3

Update Weights

Apply gradient descent to adjust each weight by a small amount scaled by the learning rate.

wwηCww \leftarrow w - \eta \frac{\partial C}{\partial w}

Original question

explain to me backpropogation

Follow-up chat

Ask me anything about this lesson — I'll answer using what we just covered.