Index Ai Academy
Foundation · Calculus

Faster descent: momentum and Adam

Momentum and Adam by hand, the bias correction, and three optimizers down one narrow valley.

About 40 minutes · Free lesson

What it covers6

Why it matters

Almost no real model is trained with plain gradient descent. The optimizer in nearly every training script is Adam, and its update is three short formulas you can already read: two moving averages from lesson 27 and a step from lesson 79. This lesson runs momentum and Adam by hand, writes both as loops, sends all three optimizers down the same narrow valley, and then gets the same numbers out of PyTorch.

What you'll be able to do

  • Run momentum by hand for three steps, and say why its steps grow on a steady slope and cancel on a zigzag
  • Run Adam by hand for three steps, with its bias correction, and say what β₁, β₂ and ε each do
  • Write plain descent, momentum and Adam as loops in Python, and compare their loss curves on one bowl
  • Compare the three down a narrow valley, and get the hand numbers again from PyTorch's optim.SGD and optim.Adam
Quick check
Have a guess before you start. Gradient descent always steps straight downhill. In a long, narrow valley with steep sides, what does that do?
  1. It climbs out over the top of the valley
  2. It stops at the first wall it meets
  3. It runs straight along the floor to the bottom
  4. It zigzags from wall to wall and creeps along the floor
Show the answer

It zigzags from wall to wall and creeps along the floor

Straight downhill points mostly at the nearest steep wall, not along the valley. So the steps bounce across it and make little progress along it. Momentum and Adam are two fixes.

The math: averages of slopes

Purpose. Step down faster and steadier than plain descent by averaging the slopes as you go.

Plain gradient descent, from lesson 79, steps against today's slope and forgets every slope before it. In a round bowl that works well. In a long, narrow valley it doesn't. Take the valley

L(w1,w2)=0.1 w12+5 w22L(w_1, w_2) = 0.1\,w_1^2 + 5\,w_2^2

It is gentle along w₁ and steep across w₂. Its slopes are g = (0.2w₁, 10w₂), so at (−6, 1) the slope across is 10 and the slope along is only −1.2: straight downhill points almost straight at the far wall. The steep wall also caps the learning rate. Its curvature is 10, so past η = 2 ÷ 10 = 0.2 the steps across overshoot by more each time (lesson 76), and under that cap the steps along the floor are tiny.

Momentum keeps a velocity v, a running total of the slopes, and steps along it:

v←β v+g,w←w−η vv \leftarrow \beta\, v + g, \qquad w \leftarrow w - \eta\, v

In plain words: keep β of the old velocity, add today's slope, and step along the velocity. Slopes that keep pointing the same way pile up; slopes that flip back and forth cancel.

Quick check
Momentum with β = 0.9 starts at v = 0 and meets the same slope, g = 4, twice. What is v after the second step?
  1. 8
  2. 4
  3. 7.6
  4. 0.76
Show the answer

7.6

First v = 0.9 × 0 + 4 = 4. Then v = 0.9 × 4 + 4 = 7.6. A steady slope piles up: v heads toward 4 ÷ (1 − 0.9) = 40, ten times one slope.

Adam keeps two running averages from lesson 27, both started at 0: m of the slopes, and v of the squared slopes. (Adam's v is not momentum's velocity; the letter is reused.) Each is corrected for its start at 0, and then the step divides one by the other. t counts the steps, from 1:

m←β1m+(1−β1) g,v←β2v+(1−β2) g2m \leftarrow \beta_1 m + (1 - \beta_1)\, g, \qquad v \leftarrow \beta_2 v + (1 - \beta_2)\, g^2
m^=m1−β1 t,v^=v1−β2 t,w←w−η m^v^+ϵ\hat m = \frac{m}{1 - \beta_1^{\,t}}, \qquad \hat v = \frac{v}{1 - \beta_2^{\,t}}, \qquad w \leftarrow w - \eta\, \frac{\hat m}{\sqrt{\hat v} + \epsilon}

