Index Ai Academy
Foundation · Calculus

Gradient descent

Stepping against the gradient, the learning rate, a training loop, and fitting a line.

About 45 minutes · Free lesson

What it covers6

Why it matters

Lesson 75 found minimums by solving f′ = 0. That works for a parabola, but a neural network's loss has millions of inputs and no formula to solve. So training does something humbler and far more general: start somewhere, look at the gradient, take a small step downhill, and repeat until the loss stops falling. That's gradient descent, and it is how every model in this academy is trained, from a straight line to a large language model. This lesson takes its first steps by hand, writes it as a loop, shows what the learning rate does, and fits a line with it, checking the result against lesson 60's exact answer.

What you'll be able to do

  • Walk downhill to a low point: start with a guess, step against the gradient, repeat
  • Use the learning rate to set the step, and recognize steps that are too small, right, and too big
  • Write a training loop that updates variables inside a for loop and prints the loss
  • Fit a line by gradient descent, compare it with the exact answer from elimination, and train it again with PyTorch's zero_grad(), backward() and step()
Quick check
Have a guess before you start. You're on a foggy hillside and want to reach the valley floor. You can only feel the slope under your feet. What do you do?
  1. Step downhill a little, feel again, and repeat
  2. Walk in a straight line until you stop
  3. Step uphill to get a better view
  4. Stay still: you can't see
Show the answer

Step downhill a little, feel again, and repeat

Small steps in the downhill direction, checking the slope each time: that's gradient descent.

The math: step against the gradient, repeat

Purpose. Walk to a low point when no formula gives it.

Start with a guess θ (theta, standing for all the weights). Then repeat one rule:

θ←θ−η ∇L(θ)\theta \leftarrow \theta - \eta \, \nabla L(\theta)

In plain words: new weights = old weights minus the learning rate times the gradient.

The gradient points uphill (lesson 78), so subtracting it moves downhill. The learning rate η scales the step. Near the bottom the gradient shrinks, so the steps shrink too, and the walk settles.

For L(x) = (x − 2)² + 1 from x = 0 with η = 0.25: the slope is −4, so x = 0 − 0.25 × (−4) = 1; then the slope is −2 and x = 1.5; then 1.75, then 1.875, closing in on the bottom at 2.

Quick check
From lesson 48: what is w − ηg for w = (1, 2), g = (4, −2) and η = 0.5?
  1. (1, 3)
  2. (−1, 3)
  3. (3, 1)
  4. (−3, 4)
Show the answer

(−1, 3)

ηg = (2, −1), and (1, 2) − (2, −1) = (−1, 3). Gradient descent is this update, repeated.

The picture. Step through four updates on the bowl (x − 2)² + 1, starting at x = 0 with η = 0.25. The picture draws the curve and the path down it: each step is an arrow from the old point to the new one, and the newest is lit. Watch the arrows shrink as the curve flattens.

Try it now

Then set the learning rate to 0.1 (slower), 0.5 (one step to the bottom), and 1.1 (the steps overshoot and the loss grows).

Symbols and formula. For one weight the rule is x ← x − η·L′(x); for many, each weight moves against its own partial, all at once:

w←w−η ∂L∂w,b←b−η ∂L∂bw \leftarrow w - \eta\,\frac{\partial L}{\partial w}, \qquad b \leftarrow b - \eta\,\frac{\partial L}{\partial b}

In plain words: compute every partial first, then update every weight. Updating w before computing ∂L/∂b would compute that slope at a point the step never stood on.

The learning rate decides everything. Too small, and the walk crawls: with η = 0.1 the bowl's x goes 0.4, 0.72, 0.976, slowly. About right, and it settles quickly. Too big, past 2/L″ from lesson 76, and each step overshoots the bottom by more than it started: with η = 1.1, x goes 4.4, −0.88, 5.456, and the loss climbs.

Quick check
A training run's loss goes 5.0, 6.8, 9.3, 12.9. What is the likely problem?
  1. The gradient is zero
  2. The learning rate is too big
  3. The learning rate is too small
  4. The model is already perfect
