Index Ai Academy
Foundation · Algebra

Weighted and moving averages

Weights that add to 1, a window average, the exponential moving average, and smoothing a loss curve.

About 35 minutes · Free lesson

What it covers6

Why it matters

A plain average treats every number alike. Models rarely do. Attention mixes words with weights. A training loss bounces from batch to batch, so engineers judge a smoothed copy of it. And the optimizers that train almost every model, momentum and Adam, step along a moving average of the slopes. This lesson builds all three averages from the Σ you just learned: weighted, windowed and exponential.

What you'll be able to do

  • Compute a weighted average, and say why its weights must add to 1
  • Compute a moving average over a window, and an exponential moving average one value at a time
  • Show that an exponential moving average's weights form a geometric sequence that adds to 1, and that it remembers about 1/(1 − β) values
  • Smooth a noisy training loss and read it, and see momentum and Adam as moving averages of slopes
Quick check
Have a guess before you start. Last weekend the tent shop rented its $20 tent 5 times, its $35 tent 3 times and its $50 tent twice. What did an average rental bring in?
  1. $30.50
  2. $101.67
  3. $35
  4. $105
Show the answer

$30.50

5 of the 10 rentals were $20, 3 were $35 and 2 were $50, so the cheap tent counts most: 0.5 × 20 + 0.3 × 35 + 0.2 × 50 = 30.5. That's a weighted average.

The math: averages with weights

Purpose. Average numbers that don't all count the same, then keep a running average that follows new numbers as they arrive.

A plain average adds the values and divides by how many there are. A weighted average gives each value its own weight instead, and the weights add to 1:

xˉw=∑iwixiwith∑iwi=1\bar{x}_w = \sum_i w_i x_i \qquad \text{with} \qquad \sum_i w_i = 1

In plain words: multiply each value by its weight, then add. A weight is the value's share of the vote, and the shares add up to the whole vote, 1.

For the tent shop, half the rentals were the $20 tent, so its weight is 0.5. The $35 tent gets 0.3 and the $50 tent 0.2: the average rental is 0.5 × 20 + 0.3 × 35 + 0.2 × 50 = 30.5 dollars.

Quick check
From an earlier lesson: the mean of 4, 7 and 10 is (1/3) Σ xᵢ. Read as a weighted average, what weight does each value get?
  1. 1/10
  2. 1
  3. 3
  4. 1/3
Show the answer

1/3

(1/3) Σ xᵢ is (1/3) × 4 + (1/3) × 7 + (1/3) × 10. Every value gets the same weight, 1/3, and three of them add to 1. A plain mean is a weighted average with equal weights.

Why the weights must add to 1. Suppose every value were 30. Any fair average of them should be 30. A weighted average gives Σ wᵢ × 30, which is 30 × Σ wᵢ: that's 30 only when the weights add to 1. Weights that add to more inflate every average, and weights that add to less shrink it.

A window average. Here is a week of the tent shop's daily rentals: 12, 18, 9, 15, 21, 12, 18. They jump around. A moving average over a window of 3 averages each day with the two days before it. Day 3 gets (12 + 18 + 9) ÷ 3 = 13. Then the window slides one day along and drops the oldest day: 14, 15, 16 and 17. The jumps cancel out, and a steady climb of one rental a day shows through. Inside the window each day weighs 1/3, and every day outside it weighs 0.

Quick check
Three scores, 70, 80 and 90, get the weights 0.5, 0.3 and 0.4. What's wrong with this average?
  1. The weights add to 1.2, so it comes out too big
  2. The biggest weight must go on the biggest score
  3. Nothing: any three weights will do
  4. The weights add to 1.2, so it comes out too small
Show the answer

The weights add to 1.2, so it comes out too big

0.5 + 0.3 + 0.4 = 1.2, so every score is counted 20% too much and the result lands above all three. Weights must add to 1.

A running average that follows new values. A window has to keep its last few values, and it has a sharp edge: a day counts fully for three days, then not at all. The exponential moving average, or EMA, keeps just one number, m, and blends each new value x into it:

m←β m+(1−β) xm \leftarrow \beta\, m + (1 - \beta)\, x

In plain words: keep a share β of the old average and take a share 1 − β of the new value. The arrow means "becomes": the result replaces the old m.