In plain words: m̂ is where the slopes point on average, and √v̂ is how big they usually are. Their ratio is about ±1 for every weight, so each weight moves about η, steep or gentle.

The usual settings are β₁ = 0.9, β₂ = 0.999 and ε = 10⁻⁸ (epsilon, a tiny number).

The picture. Step through Adam's first three steps down the valley, seen from above. Each level curve is at half the loss of the one outside it. At each step's slopes an arrow shows −g, straight downhill; then the path grows by the move Adam really makes. The last step runs momentum, plain descent and Adam on from the same start, 18 steps each.

Try it now

Then set ε (epsilon) to 1 and press Use these numbers: the gentle weight's first move shrinks, because 1.2 ÷ (1.2 + 1) is only about half. That's why ε is kept tiny.

What each setting does.

  • β₁ = 0.9 sets how far back the slopes' average looks: about 1 ÷ (1 − 0.9) = 10 steps. It is Adam's momentum: slopes that keep their sign keep their size in m, and slopes that flip cancel.
  • β₂ = 0.999 does the same for the squared slopes, over about 1,000 steps, so √v̂ is a slow, steady gauge of how big each weight's slopes run.
  • ε = 10⁻⁸ keeps the division safe. A weight whose slopes are all near 0 would otherwise divide by almost nothing.

The bias correction. Both averages start at 0, lesson 27's named mistake: after one step m holds only 0.1 of g, and v only 0.001 of g². Dividing by 1 − β₁¹ = 0.1 and 1 − β₂¹ = 0.001 undoes that exactly, so on the first step m̂ is g and v̂ is g², as the flow showed. As t grows, βᵗ shrinks toward 0, the divisor grows toward 1, and the correction fades away.

Quick check
From an earlier lesson: an exponential moving average with β = 0.9 starts at m = 0 and is fed the value 5 three times. It reads 1.355. What does dividing it by 1 − 0.9³ give?
  1. 1.355
  2. 0.271
  3. 4.5
  4. 5
Show the answer

5

1 − 0.9³ = 1 − 0.729 = 0.271, and 1.355 ÷ 0.271 = 5: the value itself. Three 5s average to 5, and the correction removes the pull of the starting 0. That's Adam's m̂.

In your own words
In your own words: why does Adam move every weight by about the learning rate, however steep its slope?

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

In Python: three optimizers as loops

Purpose. Write each optimizer as a short loop, then compare them on one bowl.

Back to lesson 79's bowl, L(x) = (x − 2)² + 1, from x = 0, where the slope is 2(x − 2). Here are plain descent and momentum, three steps each with η = 0.1:

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

x = 0.0
for t in range(3):
    x = x - 0.1 * slope(x)
    print("plain", t + 1, round(x, 4))

x, v = 0.0, 0.0
for t in range(3):
    v = 0.9 * v + slope(x)
    x = x - 0.1 * v
    print("momentum", t + 1, round(v, 4), round(x, 4))

Momentum's first step matches plain descent's, 0.4, because v starts at 0. After that the slopes keep pointing the same way, so v piles up, −4, −6.8, −7.96, and momentum pulls ahead: 1.876 after three steps, against plain descent's 0.976.

Code flow. Now Adam: the math part's six lines inside a loop, three passes from x = 0 with η = 0.5. Step through it and watch m and v, their corrected copies mh and vh, and x. (vh ** 0.5 is the square root.) Float noise from lesson 12 shows here and there: 1 − 0.9 isn't exactly 0.1 in a float, so the first mh reads −4.000000000000001.

The same loop, printing m̂, √v̂ and x after each pass, rounded:

