Index Ai Academy
Foundation · Calculus

Partial derivatives

One input at a time, ∂, nudging in Python, and the two slopes of a line's loss.

About 41 minutes · Free lesson

What it covers6

Why it matters

Every function so far had one input. Real models have many: a line has a slope and an intercept, a network has millions of weights, and the loss depends on all of them at once. So "how does the loss change?" needs a sharper question: how does it change when I nudge this one weight and leave every other one alone? The answer is a partial derivative, written with a curly ∂. It's the ordinary derivative of lessons 72 to 74, applied to one input at a time. By the end of the lesson you'll take partials by hand and by nudging in Python, compute the two slopes that train a straight-line model, and watch PyTorch find the same two with one call.

What you'll be able to do

  • Picture a function of two inputs as a table, a contour map and a surface
  • Take a partial derivative: change one input, hold the others still, written ∂f/∂x
  • Estimate partials in Python by nudging one input at a time, and check them against the hand rule
  • Find ∂L/∂w and ∂L/∂b for a line's loss, one slope per weight, and get both from one PyTorch backward()
Quick check
Have a guess before you start. A tent's price depends on its size and its weight. To see how size alone affects price, what do you compare?
  1. Any two tents
  2. Tents of different sizes but the same weight
  3. Tents of different weights but the same size
  4. Tents of the same size and weight
Show the answer

Tents of different sizes but the same weight

Vary the one thing you're asking about and hold the others fixed. That's a partial derivative's recipe.

The math: one input at a time

Purpose. Change when there are several inputs.

A function of two inputs, like f(x, y) = x² + 3y², gives one number for each pair (x, y). You can picture it as a table (rows for x, columns for y), as a contour map (lines joining points of equal height, like a hiking map), or as a surface over a floor.

To ask how f changes with x, hold y still and differentiate as usual, treating y as a constant:

∂f∂x=2x∂f∂y=6y\frac{\partial f}{\partial x} = 2x \qquad \frac{\partial f}{\partial y} = 6y

In plain words: ∂f/∂x ("partial f, partial x") is the slope in the x direction with y frozen; ∂f/∂y is the slope in the y direction with x frozen.

Quick check
From lesson 73: what is the derivative of 3y² with respect to y?
  1. 6y
  2. 6y²
  3. 3y
  4. 2y
Show the answer

6y

Power rule with a constant multiple: 3 × 2y = 6y. The partial ∂f/∂y uses exactly this rule.

At the point (1, 2): ∂f/∂x = 2 × 1 = 2 and ∂f/∂y = 6 × 2 = 12, so the surface is six times steeper in the y direction there. The flow measures both by nudging each input a tiny bit each way while holding the other still.

The picture. The drawing is the bowl seen from above, as a contour map. Each oval joins the points where f has the same value, like the contour lines on a hiking map, and the ovals crowd together where the bowl gets steep. Step through and watch the point's own oval light up, then the dashed line each nudge moves along, then one arrow per slope. The arrows are drawn shorter than their true size but in proportion, so the arrow along y is six times as long as the arrow along x. The code's PyTorch tab finds both slopes with a single call, f.backward().

Try it now

Then set x to 0 and press Use these numbers: the x-slope is 0 there, since the bowl's lowest line runs along x = 0, and the picture has no arrow along x.

Symbols and formula. Holding y still makes it a constant, so every rule from lesson 73 applies unchanged:

∂f∂x=lim⁡h→0f(x+h,y)−f(x,y)h\frac{\partial f}{\partial x} = \lim_{h \to 0} \frac{f(x + h, y) - f(x, y)}{h}

In plain words: the same shrinking secant as lesson 72, moving only in x.

Some practice with the trick of freezing: for f = x²y + y, ∂f/∂x = 2xy (y is just a number in front) and ∂f/∂y = x² + 1 (x² is just a number in front of y). For f = xy, ∂f/∂x = y and ∂f/∂y = x. A term with no x in it, like 5y, has ∂/∂x = 0: with y frozen, it's a constant.

Quick check
For f(x, y) = x²y + y, what is ∂f/∂x at (2, 3)?
  1. 4
  2. 15
  3. 5
  4. 12
Show the answer

12

∂f/∂x = 2xy (the + y is constant in x), and 2 × 2 × 3 = 12.

In your own words
In your own words: why can you use the ordinary derivative rules for a partial derivative?

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

