Index Ai Academy
Foundation · Calculus

The product rule and the chain rule

Products and chains of functions, forward then backward, and one neuron's dL/dw.

About 45 minutes · Free lesson

What it covers6

Why it matters

The rules of lesson 73 handle sums of powers. Real formulas are built differently: one function inside another, like (3x + 1)², or two multiplied together. A neural network is the extreme case, a long chain of small steps, each feeding the next. The chain rule says how to get the slope of the whole chain from the slopes of its links: multiply them. That one sentence is backpropagation, the algorithm that trains every neural network, and by the end of this lesson you'll use it to find how a neuron's loss changes with its weight, one link at a time.

What you'll be able to do

  • Differentiate a product with the product rule: (fg)′ = f′g + fg′
  • Differentiate a chain of functions by multiplying the local slopes: dy/dx = dy/du × du/dx
  • Compute a chain forward, then its slope backward as a product, and check it numerically
  • Find dL/dw for one neuron, x → z → a → L, as a product of three local slopes, and read every link's slope from PyTorch
Quick check
Have a guess before you start. A gear turns 3 times for each turn of the handle, and a wheel turns 2 times for each turn of the gear. How many times does the wheel turn for each turn of the handle?
  1. 5
  2. 3
  3. 1.5
  4. 6
Show the answer

6

Rates through a chain multiply: 3 × 2 = 6. That's the chain rule.

The math: products and chains

Purpose. Slopes of functions built from other functions.

The product rule. When two functions are multiplied, each takes a turn changing while the other holds:

(f g)′=f′ g+f g′(f\,g)' = f'\,g + f\,g'

In plain words: the slope of the first times the second, plus the first times the slope of the second.

For x²·(3x + 1) at x = 2: 2x·(3x + 1) + x²·3 = 4 × 7 + 4 × 3 = 40. A named mistake is multiplying the two slopes, 2x × 3 = 12, which is wrong.

Quick check
From lesson 20: if f(x) = 3x + 1 and g(u) = u², what is g(f(2))?
  1. 49
  2. 13
  3. 7
  4. 14
Show the answer

49

f(2) = 7, then g(7) = 49. The chain rule finds the slope of exactly this kind of machine-inside-a-machine.

The chain rule. For y = (3x + 1)², name the inside u = 3x + 1, so y = u². Each link has a slope: dy/du = 2u and du/dx = 3. The slope of the whole chain is their product:

dydx=dydu×dudx\frac{dy}{dx} = \frac{dy}{du} \times \frac{du}{dx}

In plain words: how fast y changes with x = how fast y changes with u, times how fast u changes with x.

At x = 1: u = 4, so dy/dx = 2 × 4 × 3 = 24. The named mistake here is dropping the inner factor, giving 2u = 8: that forgets that u itself changes 3 times as fast as x.

A neuron is a chain: x and w make z = w·x + b, then a = relu(z), then the loss L = (a − y)². The flow runs it forward, then sends slopes backward, multiplying at each link.

The picture. Each circle is a value, and each arrow carries it to the step that uses it. Forward, each value is written in its circle. Backward, each slope is written under its circle (∂), and the arrow it came back along keeps its local slope (×). Follow the arrows from L back to w: the slope that reaches w is the local slopes along the way, multiplied. The code's PyTorch tab does the whole backward pass with one call, L.backward().

Try it now

The slope column fills from the bottom up, and the picture writes each slope under its circle: each one is the slope after it times a local slope. Had w been −1, z would be negative, relu's slope 0, and every slope behind it 0.

Symbols and formula. For a chain of three, the slopes of all three links multiply:

y=f(g(h(x)))⇒dydx=f′(g(h(x)))⋅g′(h(x))⋅h′(x)y = f(g(h(x))) \quad\Rightarrow\quad \frac{dy}{dx} = f'(g(h(x))) \cdot g'(h(x)) \cdot h'(x)

In plain words: each link's slope is taken at the value flowing into it, and they all multiply.

For y = 3(2x + 1)² + 5: u = 2x + 1, v = u², y = 3v + 5. At x = 1, u = 3, so dy/dx = 3 × 2u × 2 = 3 × 6 × 2 = 36. Each local slope is easy; the chain rule just strings them together.

Quick check
y = e^(2x). What is dy/dx at x = 0?
  1. 1
  2. e²
  3. 2
  4. 0
Show the answer

2