x, m, v = 0.0, 0.0, 0.0
for t in range(1, 4):
    g = 2 * (x - 2)
    m = 0.9 * m + 0.1 * g
    v = 0.999 * v + 0.001 * g ** 2
    mh = m / (1 - 0.9 ** t)
    vh = v / (1 - 0.999 ** t)
    x = x - 0.5 * mh / (vh ** 0.5 + 1e-8)
    print(t, round(mh, 4), round(vh ** 0.5, 4), round(x, 4))

m̂ ÷ √v̂ is −1 on the first pass and close to −1 on the next two (−3.4737 ÷ 3.5353 and −2.9363 ÷ 3.1122), so each step is nearly η: x moves 0.5, then 0.4913, then 0.4717, to 1.463.

Quick check
What does this print?
v, x = 0.0, 0.0
for g in [-4.0, -4.0]:
    v = 0.9 * v + g
    x = x - 0.1 * v
print(round(v, 2), round(x, 2))
  1. -4.0 0.4
  2. -7.6 1.16
  3. -7.6 0.76
  4. -8.0 1.2
Show the answer

-7.6 1.16

v = −4, so x = 0 − 0.1 × (−4) = 0.4. Then v = 0.9 × (−4) − 4 = −7.6, so x = 0.4 + 0.76 = 1.16. The second step is bigger than the first: the velocity piled up.

A named mistake: leaving out the bias correction. Drop mh and vh and step with m and v as they are:

x, m, v = 0.0, 0.0, 0.0
for t in range(1, 4):
    g = 2 * (x - 2)
    m = 0.9 * m + 0.1 * g
    v = 0.999 * v + 0.001 * g ** 2
    x = x - 0.5 * m / (v ** 0.5 + 1e-8)
    print(t, round(x, 4))
print(round(0.001 ** 0.5, 4), round(0.1 / 0.001 ** 0.5, 4))

The first step lands at 1.5811, not 0.5, and the second throws x past the bottom at 2 to 3.2989. You might expect the opposite: m alone starts too small, as an average started at 0 does in lesson 27. But v starts far smaller still, holding only 0.001 of g², so its square root holds only √0.001 = 0.0316 of |g|. So m ÷ √v comes out 0.1 ÷ √0.001 = 3.1623 times too big, and 0.5 × 3.1623 = 1.5811. The two biases don't cancel. The correction removes both, so the first step is η.

Worked example

Worked example: three optimizers, twelve steps, one bowl

Run plain descent and momentum with η = 0.1, and Adam with η = 0.5, for 12 steps each from x = 0, and keep the loss after every step, rounded to 2 places.

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

x, plain = 0.0, []
for t in range(1, 13):
    x = x - 0.1 * 2 * (x - 2)
    plain.append(round(loss(x), 2))

x, v, mom = 0.0, 0.0, []
for t in range(1, 13):
    v = 0.9 * v + 2 * (x - 2)
    x = x - 0.1 * v
    mom.append(round(loss(x), 2))

x, m, v, adam = 0.0, 0.0, 0.0, []
for t in range(1, 13):
    g = 2 * (x - 2)
    m = 0.9 * m + 0.1 * g
    v = 0.999 * v + 0.001 * g ** 2
    x = x - 0.5 * (m / (1 - 0.9 ** t)) / ((v / (1 - 0.999 ** t)) ** 0.5 + 1e-8)
    adam.append(round(loss(x), 2))
print(plain)
print(mom)
print(adam)
In the lesson you can change this and run it.

Plain descent falls smoothly to 1.02, near the floor of 1. Momentum falls faster at first, to 1.02 by step 3, but its velocity carries x past the bottom: the loss climbs back to 3.01 at step 6 before it swings down again. Adam's steps stay near 0.5 long, so it too overshoots and swings, reaching 1.36 at step 12. The plot below draws all three lists.

The plot types in those three lists and draws them against the step number:

import matplotlib.pyplot as plt

