liveBook · Manning

Stochastic gradient descent

As explained in Sutskever's List

Stochastic gradient descent is an iterative optimization method that updates parameters using gradients estimated from individual examples or randomly selected small batches.

Stochastic gradient descent (SGD) trains neural networks by adjusting weights opposite the gradient, which points toward increasing loss. Mini-batches provide a noisy estimate of the downhill direction; momentum smooths updates by carrying information from recent steps. As a first-order method, SGD uses local gradient information without curvature, making it computationally efficient for large networks. section 2.5.4

A hiker in fog

Imagine a hiker scanning a small patch of ground to choose a downhill step: the patch stands for a random mini-batch, and momentum helps steady the noisy path. AlexNet used batches of 128 images, momentum of 0.9, and an initial learning rate of 0.01, which was reduced tenfold when validation accuracy flattened. section 2.5.4

How Sutskever's List covers it

How deep it goes
Explains noisy gradient estimates, momentum, and learning-rate scheduling, while distinguishing first-order updates from curvature information.
Examples
Uses a foggy-hiker analogy and AlexNet's 128-image batches, 0.01 initial rate, and validation-triggered tenfold reductions.
What you can do after
Apply mini-batch updates with momentum and reduce the learning rate when validation accuracy flattens.
How it connects
Connects neural-network training with loss functions, gradients, momentum, learning rates, and validation accuracy.

Also explained in

Compare how 12 books explain stochastic gradient descent →

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.