Show the answer

The learning rate is too big

A loss that grows each step means every step jumps past the bottom by more than the last.

In your own words
In your own words: why does gradient descent slow down as it nears the bottom, even with a fixed learning rate?

Write a sentence or two, then compare it with a good answer in the lesson.

In Python: a training loop

Purpose. Repeat the update automatically, and watch the loss.

A training loop updates variables inside a for loop: each pass computes the slope, takes a step, and records the loss.

def loss(x):
    return (x - 2) ** 2 + 1

def slope(x):
    return 2 * (x - 2)

x = 0.0
lr = 0.25
for step in range(6):
    x = x - lr * slope(x)
    print(step + 1, round(x, 4), round(loss(x), 4))
It runs right here in your browser, with nothing to install.

The line x = x - lr * slope(x) reads the old x on the right and stores the new one on the left, so each pass starts where the last one ended. The loss falls on every step: 2, 1.25, 1.0625, …, toward the minimum value 1.

Code flow. Step through the same loop, three passes, one line at a time. Watch x, slope and loss: each pass reads the x the last one left, and the slope it finds is smaller each time.

A named mistake: updating one weight before computing the other's slope. With two weights, compute both partials from the same old values, then update both:

w, b = 0.0, 0.0
dw = 2 * (w - 1)
db = 2 * (b + 3)
w = w - 0.1 * dw
b = b - 0.1 * db
print(round(w, 4), round(b, 4))

If w were updated first and the slope for b then read the new w, the step would mix two different points. In this loss each slope only uses its own weight, so it happens not to matter; in a real model, where they're tangled together, it does.

Worked example

Worked example: finding a learning rate that diverges

Run 5 steps on the bowl at four learning rates, and print the final x and loss for each.

def loss(x):
    return (x - 2) ** 2 + 1

for lr in [0.05, 0.5, 0.9, 1.1]:
    x = 0.0
    for step in range(5):
        x = x - lr * 2 * (x - 2)
    print(lr, round(x, 4), round(loss(x), 4))
In the lesson you can change this and run it.

At 0.05 the walk crawls: after 5 steps x is only 0.819. At 0.5 it lands on the bottom at once. At 0.9 it overshoots back and forth, but each bounce is smaller, so it still settles near 2. At 1.1 every bounce is bigger than the last: x ends at 6.977 and the loss has grown to 25.77. The dividing line is η = 1, which is 2 ÷ L″ for this bowl.

Quick check
What does this print?
x = 4.0
for step in range(2):
    x = x - 0.25 * 2 * (x - 2)
print(x)
  1. 5.0
  2. 2.5
  3. 2.0
  4. 3.0
Show the answer

2.5

From 4 the slope is 4, so x = 4 − 1 = 3; then the slope is 2, so x = 3 − 0.5 = 2.5.

Plot the loss. A list of losses is easier to read as a picture. This loop keeps the loss after each of 10 steps with η = 0.25, then draws it against the step number:

import matplotlib.pyplot as plt

x, losses = 0.0, []
for step in range(10):
    x = x - 0.25 * 2 * (x - 2)
    losses.append((x - 2) ** 2 + 1)
plt.plot(range(1, 11), losses)
plt.xlabel("step")
plt.ylabel("loss")
plt.show()
Quick check
Read the plot. Where does the loss curve level off, and why there?
  1. At 2, the first step's loss
  2. At 1, the loss at the bottom, x = 2
  3. At 0: every loss falls to 0
  4. It never levels off: it keeps falling
Show the answer

At 1, the loss at the bottom, x = 2

(x − 2)² + 1 is smallest at x = 2, where it equals 1. The walk closes in on x = 2, so the loss closes in on 1, and the slope, and with it each step, shrinks toward 0.

Drill

A loop that descends

Fix the loop so it moves against the slope. Then set final to x after 10 steps from 5 with η = 0.2, rounded to 4 places, and diverges to the smallest rate in rates whose loss after 10 steps is bigger than the starting loss.