steps = range(1, 13)
plt.plot(steps, [3.56, 2.64, 2.05, 1.67, 1.43, 1.27, 1.18, 1.11, 1.07, 1.05, 1.03, 1.02], label="plain")
plt.plot(steps, [3.56, 1.85, 1.02, 1.38, 2.35, 3.01, 2.87, 2.09, 1.3, 1.0, 1.26, 1.73], label="momentum")
plt.plot(steps, [3.25, 2.02, 1.29, 1.01, 1.08, 1.33, 1.61, 1.78, 1.82, 1.73, 1.55, 1.36], label="Adam")
plt.xlabel("step")
plt.ylabel("loss")
plt.legend()
plt.show()
Quick check
Read the plot. Which optimizer has the lowest loss at step 12, and why?
  1. Adam: its steps are always exactly η
  2. None: all three end level at 1
  3. Plain descent: on a round bowl, straight down is right
  4. Momentum: its velocity makes it the fastest
Show the answer

Plain descent: on a round bowl, straight down is right

Plain descent ends at 1.02, close to the floor. On a round bowl, downhill points at the bottom, so a good plain rate is hard to beat; momentum's velocity and Adam's steady steps overshoot. They earn their keep where slopes differ in scale or keep flipping, like the math part's valley, where Adam got the loss to 0.1132 in 18 steps and plain descent only to 1.0051.

Drill

Two optimizers as functions

Fix momentum(lr, steps) so it keeps PyTorch's velocity, v = 0.9v + g, and adam(lr, steps) so it corrects both averages before it steps. Both start at x = 0 on the bowl and return the final x. The starter has one slip in each.

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

def momentum(lr, steps):
    x, v = 0.0, 0.0
    for t in range(steps):
        v = 0.9 * v + 0.1 * slope(x)
        x = x - lr * v
    return x

def adam(lr, steps):
    x, m, v = 0.0, 0.0, 0.0
    for t in range(1, steps + 1):
        g = slope(x)
        m = 0.9 * m + 0.1 * g
        v = 0.999 * v + 0.001 * g ** 2
        x = x - lr * m / (v ** 0.5 + 1e-8)
    return x

print(round(momentum(0.1, 3), 4), round(adam(0.5, 3), 4))
In the lesson, your code is checked as you write it.
In your own words
On the bowl, momentum was ahead after three steps and behind after twelve. Why?

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

In AI and ML: the optimizer in every training loop

Purpose. Nearly every training script steps with Adam. Read its settings, and get your hand numbers out of PyTorch.

Steps the same size, whatever the units. The trail club predicts how long a walk takes, in hours, from its length in km and its climb in meters: ŷ = w₁ × length + w₂ × climb. A climb runs to hundreds of meters, so the slope for w₂ comes out far bigger than the slope for w₁. Here is the first step from w = (0, 0), both ways, with η = 0.001:

import numpy as np

km = np.array([4.0, 8.0, 10.0, 14.0])
climb = np.array([200.0, 600.0, 300.0, 900.0])
hours = np.array([1.5, 3.5, 3.0, 5.5])
e = 0.0 * km + 0.0 * climb - hours
g = np.array([2 / 4 * (e @ km), 2 / 4 * (e @ climb)])
print(g.tolist(), round(g[1] / g[0], 1))
lr = 0.001
print("plain:", np.round(-lr * g, 4).tolist())
m = 0.1 * g
v = 0.001 * g ** 2
print("Adam: ", np.round(-lr * (m / 0.1) / (np.sqrt(v / 0.001) + 1e-8), 4).tolist())

The slopes are −70.5 and −4,125: the climb weight's is 58.5 times bigger, only because climb is counted in meters. Plain descent's first move follows suit, 0.0705 for length and 4.125 for climb: a claim that every meter of climb adds four hours. Adam moves both weights 0.001, which is η. Its step is set by the learning rate, not by the units. That's why Adam's default rate, 0.001, works for so many models, while plain descent's rate has to be tuned to its steepest weight.

