liveBook · Manning

Momentum

As explained in Math and Architectures of Deep Learning

An optimization strategy that accelerates parameter updates using accumulated past gradients or a lookahead variant to smooth descent on the loss surface.

Momentum-based gradient descent updates parameters using a weighted average of the current gradient estimate and earlier gradient estimates. Recent gradients receive greater weight, while older gradients receive less. Consistent downhill components reinforce one another, and noisy components tend to cancel, producing a more reliable direction toward the minimum. section 9.4

Momentum connects naturally to several optimization methods:

  • Momentum amplifies the downhill component progressively as iterations continue. section 9.2.9
  • Nesterov accelerated gradients use one-step lookahead: estimate the destination, evaluate the gradient there, and average that gradient with the previous update. section 9.2.6
  • Adam combines momentum’s weighted gradient averaging with RMSProp’s adaptive treatment of dimensions having large or small gradients, adding bias correction for early iterations. section 9.2.9

Overshooting near a minimum

Imagine descending a cone-shaped loss surface. Momentum can carry an update past the minimum, causing the loss to rise. Nesterov evaluates the gradient at the estimated destination; near the minimum, that gradient points opposite to the previous update, so the weighted directions partially cancel and produce a smaller step. section 9.2.6

How Math and Architectures of Deep Learning covers it

How deep it goes
Explains weighted gradient accumulation, geometric intuition, overshooting, Nesterov lookahead, and Adam’s related state vectors.
Examples
Uses a cone-shaped loss surface, overshooting diagrams, and PyTorch optimizer configurations as concrete illustrations.
What it assumes
Assumes gradient-based loss minimization and parameter updates, while motivating momentum through intuitive loss-surface behavior.
What you can do after
Apply it via PyTorch by configuring SGD with momentum or Nesterov momentum and comparing related optimizers.
How it connects
Connects momentum to gradient descent, Nesterov accelerated gradients, RMSProp, Adam, and AdaGrad.

Also explained in

Compare how 6 books explain momentum →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Math and Architectures of Deep Learning. The section links point to the parts of the book it draws on.