β is the Greek letter beta, a number from 0 up to, but not including, 1. With β = 0.5, each new value pulls m half of the way toward it. Watch the first five days, with m starting at the first value. The picture draws each day as a point and m as a line that grows one day at a time. On each step a dashed line runs from the old m, a ring, to the new day, and the new m lands partway along it.

Try it now

Then set β (beta) to 0.9 and press Use these numbers: m keeps 0.9 of itself each day, so the line barely climbs away from 12.

Where the weights went. The flow's last step unrolled the final m: day 5 weighs 0.5, day 4 0.25, day 3 0.125 and day 2 0.0625. (Day 1 gets the last 0.0625 too, because m started as day 1.) Each step back, a value's weight is multiplied by β once more, so the weights form a geometric sequence from lesson 26, with ratio β. A value k steps back weighs (1 − β)βᵏ. Do those weights add to 1? Their total is (1 − β) times this sum, which never ends:

1+β+β2+β3+⋯=11−β1 + \beta + \beta^2 + \beta^3 + \dots = \frac{1}{1 - \beta}

In plain words: call the total S. Multiplying S by β moves every term one place along, so βS is S without its first 1. That means S − βS = 1, and S = 1 ÷ (1 − β).

So the weights add to (1 − β) × 1/(1 − β) = 1. An EMA is a true weighted average: newest first, and every older value a little less.

It remembers about 1/(1 − β) values. The newest value weighs 1 − β. A window of n values gives each one 1/n. With β = 0.9 the newest weighs 0.1, like each value in a window of 10, so this EMA acts roughly like an average of the last 10 values. The picture draws its first ten weights; press Next to lay a window of 10 over them.

Quick check
An EMA with β = 0.99 remembers about how many values?
  1. 100
  2. 99
  3. 10
  4. 0.01
Show the answer

100

The newest value weighs 1 − 0.99 = 0.01, as each value does in a window of 100: 1 ÷ (1 − β) = 1 ÷ 0.01 = 100.

In your own words
In your own words: why must a weighted average's weights add to 1, and how does an EMA's weights manage it?

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

In Python: three averages as loops

Purpose. Write each average as a loop, then check the EMA's weights with one.

A weighted average is the Σ loop from lesson 26 with a weight in every term:

prices = [20, 35, 50]
weights = [0.5, 0.3, 0.2]
total = 0
for i in range(len(prices)):
    total = total + weights[i] * prices[i]
print(total, sum(weights))
print(sum(prices) / len(prices))
It runs right here in your browser, with nothing to install.

The weighted average is 30.5, and the weights add to 1.0. The plain average of the three prices, 35.0, is what an average rental would bring if every tent rented equally often.

Now the EMA on the first five days, written with a loop. Step through it and watch m and the boxes of smooth: they're the same numbers as the flow's cells.

Worked example

Worked example: a window and an EMA on the same week

Smooth the week's rentals both ways, and compare what each one shows.

rentals = [12, 18, 9, 15, 21, 12, 18]
window = []
for i in range(2, len(rentals)):
    window.append((rentals[i - 2] + rentals[i - 1] + rentals[i]) / 3)
m = rentals[0]
ema = []
for x in rentals:
    m = 0.5 * m + 0.5 * x
    ema.append(m)
print(window)
print(ema)
In the lesson you can change this and run it.

The window starts at i = 2, day 3, because its first window needs three days; rentals[i - 2] and rentals[i - 1] are the two days before day i. It climbs 13.0, 14.0, 15.0, 16.0, 17.0, a steady rise hidden under the jumps. The EMA has a value from day 1, but it still jumps: 17.25 down to 14.625 and back up to 16.3125. With β = 0.5 it remembers about 1 ÷ (1 − 0.5) = 2 values, fewer than the window's 3, so it smooths less. A bigger β smooths more.

Quick check
What does this print?
m = 12
for x in [12, 18, 9]:
    m = 0.5 * m + 0.5 * x
print(m)
  1. 13.0
  2. 9.0
  3. 15.0
  4. 12.0
Show the answer

12.0

12 blended with 12 stays 12.0. Then 18 pulls it halfway to 15.0, and 9 pulls it halfway back down: 0.5 × 15 + 0.5 × 9 = 12.0.