def loss(x):
    return (x - 2) ** 2 + 1

def run(lr, steps):
    x = 5.0
    for step in range(steps):
        x = x + lr * 2 * (x - 2)
    return x

final = round(run(0.2, 10), 4)
rates = [0.3, 0.8, 1.05, 1.2]
diverges = 0
print(final, diverges)
In the lesson, your code is checked as you write it.
In your own words
Why does η = 0.9 still settle, while η = 1.1 blows up, though both overshoot the bottom?

Write a sentence or two, then compare it with a good answer in the lesson.

In AI and ML: training a model

Purpose. This is how every model in the academy is trained.

Fit a line ŷ = w·x + b to four days of tent data from w = 0, b = 0. Each pass computes the errors, the gradient from lesson 78, and one update:

e=wx+b−y,w←w−η 2n e⋅x,b←b−η 2n∑e\mathbf{e} = w\mathbf{x} + b - \mathbf{y}, \quad w \leftarrow w - \eta\,\tfrac{2}{n}\,\mathbf{e}\cdot\mathbf{x}, \quad b \leftarrow b - \eta\,\tfrac{2}{n}\textstyle\sum e

In plain words: predict, measure the errors, compute both slopes, step both weights. Repeat.

import numpy as np

x = np.array([1.0, 2.0, 3.0, 4.0])
y = np.array([3.0, 5.0, 6.0, 9.0])
w, b = 0.0, 0.0
for step in range(1000):
    e = w * x + b - y
    dw = 2 / 4 * (e @ x)
    db = 2 / 4 * np.sum(e)
    w = w - 0.05 * dw
    b = b - 0.05 * db
print(round(w, 4), round(b, 4), round(np.mean((w * x + b - y) ** 2), 4))

After 1,000 steps: w = 1.9, b = 1.0, loss 0.175. Lesson 60's exact method solves for the same weights in one go; gradient descent gets there by walking, which also works when no exact method exists.

Quick check
Why train networks by gradient descent instead of solving for the best weights directly, as lesson 60 did for a line?
  1. Networks have no loss
  2. Solving is only for integers
  3. No equations to solve; descent needs only a gradient
  4. Descent always gives the exact answer in a few steps
Show the answer

No equations to solve; descent needs only a gradient

The line's loss leads to linear equations; a network's doesn't. Walking downhill only needs the gradient, which any differentiable loss has.

In PyTorch. The same training run in the real tool. w and b are tensors that record how they're used (requires_grad=True, from lesson 72), and torch.optim.SGD is the optimizer that takes the steps:

import torch

x = torch.tensor([1.0, 2.0, 3.0, 4.0])
y = torch.tensor([3.0, 5.0, 6.0, 9.0])
w = torch.tensor(0.0, requires_grad=True)
b = torch.tensor(0.0, requires_grad=True)
opt = torch.optim.SGD([w, b], lr=0.05)
for step in range(1000):
    opt.zero_grad()
    loss = ((w * x + b - y) ** 2).mean()
    loss.backward()
    opt.step()
print(round(w.item(), 4), round(b.item(), 4), round(((w * x + b - y) ** 2).mean().item(), 4))

It prints 1.9, 1.0 and 0.175, the NumPy cell's numbers. Read the two loops line for line:

NumPy loopPyTorch loop
(nothing to clear)opt.zero_grad(): clear the last step's slopes
e = w * x + b - yloss = ((w * x + b - y) ** 2).mean()
dw = … and db = … by handloss.backward(): fills w.grad and b.grad
w = w - 0.05 * dw, and the same for bopt.step(): every weight minus lr times its .grad

The learning rate 0.05 and the 1,000 steps are hyperparameters: settings you choose before training starts, unlike w and b, which training learns.

Quick check
A training loop leaves out opt.zero_grad(). What goes wrong?
  1. The learning rate falls to 0
  2. Nothing: backward() overwrites .grad each time
  3. backward() adds to the old slopes, so they pile up
  4. The loss is never computed
Show the answer

backward() adds to the old slopes, so they pile up