Outer: eᵘ has slope eᵘ = e⁰ = 1. Inner: 2x has slope 2. Product: 2.

In your own words
In your own words: why do the slopes of a chain multiply rather than add?

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

In Python: forward, then backward

Purpose. Compute a chain's value step by step, then its slope as a product, and check it.

x = 1
u = 3 * x + 1
y = u ** 2
dy_du = 2 * u
du_dx = 3
print(y, dy_du * du_dx)

def f(x):
    return (3 * x + 1) ** 2

h = 0.000001
print(round((f(x + h) - f(x - h)) / (2 * h), 4))
It runs right here in your browser, with nothing to install.

The forward pass computes and keeps each intermediate value, u and y. The backward pass uses them for the local slopes, 2u and 3, and multiplies. The central difference from lesson 73 agrees: 24.

Code flow. The same two passes on a longer chain, the math part's y = 3(2x + 1)² + 5 at x = 1. Forward, each value is appended to a list as it's made: x, then u, then v = u², then y. Backward, local holds the three link slopes from the output back to x, dy/dv = 3, dv/du = 2u and du/dx = 2, and the loop multiplies them into slope, which starts at 1. Step through and watch slope grow one link at a time.

Why keep the forward values? Each local slope is taken at the value flowing into its link: 2u needs u. So the forward pass stores them, and the backward pass reads them. That's exactly what deep-learning libraries do, and why training needs extra memory: every layer's values are kept until its slopes have been computed.

A named mistake: the slope at the wrong point. Writing dy/du = 2x instead of 2u takes the outer slope at the input x rather than at the inner value u. The numerical check catches it at once.

Worked example

Worked example: three chains, checked

For three chains, compute the slope at a point as a product of local slopes, and compare with a central difference.

import math

h = 0.000001

def cd(f, x):
    return (f(x + h) - f(x - h)) / (2 * h)

def f1(x):
    return (x ** 2 + 1) ** 3

def f2(x):
    return math.exp(x ** 2)

def f3(x):
    return 3 * (2 * x + 1) ** 2 + 5

x = 1
print(3 * (x ** 2 + 1) ** 2 * (2 * x), round(cd(f1, x), 4))
print(round(math.exp(x ** 2) * 2 * x, 4), round(cd(f2, x), 4))
print(3 * 2 * (2 * x + 1) * 2, round(cd(f3, x), 4))
In the lesson you can change this and run it.

Each line puts the chain rule's product next to the measured slope. (x² + 1)³ gives 3u² × 2x = 12 × 2 = 24. e^(x²) gives e^(x²) × 2x = 2e ≈ 5.4366. 3(2x + 1)² + 5 gives 36, as worked above. Agreement on all three is good evidence each chain was split into links correctly.

Quick check
What does this print?
x = 2
u = x ** 2
y = 5 * u
print(y, 5 * (2 * x))
  1. 4 20
  2. 20 10
  3. 20 20
  4. 20 5
Show the answer

20 20

Forward: u = 4, y = 20. Backward: dy/du = 5 and du/dx = 2x = 4, so dy/dx = 20.

Drill

A chain's slope, two ways

For y = (2x − 3)⁴, fix chain(x) so it returns dy/dx as a product of local slopes. Then set agree to whether it matches the central difference at x = 2 to 4 places.

def f(x):
    return (2 * x - 3) ** 4

def chain(x):
    u = 2 * x - 3
    return 4 * u ** 3

h = 0.000001
agree = False
print(chain(2), agree)
In the lesson, your code is checked as you write it.
In your own words
Why does the backward pass need the values from the forward pass?

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

In AI and ML: backpropagation in one line

Purpose. The slope of a neuron's loss with respect to its weight.

One neuron with a relu and a squared error is a chain of three links, and the chain rule gives the slope of the loss with respect to w:

z=w x+b  →  a=relu(z)  →  L=(a−y)2∂L∂w=2(a−y)⏟∂L/∂a⋅relu′(z)⏟∂a/∂z⋅x⏟∂z/∂wz = w\,x + b \;\to\; a = \text{relu}(z) \;\to\; L = (a - y)^2 \qquad \frac{\partial L}{\partial w} = \underbrace{2(a - y)}_{\partial L/\partial a}\cdot \underbrace{\text{relu}'(z)}_{\partial a/\partial z} \cdot \underbrace{x}_{\partial z/\partial w}

In plain words: twice the error, times 1 if the neuron was on (0 if it was off), times the input.

w, x, b, y = 2, 1.5, 0.5, 2.5
z = w * x + b
a = max(0, z)
L = (a - y) ** 2
dL_da = 2 * (a - y)
if z > 0:
    da_dz = 1
else:
    da_dz = 0
dz_dw = x
print(z, a, L, dL_da * da_dz * dz_dw)

The neuron outputs 3.5 when 2.5 was wanted, so ∂L/∂w = 2 × 1 × 1.5 = 3: lower w. ∂ ("partial") is used because L depends on several inputs; lesson 77 explains it.

In PyTorch. You met requires_grad, backward() and .grad in lesson 72. Here is the same neuron. PyTorch notes each link as the forward lines run, and L.backward() multiplies the local slopes back from L. It keeps a slope only for the tensors made with requires_grad=True, here w and b. The middle values z and a drop theirs once they've been passed on, to save memory, so .retain_grad() asks PyTorch to keep them:

import torch

w = torch.tensor(2.0, requires_grad=True)
b = torch.tensor(0.5, requires_grad=True)
x, y = 1.5, 2.5
z = w * x + b
a = torch.relu(z)
L = (a - y) ** 2
z.retain_grad()
a.retain_grad()
L.backward()
print(z.item(), a.item(), L.item(), w.grad.item())
print(a.grad.item(), z.grad.item(), b.grad.item())

The first line matches the plain Python cell above: z = 3.5, a = 3.5, L = 1.0 and ∂L/∂w = 3. The second reads the chain link by link. ∂L/∂a = 2(a − y) = 2. The neuron is on, so relu passes that 2 to z unchanged. b's own link has slope 1, so ∂L/∂b is 2 too, while w's link multiplies by x = 1.5 to give 3. Lesson 82 opens up how PyTorch keeps that record.

Quick check
A neuron's z is −1.5, so relu outputs 0. What is ∂L/∂w?
  1. 0: relu's slope is 0 when it's off
  2. The error times the input x
  3. 1
  4. It can't be computed
Show the answer

0: relu's slope is 0 when it's off

∂a/∂z is 0 for negative z, and one zero factor makes the whole product 0: the weight gets no signal.

Dead neurons. That zero is a real effect. A neuron whose z stays negative for every example gets ∂L/∂w = 0 every time, so its weights never change: it's "dead". Variants like leaky relu (lesson 71) keep a small slope for negative z so that some signal always gets through. Seeing the chain as a product of slopes makes problems like this, and their fixes, easy to understand.

Longer chains, same rule. A deep network is the same chain with more links: input, layer, activation, layer, activation, and so on, to the loss. The slope of the loss with respect to a weight deep inside is the product of every link's slope between that weight and the loss. That product is why very deep networks can have trouble: many slopes below 1 multiply to almost nothing, so early layers learn slowly. This is the vanishing-gradient problem, and relu, whose slope is exactly 1 when on, was adopted partly to ease it in deep networks.

Quick check
A neuron's z comes out negative. What does this print?
w, x, b, y = -1.0, 2.0, 0.5, 1.0
z = w * x + b
a = max(0, z)
relu_slope = 0
if z > 0:
    relu_slope = 1
print(z, a, relu_slope)
  1. 1.5 1.5 1
  2. -1.5 0 0
  3. -1.5 -1.5 1
  4. -1.5 0 1
Show the answer

-1.5 0 0

z = −2 + 0.5 = −1.5, so relu outputs 0 and its slope is 0: every slope behind it is 0 too.

Drill

All three local slopes

For the neuron below, set dL_da, da_dz and dz_dw to its three local slopes, and dL_dw to their product. Then set dL_db: ∂z/∂b is 1, so it's the same chain with the last factor 1.

w, x, b, y = 0.5, 4, -1, 2
z = w * x + b
a = max(0, z)
dL_da = 0
da_dz = 0
dz_dw = 0
dL_dw = 0
dL_db = 0
print(z, a, dL_dw, dL_db)
In the lesson, your code is checked as you write it.
In your own words
Why is ∂L/∂b the same as ∂L/∂w except for the last factor?

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

Goes deeper in

Practice what you just read

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

Try a quiz question

What is the chain rule?

  1. dy/dx = dy/du × du/dx: the local slopes multiply
  2. dy/dx = dy/du + du/dx
  3. The slope of a product is the product of the slopes
  4. dy/dx = dy/du ÷ du/dx

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