The weights, unrolled. The math part says a value k steps back weighs (1 − β)βᵏ, and that all the weights add to 1. A loop can check both for β = 0.9. For the first ten values it prints how far back each is, its weight and the running total of the weights; then the total of a hundred weights, and 1/(1 − β):

beta = 0.9
total = 0
for k in range(100):
    w = (1 - beta) * beta ** k
    total = total + w
    if k < 10:
        print(k, round(w, 3), round(total, 3))
print(round(total, 3), round(1 / (1 - beta), 3))

The weights run 0.1, 0.09, 0.081 and on down to 0.039, each 0.9 times the last: the bars in the math part's picture. The first ten add to only 0.651, because the rest of the weight sits on older values. A hundred of them add to 1.0, to three places. And 1/(1 − β) is 10.0, so this EMA remembers about 10 values.

A named mistake: starting at 0. It's tempting to start m at 0, and real optimizers such as Adam do. Here's what that does to the five days, with β = 0.9:

rentals = [12, 18, 9, 15, 21]
m = 0
smooth = []
for x in rentals:
    m = 0.9 * m + 0.1 * x
    smooth.append(round(m, 2))
print(smooth)
print(round(1 - 0.9 ** 5, 4), round(m / (1 - 0.9 ** 5), 2))

The running average crawls up from 1.2 and reaches only 6.28 by day 5, though no day rented fewer than 9. The starting 0 still holds most of the weight: the five days' weights add to only 1 − 0.9⁵ = 0.4095. Read the early values of an EMA started at 0 and the shop looks nearly empty. Either start at the first value, or divide by the days' share, 1 − βᵗ after t values, as Adam does: m ÷ 0.4095 gives 15.33, a fair average of the five days.

A noisy curve and two smoothings. Here is a short training loss that zigzags as it falls. The function ema is the stepper's loop, wrapped up as a function so it can smooth the loss twice, with β = 0.5 and with β = 0.9. It rounds each value to 2 places for reading:

def ema(xs, beta):
    m = xs[0]
    out = []
    for x in xs:
        m = beta * m + (1 - beta) * x
        out.append(round(m, 2))
    return out

loss = [2.9, 2.2, 2.6, 1.8, 2.3, 1.5, 2.0, 1.3, 1.7, 1.1, 1.5, 0.9]
print(ema(loss, 0.5))
print(ema(loss, 0.9))

The plot types in those two lists and draws them over the loss. label= names each line, and plt.legend() shows the names:

import matplotlib.pyplot as plt

loss = [2.9, 2.2, 2.6, 1.8, 2.3, 1.5, 2.0, 1.3, 1.7, 1.1, 1.5, 0.9]
plt.plot(loss, label="loss")
plt.plot([2.9, 2.55, 2.58, 2.19, 2.24, 1.87, 1.94, 1.62, 1.66, 1.38, 1.44, 1.17], label="β = 0.5")
plt.plot([2.9, 2.83, 2.81, 2.71, 2.67, 2.55, 2.49, 2.37, 2.31, 2.19, 2.12, 2.0], label="β = 0.9")
plt.xlabel("training step")
plt.ylabel("loss")
plt.legend()
plt.show()

The β = 0.5 line still wobbles a little. The β = 0.9 line is smooth, but look where it ends.

Quick check
Read the plot at the last training step. Which line sits highest, and why?
  1. β = 0.5: it reacts fastest to each new loss
  2. The raw loss: it's never smoothed
  3. β = 0.9: it still remembers the early, higher losses
  4. None: all three end at the same point
Show the answer

β = 0.9: it still remembers the early, higher losses

The loss falls from 2.9 to 0.9. The β = 0.9 line remembers about 10 values, so it still carries the early highs and ends at 2.0, far above the last loss. Heavy smoothing lags behind a trend. The β = 0.5 line, remembering about 2 values, keeps up better and ends at 1.17.

Drill

A weighted average and a window

Fix weighted so it returns the weighted average of xs with the weights ws, and fix the loop so window holds the window-of-3 averages of the week's rentals. There's one slip in each.

def weighted(xs, ws):
    total = 0
    for i in range(len(xs)):
        total = total + ws[i] * xs[i]
    return total / len(xs)

rentals = [12, 18, 9, 15, 21, 12, 18]
window = []
for i in range(2, len(rentals)):
    window.append((rentals[i - 1] + rentals[i]) / 3)