Quick check
One weight's slopes are always about 100 times another's. In plain descent and in Adam, how do their steps compare?
  1. Plain: the same. Adam: 100 times bigger
  2. Plain: 100 times bigger. Adam: the same, η
  3. About the same size in both
  4. 100 times bigger in both
Show the answer

Plain: 100 times bigger. Adam: the same, η

Plain descent's step is η × g, so it grows with the slope. Adam's is η × m̂ ÷ √v̂, and that ratio is about ±1 whatever the slope's scale.

In PyTorch. Both optimizers are built in. Each is made from the weights it moves and its hyperparameters, the settings you choose: lr is η, momentum is β, betas is (β₁, β₂). Each training step then runs lesson 79's three calls: zero_grad() clears the old slopes, backward() finds the new ones, and step() makes the move. Three steps of each on the bowl, from x = 0:

import torch

x = torch.tensor(0.0, requires_grad=True)
opt = torch.optim.SGD([x], lr=0.1, momentum=0.9)
for t in range(3):
    opt.zero_grad()
    loss = (x - 2) ** 2 + 1
    loss.backward()
    opt.step()
    print("momentum", round(x.item(), 4))

x = torch.tensor(0.0, requires_grad=True)
opt = torch.optim.Adam([x], lr=0.5, betas=(0.9, 0.999))
for t in range(3):
    opt.zero_grad()
    loss = (x - 2) ** 2 + 1
    loss.backward()
    opt.step()
    print("Adam", round(x.item(), 4))

The same numbers as your loops: 0.4, 1.08 and 1.876 for momentum, and 0.5, 0.9913 and 1.463 for Adam. Read the two formulas side by side once more. PyTorch's momentum keeps v = 0.9v + g, with no (1 − β) on the slope: its v is a running total, which settles at 1 ÷ (1 − 0.9) = 10 times a steady slope. Adam's two averages do use (1 − β), as true moving averages do, and its bias correction then divides by 1 − βᵗ. Some libraries write momentum with (1 − β) too; their η must then be 10 times bigger to take the same steps.

Quick check
PyTorch's momentum meets the same slope three times. What does this print?
v = 0.0
for g in [2.0, 2.0, 2.0]:
    v = 0.9 * v + g
print(round(v, 2))
  1. 5.42
  2. 2.0
  3. 6.0
  4. 0.54
Show the answer

5.42

v goes 2, then 0.9 × 2 + 2 = 3.8, then 0.9 × 3.8 + 2 = 5.42, on its way to 2 ÷ 0.1 = 20. With (1 − β) on the slope, as Adam's m has, it would read 0.54 and head for 2.

Drill

One Adam step for many weights

Fix adam_step(w, g, m, v, t, lr) so it corrects m and v for their start at 0 before it steps, with β₁ = 0.9, β₂ = 0.999 and ε = 1e-8. It takes and returns NumPy arrays, one number per weight. As written, its first step goes too far: the math part's flow moved each weight 0.4.

import numpy as np

def adam_step(w, g, m, v, t, lr):
    m = 0.9 * m + 0.1 * g
    v = 0.999 * v + 0.001 * g ** 2
    w = w - lr * m / (np.sqrt(v) + 1e-8)
    return w, m, v

w, m, v = adam_step(np.array([-6.0, 1.0]), np.array([-1.2, 10.0]), np.zeros(2), np.zeros(2), 1, 0.4)
print(np.round(w, 4).tolist())
In the lesson, your code is checked as you write it.
In your own words
A model trains well with Adam at η = 0.001. Someone switches to plain descent with the same η, and the loss barely moves. What's going on?

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

Goes deeper in

Practice what you just read

  • 7 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

Which is PyTorch's momentum update?

  1. v ← βv + g, then w ← w − ηv
  2. v ← βv + (1 − β)g, then w ← w − v
  3. w ← w − ηg, with no v
  4. w ← w − η × g ÷ |g|

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