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





