Index Ai Academy
Foundation · Statistics and information

Samples, the law of large numbers and the central limit theorem

Samples and populations, the standard error σ/√n, the bell of averages, and error bars on test scores.

About 43 minutes · Free lesson

What it covers6

Why it matters

Every number a model is judged by comes from a sample. A test set is a few thousand questions out of all the questions the model will ever meet; a training step's gradient is computed on a batch of 32 examples out of millions. So every measured accuracy and every gradient wobbles: a different sample would have given a slightly different number. This lesson answers how much. Three facts carry the whole idea. A sample's average lands near the population's mean, and nearer as the sample grows: the law of large numbers. The size of its wobble is σ/√n, so four times the data halves it. And the averages of many samples pile up in a bell shape even when the population is lopsided: the central limit theorem. Together they say when a difference between two models is real, and why bigger batches give steadier training.

What you'll be able to do

  • Tell a population from a sample, and see a sample's average wobble around the population's mean
  • Use the standard error σ/√n: the wobble shrinks with the square root of the sample size
  • Simulate many samples, measure their wobble, and draw their averages turning bell-shaped, whatever the population looks like
  • Read a test score and a mini-batch gradient as samples, put a 95% range on an accuracy two ways, and measure a batch gradient's wobble in NumPy and PyTorch
Quick check
Have a guess before you start. One poll asks 100 people, another 10,000. Repeated many times, whose result wobbles more from poll to poll?
  1. The poll of 100
  2. Neither wobbles
  3. The poll of 10,000
  4. They wobble the same
Show the answer

The poll of 100

A small sample can land far from the truth by chance; a big one averages that chance away. Here the wobble is ten times smaller for 10,000.

The math: what a part says about the whole

Purpose. Know how far a sample's average can be from the truth, before you see the truth.

Population and sample. The population is everything you care about: every wait at a trailhead shuttle, say. A sample is the part you actually measure: the 16 waits you timed last week. The population has a true mean μ and standard deviation σ that you usually never see; the sample has its own average x̄, which you can compute.

