liveBook · Manning

Backpropagation

As explained in Sutskever's List

Backpropagation is a procedure for computing derivatives of an output or loss with respect to inputs and parameters by applying the chain rule backward through a computational graph.

Backpropagation computes how a network’s loss changes with each weight by applying the chain rule backward through the network. Those gradients guide parameter updates through gradient descent. Popularized in the 1980s as a practical way to train multilayer artificial neural networks, it helped renew interest in the field. section 2.0

How Sutskever's List covers it

How deep it goes
Explains gradient computation and its role in training, without deriving the chain rule or detailing implementation.
What it assumes
Recaps weights, biases, prediction error, loss functions, and gradient descent while explaining the training context.
What you can do after
Understand how parameter gradients enable neural-network training to reduce prediction error.
How it connects
Connects artificial neural networks to loss functions and gradient descent.

Also explained in

Compare how 17 books explain backpropagation →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Sutskever's List. The section links point to the parts of the book it draws on.