In Python: nudge one input at a time

Purpose. Measure each partial, and check it against the hand rule.

def f(x, y):
    return x ** 2 + 3 * y ** 2

def partial_x(f, x, y):
    h = 0.000001
    return (f(x + h, y) - f(x - h, y)) / (2 * h)

def partial_y(f, x, y):
    h = 0.000001
    return (f(x, y + h) - f(x, y - h)) / (2 * h)

print(round(partial_x(f, 1, 2), 4), 2 * 1)
print(round(partial_y(f, 1, 2), 4), 6 * 2)
It runs right here in your browser, with nothing to install.

Each function nudges just one input, both ways, and divides by 2h: lesson 73's central difference, one direction at a time. The measured slopes match the hand rules, 2 and 12.

Code flow. Here are the same two nudges written out a line at a time, at (1, 2). The nudge h is 0.5 this time, so every value stays short enough to read. For a bowl built from squares like this one, the two-way nudge happens to give the exact slope for any h; the tiny h in the cell above is what works for every function. Step through and watch up and down: first only x moves, then only y.

A named mistake: moving both inputs. Nudging x and y together, f(x + h, y + h), measures the slope along a diagonal, a mix of both partials, not either one. For x² + 3y² at (1, 2) it gives 14, the sum of the two partials, which matches neither. Each partial must move its own input only.

Cost. With n inputs, nudging needs two function calls per input: 2n calls for all the partials. For a handful of inputs that's nothing; for a network with millions of weights it's hopeless, which is why lesson 81's backpropagation matters.

Worked example

Worked example: both partials of three functions

Measure both partials of three functions at a point, and compare with the hand rules.

h = 0.000001

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

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

def mix(x, y):
    return x ** 2 * y + y

def prod(x, y):
    return x * y

def saddle(x, y):
    return x ** 2 - y ** 2

print(round(px(mix, 2, 3), 4), round(py(mix, 2, 3), 4), 2 * 2 * 3, 2 ** 2 + 1)
print(round(px(prod, 3, 4), 4), round(py(prod, 3, 4), 4))
print(round(px(saddle, 1, 1), 4), round(py(saddle, 1, 1), 4))
In the lesson you can change this and run it.

For x²y + y at (2, 3) the measured partials are 12 and 5, matching 2xy and x² + 1. For xy at (3, 4) each partial is the other input: 4 and 3. The saddle x² − y² at (1, 1) has partials 2 and −2: rising in x, falling in y, which is what makes it a saddle, a shape lesson 83 returns to.

Quick check
What does this print?
def f(x, y):
    return 4 * x + x * y

h = 0.000001
print(round((f(2 + h, 5) - f(2 - h, 5)) / (2 * h), 4), round((f(2, 5 + h) - f(2, 5 - h)) / (2 * h), 4))
  1. 9.0 2.0
  2. 4.0 2.0
  3. 2.0 9.0
  4. 9.0 5.0
Show the answer

9.0 2.0

∂f/∂x = 4 + y = 9 at y = 5. ∂f/∂y = x = 2.

Reading a contour map. On a contour map, lines join points of equal height, like a hiker's map. Where the lines crowd together the surface is steep; where they spread out it's gentle. A partial derivative reads the map along one axis: ∂f/∂x is how fast you cross contour lines walking due east, ∂f/∂y walking due north. For x² + 3y² the lines are squeezed in the y direction, as the ovals in the math part's picture are, which is why ∂f/∂y is the bigger of the two.

Drill

Nudge one input only

Fix partial_y so it nudges only y. Then set grad to the pair (∂f/∂x, ∂f/∂y) for f = x² + xy at (3, 1), each rounded to 4 places.

h = 0.000001

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

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

def f(x, y):
    return x ** 2 + x * y

grad = (0, 0)
print(grad)
In the lesson, your code is checked as you write it.
In your own words
Why does nudging x and y together give neither partial?

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

In AI and ML: one slope per weight

Purpose. A model has many weights, and each gets its own slope.

A line ŷ = w·x + b has two weights, so its mean squared error on some data is a function of both: L(w, b). Each partial says how L changes when that one weight moves:

∂L∂w=2n∑i(y^i−yi) xi∂L∂b=2n∑i(y^i−yi)\frac{\partial L}{\partial w} = \frac{2}{n}\sum_i (\hat{y}_i - y_i)\,x_i \qquad \frac{\partial L}{\partial b} = \frac{2}{n}\sum_i (\hat{y}_i - y_i)