print(weighted([20, 35, 50], [0.5, 0.3, 0.2]), window)
In the lesson, your code is checked as you write it.
In your own words
When would you pick a window average, and when an EMA?

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

In AI and ML: smoothing, momentum and Adam

Purpose. Models average all the time, and rarely evenly. Attention, in lesson 113, mixes words with weights that add to 1. A loss curve is smoothed before anyone judges it, and the optimizer keeps moving averages of the slopes.

Smoothing a training loss. The trail club's sign reader trains on a batch of signs at a time, and its loss bounces from batch to batch: some batches are easy, some hard. Here are 20 batches. Is training still improving?

loss = [2.31, 1.98, 2.12, 1.71, 1.89, 1.52, 1.66, 1.38, 1.55, 1.22,
        1.41, 1.15, 1.29, 1.08, 0.97, 1.21, 1.02, 1.13, 0.93, 1.08]
m = loss[0]
smooth = []
for x in loss:
    m = 0.8 * m + 0.2 * x
    smooth.append(round(m, 3))
print(loss[14], loss[19])
print(smooth[14], smooth[19])

Batches 15 and 20 raw read 0.97, then 1.08, as if training got worse. The smoothed loss, with β = 0.8, says 1.303, then 1.14: still falling. One batch is mostly luck; the trend is in the average. That's why training dashboards draw a smoothed curve over the raw one. The smoothed curve also lags: at batch 20 it sits above four of the last five raw losses, because it still remembers older, higher ones.

Quick check
Why judge training by the smoothed loss, not by the last two raw losses?
  1. Raw losses are computed wrongly
  2. One batch is mostly luck; the average shows the trend
  3. The smoothed loss is always the lower one
  4. The smoothed loss reacts faster to every change
Show the answer

One batch is mostly luck; the average shows the trend

An easy or hard batch moves the raw loss up or down by luck. Averaging many batches cancels most of that, so the smoothed curve shows which way training is really going.

Momentum: an EMA of the slopes. Gradient descent, in lesson 79, steps each weight against its slope. When the slopes bounce from batch to batch, the steps zigzag. Momentum steps along an EMA of the slopes instead. A slope that stays steady keeps its size in the average, and one that flips back and forth mostly cancels out. Predict what a steady slope of 0.4 does to an average that starts at 0.5:

Quick check
What does this print?
m = 0.5
for g in [0.4, 0.4, 0.4]:
    m = 0.9 * m + 0.1 * g
print(round(m, 4))
  1. 0.5
  2. 0.4
  3. 0.4729
  4. 0.49
Show the answer

0.4729

Each step moves m a tenth of the way toward 0.4: 0.49, then 0.481, then 0.4729. With β = 0.9 the average follows a change slowly, over many steps, so one odd slope can't swing it either.

In the real tools. In PyTorch, the library most models are built with, every weight has its own slope, and the momentum line works on a whole tensor of them at once. Here, two weights:

Adam keeps two EMAs. Adam, the optimizer behind most large models, keeps an EMA of each weight's slopes and another of their squares. Its two β's sit in one setting, betas:

Drill

Judge a run by its smoothed loss

Fix smooth so it returns the EMA of xs with the given beta, starting at the first value. Then set still_falling to whether the smoothed loss at batch 20 is lower than at batch 15. The starter has three slips.

def smooth(xs, beta):
    m = 0
    out = []
    for x in xs:
        m = (1 - beta) * m + beta * x
        out.append(m)
    return out

loss = [2.31, 1.98, 2.12, 1.71, 1.89, 1.52, 1.66, 1.38, 1.55, 1.22,
        1.41, 1.15, 1.29, 1.08, 0.97, 1.21, 1.02, 1.13, 0.93, 1.08]
s = smooth(loss, 0.8)
still_falling = s[19] > s[14]
print(s[14], s[19], still_falling)
In the lesson, your code is checked as you write it.
In your own words
A colleague says a run got worse because batch 20's loss is above batch 15's. What would you check, and why?

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

Goes deeper in

  • Optimizers: momentum and Adam, built from the moving averages in this lesson.
  • Normalization layers: batch norm keeps a moving average of each feature's mean and spread to use at test time.

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

A course grade weighs homework 0.3 and the exam 0.7. Homework is 90 and the exam 60. What's the grade?

  1. 69
  2. 75
  3. 81
  4. 150

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