backward() adds its slopes into .grad. Without zero_grad(), step 2 uses the slopes of steps 1 and 2 added together, step 3 three of them, and so on, so the steps come out wrong.

What real training adds. Real data sets are too big to use every example on every step, so each step uses a small random batch: stochastic gradient descent, the S in SGD. Optimizers like momentum and Adam, in lesson 80, reuse past gradients to move faster through flat stretches and narrow valleys. Learning rates often start larger and shrink over time. But the heart of every one of them is the line you've written: weights minus learning rate times gradient.

Watching the loss is the habit. Printing the loss every so often is how you know training is working: it should fall quickly at first, then more slowly, then flatten (lesson 70). A loss that rises means the steps are too big; one that barely moves means they're too small, or the model has learned what it can. A plot of the loss against the step number, like the one you drew in the Python part, shows all three at a glance.

Quick check
Three training steps on the tent data from w = 0, b = 0, η = 0.05. What does this print?
import numpy as np

x = np.array([1.0, 2.0, 3.0, 4.0])
y = np.array([3.0, 5.0, 6.0, 9.0])
w, b = 0.0, 0.0
losses = []
for step in range(3):
    e = w * x + b - y
    w = w - 0.05 * 2 / 4 * (e @ x)
    b = b - 0.05 * 2 / 4 * np.sum(e)
    losses.append(float(round(np.mean((w * x + b - y) ** 2), 4)))
print(losses)
  1. [1.2134, 0.2186, 0.1911]
  2. [37.75, 1.2134, 0.2186]
  3. [1.2134, 1.2134, 1.2134]
  4. [0.1911, 0.2186, 1.2134]
Show the answer

[1.2134, 0.2186, 0.1911]

The loss starts at 37.75 and falls fast: 1.2134, 0.2186, 0.1911. Most of the improvement comes in the first steps.

Drill

Train for 200 steps

Train the line on the data below for 200 steps from w = 0, b = 0, with η = 0.05. Set w_out, b_out and loss_out, each rounded to 3 places, and close to whether w is within 0.01 of the exact answer, 2.

import numpy as np

x = np.array([0.0, 1.0, 2.0, 3.0])
y = np.array([1.0, 3.0, 5.0, 7.0])
w, b = 0.0, 0.0
for step in range(200):
    e = w * x + b - y
    w = w - 0.05 * e.sum()
w_out = round(w, 3)
b_out = round(b, 3)
loss_out = 0
close = False
print(w_out, b_out, loss_out, close)
In the lesson, your code is checked as you write it.
In your own words
The exact method gives w = 1.9 at once, while gradient descent took 1,000 steps. Why is descent still the method that trains real models?

Write a sentence or two, then compare it with a good answer in the lesson.

Goes deeper in

Practice what you just read

  • 6 code examples you can edit and run
  • a practice exercise that checks your code
  • a 5-question quiz
  • 9 review cards for spaced repetition

Try a quiz question

What is the gradient-descent update for weights θ?

  1. θ ← θ − η∇L
  2. θ ← θ + η∇L
  3. θ ← η∇L
  4. θ ← θ − ∇L ÷ η

Answer it at the end of the lesson to see if you're right, and why.

Before this lesson

Keep learning

Where this lesson leads.

575 lessons in thirteen phases. 176 are free without an account, and a free account opens the rest. See every lesson.

Foundation · about 96 hours of study

Foundation math