In plain words: both use the errors ŷ − y; the w-slope weights each error by its input, the b-slope doesn't.

import numpy as np

x = np.array([1, 2, 3, 4])
y = np.array([3, 5, 6, 9])

def loss(w, b):
    return np.mean((w * x + b - y) ** 2)

h = 0.000001
w, b = 1, 0
print(loss(w, b))
print(round((loss(w + h, b) - loss(w - h, b)) / (2 * h), 4), round((loss(w, b + h) - loss(w, b - h)) / (2 * h), 4))
e = w * x + b - y
print(2 / 4 * np.sum(e * x), 2 / 4 * np.sum(e))

Both partials are negative, −18.5 and −6.5: raising either weight lowers the loss. The nudged slopes and the formulas agree.

Quick check
At some (w, b), ∂L/∂w = 3 and ∂L/∂b = −1. How should each weight move to lower the loss?
  1. Raise both
  2. Lower both
  3. Raise w, lower b
  4. Lower w, raise b
Show the answer

Lower w, raise b

Move each weight against its own slope: w's is positive, so lower it; b's is negative, so raise it.

Why the errors appear in both. By the chain rule (lesson 74), each squared error (ŷ − y)² has slope 2(ŷ − y) with respect to ŷ, and ŷ = wx + b changes by x per unit of w and by 1 per unit of b. Averaging over the examples gives the two formulas. A network works the same way, just with millions of partials, one per weight, each built from the errors flowing back through the chain.

In PyTorch. PyTorch runs that chain for you. Make w and b with requires_grad=True and PyTorch records every step that uses them. loss.backward() then runs the chain rule back through those steps and leaves each weight's partial derivative in its .grad:

import torch

x = torch.tensor([1.0, 2.0, 3.0, 4.0])
y = torch.tensor([3.0, 5.0, 6.0, 9.0])
w = torch.tensor(1.0, requires_grad=True)
b = torch.tensor(0.0, requires_grad=True)
loss = ((w * x + b - y) ** 2).mean()
loss.backward()
print(loss.item())
print(w.grad, b.grad)

The same loss, 11.75, and the same two slopes the NumPy cell found by nudging and by formula, −18.5 and −6.5, printed PyTorch's way with four decimals. One call filled both.

Quick check
Nudging took two loss evaluations per weight. How many backward() calls did PyTorch need for both slopes?
  1. Four, two per weight
  2. Two, one per weight
  3. Four, one per data point
  4. One for both weights
Show the answer

One for both weights

A single loss.backward() fills the .grad of every tensor made with requires_grad=True, however many weights there are. That's why training a network with millions of weights is possible at all: there's no extra call per weight.

Two slopes, one step. Training uses both partials together: each weight moves against its own slope in the same step. At w = 1, b = 0 both slopes are negative, so both weights rise; later, when the line fits well, both slopes shrink toward 0 and the weights settle.

Quick check
At w = 2, b = 1, the line nearly fits. What does this print?
import numpy as np

x = np.array([1, 2, 3, 4])
y = np.array([3, 5, 6, 9])
e = 2 * x + 1 - y
print(2 / 4 * np.sum(e * x), 2 / 4 * np.sum(e))
  1. 1.5 0.5
  2. 0.5 1.5
  3. 3.0 1.0
  4. -1.5 -0.5
Show the answer

1.5 0.5

The errors are 0, 0, 1 and 0. ∂L/∂w = (2/4)(1 × 3) = 1.5 and ∂L/∂b = (2/4)(1) = 0.5: lower both a little.

Drill

The two slopes of a line's loss

For the data below at w = 2, b = 1, set e to the errors ŷ − y as a list, and dw and db to the two partials from the formulas.

import numpy as np

x = np.array([1, 2, 3])
y = np.array([4, 4, 8])
w, b = 2, 1
e = []
dw = 0
db = 0
print(e, dw, db)
In the lesson, your code is checked as you write it.
In your own words
Why does ∂L/∂w weight each error by its input x, while ∂L/∂b doesn't?

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 does ∂f/∂x measure?

  1. How f changes with x, others held still
  2. How f changes as all inputs change together
  3. The value of f at x
  4. How x changes as f changes

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