Take a lopsided population: a shuttle wait is 2 minutes 80% of the time and 10 minutes 20% of the time. Its mean is μ = 2 × 0.8 + 10 × 0.2 = 3.6 minutes, and its standard deviation σ = 3.2 (lesson 92's formula). One wait is never 3.6: it's 2 or 10. But average 16 waits and you'll usually land close to 3.6, and average 64 and closer still. That's the law of large numbers.

Quick check
From lesson 93: an accuracy of 0.9 measured on 100 questions has standard deviation √(p(1 − p)/n). What is it?
  1. 0.3
  2. 0.0009
  3. 0.03
  4. 0.09
Show the answer

0.03

√(0.9 × 0.1 ÷ 100) = √0.0009 = 0.03. That was a standard error already: the wobble of an average of 100 yes-or-no answers.

How big is the wobble? The average of n independent draws has standard deviation σ/√n, called the standard error. The √n is the key: the wobble shrinks, but slowly.

The picture. Step through it for the shuttle, as boxes of numbers and as a drawing. The drawing shows where the averages of n waits land: each bar is the share of all possible samples whose average falls there, worked out exactly, with μ as a dashed line and an error bar one standard error either side of it. Watch the bars crowd in toward μ as n grows.

Try it now

Then set the sample sizes to 100, 400 and press Use these numbers: going from 100 to 400 waits buys the same halving as 1 to 4, and the bars squeeze into a spike.

Symbols and formula.

SE(xˉ)=σnxˉ±1.96⋅sn covers μ about 95% of the time\text{SE}(\bar{x}) = \frac{\sigma}{\sqrt{n}} \qquad \bar{x} \pm 1.96 \cdot \frac{s}{\sqrt{n}} \text{ covers } \mu \text{ about 95\% of the time}

In plain words: the average of n values wobbles by σ/√n; about 95% of samples land within 1.96 standard errors of the true mean.

The bell appears. Look back at the picture's bars. With n = 1 they're just the population: two spikes, at 2 and 10. With n = 4 there are five possible averages, still lopsided. By n = 64 the averages form a smooth, nearly symmetric bell centered on 3.6, with spread 0.4. That's the central limit theorem: averages of many independent draws are close to normal, whatever the population's shape. It's why the 68–95–99.7 rule from lesson 93 works for averages, and why 1.96 appears in the range above.

Quick check
σ = 12. What is the standard error of the average of 36 values?
  1. 2
  2. 6
  3. 12
  4. 0.33
Show the answer

2

12 ÷ √36 = 12 ÷ 6 = 2.

In your own words
In your own words: why does the average of a sample wobble less than a single value does?

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

In Python: draw many samples, measure the wobble

Purpose. Check σ/√n by simulation: the formula is proved, and trying it shows what it means.

import numpy as np

rng = np.random.default_rng(0)
waits = np.array([2.0, 10.0])
chances = np.array([0.8, 0.2])
for n in [1, 4, 16, 64]:
    means = rng.choice(waits, size=(2000, n), p=chances).mean(axis=1)
    print(n, round(float(means.std()), 2), round(3.2 / n ** 0.5, 2))
It runs right here in your browser, with nothing to install.

size=(2000, n) draws 2,000 samples at once, one per row, and .mean(axis=1) averages each row: 2,000 sample averages. Their spread matches σ/√n to within a few hundredths each time: 3.24 against 3.2, then 1.61, 0.78 and 0.4 against 1.6, 0.8 and 0.4.

Code flow. Here is the same experiment at a size you can watch: five samples of 4 waits, one at a time. Step through it and watch sample change on every pass, and means collect one average per sample.

A named mistake: forgetting the √. It's tempting to think 100 times the data gives 100 times the precision. It gives 10 times: the standard error divides by √100 = 10. Plans built on the wrong rule run out of budget: cutting a wobble of 2 points to 0.2 points needs 100 times the data, not 10.

Worked example

Worked example: the bell from a lopsided population

Average 64 shuttle waits, 5,000 times, and check where the averages fall.

import numpy as np

rng = np.random.default_rng(2)
means = rng.choice(np.array([2.0, 10.0]), size=(5000, 64), p=np.array([0.8, 0.2])).mean(axis=1)
print(round(float(means.mean()), 2), round(float(means.std()), 2))
print(round(float(np.mean(np.abs(means - 3.6) <= 1.96 * 0.4)), 3))
In the lesson you can change this and run it.

The averages center on the true 3.6 with spread close to 3.2 ÷ 8 = 0.4. The last line counts the share of the 5,000 averages within 1.96 standard errors of 3.6: about 96%, close to the 95% a normal distribution would give, though every single wait was either 2 or 10. That's the central limit theorem doing its work, and it's what lets a 95% range be built from a formula without knowing the population's shape.

Quick check
What does this print?
import numpy as np

n = np.array([1, 4, 16, 64])
print((3.2 / np.sqrt(n)).tolist())
  1. [3.2, 0.8, 0.2, 0.05]
  2. [0.4, 0.8, 1.6, 3.2]
  3. [3.2, 1.6, 0.8, 0.4]
  4. [3.2, 1.6, 1.07, 0.8]
Show the answer

[3.2, 1.6, 0.8, 0.4]

√n is 1, 2, 4 and 8, so the standard error halves at every step: four times the data, half the wobble.

Draw it. A histogram of 2,000 averages for n = 4 and for n = 64, on one plot. plt.hist sorts values into bins and draws a bar for each, and label= names each one for the legend.

import numpy as np
import matplotlib.pyplot as plt
rng = np.random.default_rng(0)
for n in [4, 64]:
    means = rng.choice([2.0, 10.0], size=(2000, n), p=[0.8, 0.2]).mean(axis=1)
    plt.hist(means, bins=np.arange(1.75, 10.5, 0.25), label=f"n = {n}")
plt.xlabel("average wait (minutes)")
plt.ylabel("samples")
plt.legend()
plt.show()
Quick check
Read the plot. How do the two histograms differ?
  1. They look the same, just shifted apart
  2. The n = 4 histogram is the narrower one
  3. The n = 64 histogram centers further right
  4. Both center near 3.6, and n = 64 is far narrower
Show the answer

Both center near 3.6, and n = 64 is far narrower

A bigger sample doesn't move where the averages center, μ = 3.6; it squeezes them closer to it. The n = 4 averages can only be 2, 4, 6, 8 or 10, so they stand in separate spikes; the n = 64 averages make one narrow bell.

Drill

Measure the wobble

With seed 4, for each n in 1, 4, 16 and 64, draw 2,000 samples of n shuttle waits, average each, and append the standard deviation of the 2,000 averages (rounded to 2 places) to wobble. Append σ/√n, rounded to 2, to theory.

import numpy as np

rng = np.random.default_rng(4)
waits = np.array([2.0, 10.0])
chances = np.array([0.8, 0.2])
wobble = []
theory = []
for n in [1, 4, 16, 64]:
    means = rng.choice(waits, size=(2000, n), p=chances).mean(axis=1)
print(wobble, theory)
In the lesson, your code is checked as you write it.
In your own words
The simulation matched σ/√n closely at every n. What would you expect if the 2,000 repeats were cut to 20?

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

In AI and ML: test scores and mini-batches are samples

Purpose. Know how much a measured accuracy and a batch's gradient can wobble.

A test score is a sample. A model that is right on 85 of 100 test questions has a measured accuracy of 0.85, but a different 100 questions could have given 0.82 or 0.88. Treat each question as a yes-or-no draw: the standard error is √(0.85 × 0.15 ÷ 100) = 0.036, and a 95% range is 0.85 ± 1.96 × 0.036, from 0.78 to 0.92. On 10,000 questions the same accuracy is pinned to 0.843 to 0.857. Two models scoring 0.85 and 0.83 on 100 questions can't be told apart; on 10,000 they can.

Quick check
What does this print?
import numpy as np

se = (0.85 * 0.15 / np.array([100, 10000])) ** 0.5
print((1.96 * se).round(3).tolist())
  1. [0.036, 0.0036]
  2. [0.07, 0.007]
  3. [0.7, 0.07]
  4. [0.07, 0.0007]
Show the answer

[0.07, 0.007]

The 95% half-widths: 1.96 × 0.0357 ≈ 0.07 for 100 questions, and ten times smaller for 10,000, since √100 = 10.

A second way: resample. Without any formula, draw 100 answers from the model's own 100 answers, with replacement, and score them; repeat 2,000 times. The middle 95% of those scores, from the 2.5th to the 97.5th percentile, is again 0.78 to 0.92. This bootstrap works for scores that have no simple formula, like a median latency or an F1 score.

A mini-batch is a sample. A training step averages the gradient over a batch of B examples instead of all of them, so the step direction wobbles by about σ/√B around the full gradient. A batch of 128 wobbles a quarter as much as a batch of 8, since √(128 ÷ 8) = 4: steadier steps, at sixteen times the cost per step.

Measure it. Here are 4,096 tent-shop days, made up with a seeded random generator: rentals rise with temperature, plus noise. A one-weight model ŷ = w × temperature starts at w = 1, and its loss is the mean squared error, so the gradient on any set of days is the mean of 2(wx − y)x. The cell finds it on all the days, then on every batch of 8 and every batch of 64 in turn, and measures how much the batch gradients spread.

import numpy as np

rng = np.random.default_rng(3)
t = rng.uniform(10, 35, size=4096)                # temperatures
y = 1.8 * t + 3 + rng.normal(0, 4, size=4096)     # rentals
w = 1.0

def grad(tb, yb):
    return float(np.mean(2 * (w * tb - yb) * tb))

print(round(grad(t, y), 1))
for B in [8, 64]:
    gs = []
    for k in range(0, 4096, B):
        gs.append(grad(t[k:k + B], y[k:k + B]))
    print(B, len(gs), round(float(np.mean(gs)), 1), round(float(np.std(gs)), 1))

On all 4,096 days the gradient is −1023.7. The 512 batches of 8 average exactly that, but one batch can land far from it: their spread is 216.3. The 64 batches of 64 average the same −1023.7 with a spread of 76.6, about 2.8 times smaller, as √(64 ÷ 8) = √8 ≈ 2.83 predicts.

Quick check
Why is a mini-batch gradient noisy?
  1. It averages a random sample, not every example
  2. Batches contain mistakes
  3. The model itself changes between the examples
  4. Gradients are always rounded
Show the answer

It averages a random sample, not every example

Each batch is a sample, so its average gradient wobbles around the full-data gradient by about σ/√B.

In PyTorch. Training code doesn't slice batches by hand. A TensorDataset holds the days as pairs, a DataLoader serves them a batch at a time, and loss.backward() finds each batch's gradient, which lands in w.grad. Setting w.grad = None clears it before the next batch, as optimizer.zero_grad() does in a training loop. The days are the same as in the NumPy cell, from the same seeded generator, and float64 keeps every digit NumPy keeps.

import numpy as np
import torch
from torch.utils.data import DataLoader, TensorDataset

rng = np.random.default_rng(3)
t = rng.uniform(10, 35, size=4096)
y = 1.8 * t + 3 + rng.normal(0, 4, size=4096)
days = TensorDataset(torch.tensor(t), torch.tensor(y))
w = torch.tensor(1.0, dtype=torch.float64, requires_grad=True)
for B in [8, 64]:
    gs = []
    for tb, yb in DataLoader(days, batch_size=B):
        loss = ((w * tb - yb) ** 2).mean()
        loss.backward()
        gs.append(w.grad.item())
        w.grad = None
    print(B, len(gs), round(float(np.mean(gs)), 1), round(float(np.std(gs)), 1))

The same numbers as NumPy: batches of 8 spread 216.3 around −1023.7, batches of 64 only 76.6. batch_size is the n of this lesson. Raising it steadies each step by √n, and costs n examples of work per step.

Drill

An accuracy's range, two ways

A model got 85 of 100 test questions right (1 = right, 0 = wrong). Set formula to the 95% range p ± 1.96·√(p(1 − p)/n), each end rounded to 3 places, and boot to the 2.5th and 97.5th percentiles of 2,000 bootstrap accuracies (seed 1; resample 100 answers with rng.choice), each rounded to 2.

import numpy as np

answers = np.zeros(100)
answers[:85] = 1
p = answers.mean()
n = len(answers)
formula = (0, 0)
rng = np.random.default_rng(1)
boot = (0, 0)
print(formula, boot)
In the lesson, your code is checked as you write it.
In your own words
A colleague says model B beats model A because it scored 0.86 against 0.84 on a 200-question test. What would you say?

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

Goes deeper in

Practice what you just read

  • 5 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 does the central limit theorem say?

  1. Averages of many draws are nearly normal, whatever the population
  2. Every population is normal
  3. Bigger samples have bigger averages
  4. A sample's average always equals the population's true mean

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