From whole numbers to the math inside a neural network: each idea by hand, in Python, and in AI 118 lessons All free
  1. Numbers and place value FreeWhat a digit's place is worth, the number line, and Python as a calculator that never tires.36 min
  2. Multiplying and dividing: groups FreeEqual groups, quotient and remainder, and cutting training data into batches.35 min
  3. Order of operations, and names for numbers FreeBrackets, powers, then multiply and divide, then add and subtract; variables hold numbers.36 min
  4. Numbers below zero FreeThe number line through zero, sign rules, distance from zero, and an error's direction and size.37 min
  5. Fractions: equal parts, equal fractions, adding FreePieces of a whole, equal fractions, and re-cutting to add; accuracy as a fraction.45 min
  6. Multiplying and dividing fractions FreeA share of a share, dividing by flipping, and why chances in a row get small.35 min
  7. Decimals and rounding FreeFractions in place value, rounding, and why 0.1 + 0.2 isn't exactly 0.3.36 min
  8. Percentages FreePer hundred, percent change, percentage points, and the accuracy and error rates of models.35 min
  9. Ratios, rates and proportion FreeSharing in a ratio, rates per unit, scaling, and splitting data 80/10/10.35 min
  10. Powers and roots FreeRepeated multiplying, the laws of exponents, square roots, and squared error.43 min
  11. Very big and very small numbers FreePowers of ten, e-notation like 3e-4, orders of magnitude, and a model's size in memory.36 min
  12. Bits, bytes and floats: how numbers are stored FreeBase 2, what n bits can hold, a float as sign, power and digits, and a tensor's memory.35 min
  13. Review: find the slip (numbers) FreeBroken calculations to fix, mixed practice from the whole module, and its formula sheet.34 min
  14. Letters for numbers FreeVariables, terms and like terms, substitution, and a model's formula as a Python function.41 min
  15. Expanding and factoring FreeBrackets as areas, pulling out common factors, and a squared error expanded into a bowl.41 min
  16. Solving equations: keep the balance FreeThe same move on both sides, undoing steps in reverse, and running a model's formula backward.41 min
  17. Rearranging a formula FreeMaking any letter the subject, round-trip checks, and planning a training run.36 min
  18. Inequalities and true-or-false FreeRanges, flipping the sign, if and elif, and the thresholds, clips and ReLU inside a model.42 min
  19. Functions: a rule from input to output Freef(x) notation, tables and graphs, domain and range, loops over lists, and loss as a function.42 min
  20. Chaining and undoing functions Freeg(f(x)), inverses that undo, scaling and unscaling, and a network as a chain.42 min
  21. Straight lines: slope and intercept FreeRise over run, the line through two points, and a model's weight and bias as slope and intercept.42 min
  22. Two equations, two unknowns FreeSubstitution and elimination, where lines cross, and why models are fitted, not solved.42 min
  23. Quadratics: bowls and their lowest point FreeRoots by factoring and by formula, the discriminant, the vertex, and the best weight of a model.42 min
  24. Exponentials: growth and decay FreeThe same factor each step, the number e, and decaying learning rates.43 min
  25. Logarithms: the power question FreeTo what power?, the laws of logs, and adding log-probabilities instead of multiplying.45 min
  26. Sequences and Σ FreeArithmetic and geometric sequences, Σ as a loop that adds, and mean squared error.40 min
  27. Weighted and moving averages FreeWeights that add to 1, a window average, the exponential moving average, and smoothing a loss curve.35 min
  28. Sets, and reading the symbols FreeSets, union and intersection, ℝⁿ and f : ℝⁿ → ℝᵐ, and reading a paper's first equation.41 min
  29. Review: find the slip (algebra) FreeBroken algebra and code to fix, mixed practice from the whole module, and its formula sheet.34 min
  30. Transposing step by step: undo in reverse order FreeA formula's layers, the opposite of each, peeling from the outside in, conditions, and round-trip checks.35 min
  31. Formulas with fractions: clear them first FreeClearing denominators, cross-multiplying, a letter in the bottom, and reciprocal formulas like 1/R = 1/R₁ + 1/R₂.35 min
  32. When the letter appears twice: collect and factor FreeGathering the letter on one side, factoring it out, dividing by the bracket, and rearranging precision and F1.35 min
  33. Squares, roots and powers FreeSquare roots with ±, squaring to undo a root, cube and nth roots, and the √d inside attention.40 min
  34. When the letter is squared and plain: quadratics FreeRearranging into ax² + bx + c = 0, the formula, completing the square, and choosing the root that fits.35 min
  35. Letters in the power: exponentials and logarithms FreeTaking logs to bring a power down, exponentiating to free a letter, and the logit that undoes the sigmoid.40 min
  36. Rearranging inequalities: when the sign flips FreeThe four moves on an inequality, negatives and reciprocals that flip it, logs below 1, and sample sizes.35 min
  37. Inverse functions, lines and scaling FreeUndoing a function by making x the subject, domains that allow it, line forms, and unscaling predictions.40 min
  38. Sequences and sums: find n, a, d and r FreeEvery letter of the arithmetic and geometric formulas as the subject, and an average's window from its decay.40 min
  39. Combining formulas: substitute and eliminate FreePutting one formula inside another to remove a letter, and sizing a training run from a time or money budget.35 min
  40. Review: rearrange anything (algebra) FreeBroken rearrangements to fix, mixed practice from the whole algebra block, a strategy chart, and its formula sheet.35 min
  41. Coordinates and distance FreePoints as (x, y), Pythagoras, distance in any number of coordinates, and nearest neighbors.42 min
  42. Angles, degrees and radians FreeMeasuring a turn, converting units, arcs, and the angle between two arrows.36 min
  43. Sine and cosine FreeAcross and up: right triangles, the unit circle, and directions and rotations.42 min
  44. Waves: height, speed and shift FreeAmplitude, period and phase, sampling a wave, and position codes in transformers.37 min
  45. Review: find the slip (shapes and waves) FreeBroken geometry and code to fix, mixed practice from the module, and its formula sheet.29 min
  46. Angles, triangles and waves: rearranging with sin, cos and tan FreeSides and angles from SOH CAH TOA, principal values, arcs, polar coordinates, and a wave's time and period.45 min
  47. Vectors: lists of numbers that point FreeA list, a point and an arrow; components, dimension, NumPy arrays, and data as vectors.42 min
  48. Adding and scaling vectors FreeComponent-wise sums, scalar multiples, mixes, and the weight update w − ηg.43 min
  49. Length and distance: norms FreeL2, L1 and max norms, unit vectors, distance, and the norms inside losses and clipping.42 min
  50. The dot product FreeMultiply in pairs and add; a·a as squared length; a @ b; one neuron as a dot product.43 min
  51. Angle, cosine similarity and projection FreeDirection without length, perpendicular vectors, shadows, and search by meaning.45 min
  52. Perpendicular directions: bases and coordinates FreeOrthonormal directions, coordinates as dot products, rebuilding a vector, and taking a direction out.35 min
  53. Matrices: tables of numbers FreeRows, columns and entries; two-dimensional arrays and slices; a data set as a matrix.41 min
  54. Adding, scaling and transposing matrices FreeEntry-by-entry sums and scalings, the transpose, mean images, and tables turned around.36 min
  55. A matrix times a vector FreeEach row dotted with the vector, the size rule, A @ x, and a layer acting on one example.42 min
  56. Matrix multiplication FreeRow meets column, the size rule, order matters, and a batch through a layer: X W + b.45 min
  57. Identity, diagonal, triangular and symmetric FreeFour patterns and their jobs: rescaling, distance tables, and the causal mask.37 min
  58. Matrices as movements of space FreeStretches, flips, shears and rotations; columns as landing spots; chaining; a layer moving data.42 min
  59. Determinant and inverse FreeThe area factor ad − bc, singular matrices, undoing a matrix, and redundant features.42 min
  60. Solving systems by elimination FreeAugmented matrices, row moves, back-substitution, the three outcomes, and fitting weights.45 min
  61. Independence, span and rank FreeRedundant vectors, span, rank, outer products, and low-rank updates like LoRA.42 min
  62. Eigenvectors: directions that only stretch FreeAv = λv, checking candidates, np.linalg.eig, and the main direction of a data cloud.41 min
  63. SVD and PCA: the important directions first FreeA matrix as pieces by size, the best rank-k copy, compression, and PCA maps of data.45 min
  64. Tensors, shapes and broadcasting FreeAxes and shapes, reshape, axis=, broadcasting, and shapes through a small model.43 min
  65. One-hot vectors and lookup tables: embeddings FreeA one-hot row picks a table's row, a sentence looked up as vectors, and a score for every word.35 min
  66. Sliding dot products: convolution FreeA small pattern slid along a list and over a grid, output sizes, stride and padding, and shared weights.40 min
  67. Review: find the slip (vectors and matrices) FreeShape slips to fix, mixed practice from the module, and its formula sheet with shapes.36 min
  68. Vector equations: rearranging with arrows FreeSolving for a vector or a scale, recovering a gradient from two weight snapshots, and an angle from a dot product.40 min
  69. Matrix equations: multiply by the inverse, on the correct side FreeNo dividing by a matrix: inverses from the left or right, order, transposes, and the normal equations.40 min
  70. Rates of change FreeChange over change, secants, rates from readings with np.diff, and reading a loss curve.41 min
  71. Limits: what a value heads toward FreeApproaching from both sides, holes, corners and jumps, epsilon, and judging activations.37 min
  72. The derivative: slope at a point FreeShrinking secants, f′(x) and dy/dx, Δy ≈ f′Δx, and which way a weight should move.45 min
  73. Derivative rules FreeConstants, powers, multiples, sums, eˣ and ln x, checked numerically, and a squared error's slope.41 min
  74. The product rule and the chain rule FreeProducts and chains of functions, forward then backward, and one neuron's dL/dw.45 min
  75. Lowest points and curvature Freef′ = 0, the second-derivative test, tables, local and global minima, and convex losses.43 min
  76. Standing in for a curve near a point FreeTangent lines, a curvature term, growing error, and why learning rates must be small.37 min
  77. Partial derivatives FreeOne input at a time, ∂, nudging in Python, and the two slopes of a line's loss.41 min
  78. The gradient FreeAll the slopes as a vector, steepest climb and descent, a numerical gradient, and the loss gradient.42 min
  79. Gradient descent FreeStepping against the gradient, the learning rate, a training loop, and fitting a line.45 min
  80. Faster descent: momentum and Adam FreeMomentum and Adam by hand, the bias correction, and three optimizers down one narrow valley.40 min
  81. The chain rule with many paths: backpropagation by hand FreeGraphs, multiply along paths and add across them, gradient checks, and a 2-2-1 network by hand.45 min
  82. Automatic differentiation: how PyTorch finds every slope FreeA tape of steps walked backward, and requires_grad, backward(), .grad, zero_grad() and no_grad().40 min
  83. Jacobians and Hessians FreeSlopes of vector functions, a layer's Jacobian, second partials, and bowls, domes and saddles.42 min
  84. Integrals: adding up thin slices FreeStrip and trapezoid sums, summing undoes differencing, probability as area, and AUC.43 min
  85. Review: find the slip (calculus) FreeCalculus slips to fix, mixed practice from the module, and its formula sheet.36 min
  86. Rearranging in calculus: slopes, steps and constants FreeSetting a slope to zero, Newton's step, the chain rule turned around, constants from a point, and learning rates.45 min
  87. Counting: choices, orders and groups FreeThe counting principle, factorials, ordered picks and groups, and why attention's cost grows with the square of the length.43 min
  88. Probability: from counts to chances FreeEqually likely outcomes, the complement, distributions, seeded simulation, and a next-word model.43 min
  89. Combining events: and, or, independent FreeThe or rule, independence, probability trees, drawing with and without replacement, and chains of steps.42 min
  90. Conditional probability and Bayes' rule FreeConditionals from tables, why P(A | B) isn't P(B | A), Bayes' rule, and precision and recall.45 min
  91. Random variables and distributions FreeUncertain numbers, the probability of a range, sampling by slices, and sampling versus argmax.42 min
  92. Expected value, variance and standard deviation FreeProbability-weighted averages, spread in the data's own units, and a training loss as an expected value.42 min
  93. Bernoulli, binomial, uniform and normal FreeYes-or-no trials, counts of yeses, the 68-95-99.7 rule, z-scores, and an accuracy's error bar.45 min
  94. Two variables at once: covariance and correlation FreeJoint tables and marginals, covariance, correlation, the covariance matrix, and features that carry the same information.45 min
  95. Review: find the slip (probability) FreeProbability slips to fix, mixed practice from the module, and its formula sheet.36 min
  96. Probability formulas: solve for the missing chance FreeConditionals, Bayes' rule for the prior, the or rule, expected values, variance, and z-scores turned around.45 min
  97. Describing data: center, spread and scale FreeMean, median and mode, variance and standard deviation, percentiles, outliers, and standardizing features.42 min
  98. Samples, the law of large numbers and the central limit theorem FreeSamples and populations, the standard error σ/√n, the bell of averages, and error bars on test scores.43 min
  99. Is the difference real? Comparing two models FreePaired differences, a bootstrap interval, what a p-value is and isn't, and why many tries make lucky wins.40 min
  100. Maximum likelihood FreeLikelihoods as products, log-likelihoods as sums, grid search, underflow, and the negative log-likelihood loss.45 min
  101. Linear regression: the best line FreeResiduals, least squares by formula, three roads to one line, the matrix form, and train versus test error.45 min
  102. Logistic regression: a line that answers yes or no FreeThe sigmoid, the log loss, its slope p − y, a training loop, and choosing a threshold.45 min
  103. Scoring a classifier: confusion table, precision, recall, F1 FreeThe four cells, accuracy, precision, recall and F1, and what moving a threshold does to each.35 min
  104. Softmax: scores into probabilities FreeExponentiate and share out, shifting and temperature, the safe softmax, and a classifier's last step.43 min
  105. Surprise, entropy and cross-entropy FreeSurprise in bits, entropy, cross-entropy and KL divergence, perplexity, and a language model's loss.45 min
  106. KL divergence: how far one distribution is from another FreeKL by hand, cross-entropy as entropy plus KL, why it isn't symmetric, and a soft-target loss.35 min
  107. Review: find the slip (statistics and information) FreeStatistics slips to fix, mixed practice from the module, and its formula sheet.38 min
  108. Statistics and information: n, z, logits and bits FreeSample sizes from error bars, inputs from probabilities, logit gaps from softmax, and chances from bits and losses.40 min
  109. One neuron, start to finish FreeWeighted sum, activation, loss, slopes and update, by hand and in code, and what one straight line can and can't split.45 min
  110. A layer and a small network as matrices FreeTwo layers on a batch, the shape of every matrix, adding a hidden unit, and XOR solved.45 min
  111. Training a small network FreeThe backward pass in matrix form, gradient checks, a full training loop, and reading loss curves.45 min
  112. The same network in PyTorch Freenn.Sequential with the NumPy weights loaded, the same loss and slopes, then SGD and mini-batches.45 min
  113. Attention as matrix math FreeScaled dot-product scores, the causal mask, a row-by-row softmax, and blending value vectors.45 min
  114. Residual connections and layer norm FreeAdding the input back and why its slope keeps learning alive, layer norm by hand, and add and norm.40 min
  115. A transformer block, start to finish FreeA sentence through embeddings, attention, add and norm, a small network and next-word scores, every shape named.45 min
  116. Planning a model: rearranging the formulas of a working network FreeLayer widths from parameter counts, sizes from memory and compute, the attention scale, and a training plan.40 min
  117. Final test: transpose any formula FreeSlips to fix from every topic, mixed practice of every kind of rearranging, the strategy chart and the full sheet.45 min
  118. Capstone: a sign reader from the formulas FreeBuild, train and test a trail-sign classifier with NumPy alone, and report its accuracy with an error bar.45 min
Part of a free course 118 lessons

The Foundation Math For Ai & ML: from arithmetic to attention

Learn the math behind AI from arithmetic up: numbers, algebra, vectors and matrices, calculus, probability and statistics, each shown as numbers moving and checked in Python, ending with a network you build and train from the formulas.

Never trained an AI? Teach a small one to write, right in your browser. It takes about 20 seconds and needs no account. Teach it to write