Index Ai Academy
Foundation · Calculus

The gradient

All the slopes as a vector, steepest climb and descent, a numerical gradient, and the loss gradient.

About 42 minutes · Free lesson

What it covers6

Why it matters

Lesson 77 gave one slope per input. Put them side by side and they make a vector, the gradient, and that vector has a meaning of its own: it points in the direction the function climbs fastest, and its length says how steep that climb is. Turn it around and it points straight downhill. That's the direction gradient descent (lesson 79) moves a model's weights, every step of every training run. This lesson builds the gradient from partials, measures it numerically for any number of inputs, and computes it for a line's loss, where it turns out to be a dot product you met in lesson 50. Then PyTorch's loss.backward() finds the same gradient for you.

What you'll be able to do

  • Collect all the partial derivatives into one vector, the gradient ∇f
  • Read the gradient as the direction of steepest climb, its length as the steepness, and its opposite as steepest descent
  • Write numerical_gradient(f, point) for any number of inputs, and check it against the hand formula
  • Compute the gradient of a line's mean squared error, with ∂L/∂w as a dot product of errors and inputs, and get the same gradient from PyTorch's loss.backward()
Quick check
Have a guess before you start. On a hillside, the ground rises 2 m per step east and 6 m per step north. Which way is the climb steepest?
  1. Mostly north, a little east
  2. Due east, along the gentler slope
  3. Due south, downhill
  4. Due north, the steeper slope
Show the answer

Mostly north, a little east

The steepest direction leans toward the steeper slope, north, while still taking some of the east slope: the arrow (2, 6).

The math: all the slopes as one arrow

Purpose. All the slopes at once, as a direction.

The gradient of f is the vector of its partial derivatives, written ∇f ("del f" or "grad f"):

∇f=(∂f∂x,∂f∂y)\nabla f = \left( \frac{\partial f}{\partial x}, \frac{\partial f}{\partial y} \right)

In plain words: one slope per input, stacked into an arrow.

For f = x² + 3y² at (1, 2), the partials are 2 and 12, so ∇f = (2, 12). Three facts make it useful:

  • it points in the direction where f rises fastest;
  • its length is that fastest rate: √(2² + 12²) ≈ 12.17;
  • its opposite, −∇f = (−2, −12), points where f falls fastest.
Quick check
From lesson 49: what is the length of the vector (6, 8)?
  1. 10
  2. 48
  3. 100
  4. 14
Show the answer

10

√(36 + 64) = √100 = 10. A gradient of (6, 8) means the fastest climb rises 10 per unit step.

The flow measures both partials of x² + 3y² at (1, 2), which together are the gradient.

The picture. The drawing is the contour map from lesson 77: ovals where f has one value, around the bottom of the bowl. This time the arrow for ∂f/∂y starts at the tip of the arrow for ∂f/∂x, so the two add up, tip to tail, into one arrow: the gradient. Watch where it points at the last step: mostly north, a little east, like the hillside in the opening question, and straight across the oval through the point, at a right angle to it. The arrows are drawn shorter than their true size, in proportion. The code's PyTorch tab gets the whole gradient from one f.backward().

Try it now

Then set x and y to 0 and press Use these numbers: at the bottom of the bowl the gradient is (0, 0), with no arrow and no direction uphill at all.

Symbols and formula. With any number of inputs, the gradient has one entry per input:

∇f(x)=(∂f∂x1,…,∂f∂xn)Δf≈∇f⋅Δx\nabla f(\mathbf{x}) = \left( \frac{\partial f}{\partial x_1}, \ldots, \frac{\partial f}{\partial x_n} \right) \qquad \Delta f \approx \nabla f \cdot \Delta\mathbf{x}

In plain words: a small move Δx changes f by about the gradient dotted with the move (lesson 50's dot product).

That second formula is lesson 72's Δy ≈ f′·Δx in many dimensions. It also shows why the gradient is the steepest direction: the dot product of ∇f with a move of fixed length is biggest when the move points along ∇f (lesson 51). At the bottom of a bowl every partial is 0, so ∇f = 0: no direction is uphill.

The gradient is perpendicular to the contour lines. Walking along a contour line keeps f the same, so the gradient dotted with that direction is 0: the gradient meets every contour line at a right angle, pointing straight across them toward higher ground, as the flow's last picture shows. On a map, that's the line a stream would take, downhill, against the gradient.

Many inputs, same picture. With three inputs the contour lines become contour surfaces, and with a million inputs nothing can be drawn at all. But every fact above still holds: the gradient still has one entry per input, still points uphill most steeply, and its opposite still points downhill. That's why the same few lines of gradient descent can train a model of any size.

Quick check
∇f = (3, −4) at a point. Moving by (0.1, 0.1), about how much does f change?
  1. 0.5
  2. −0.7
  3. 0.7
  4. −0.1
Show the answer

−0.1

Δf ≈ ∇f · Δx = 3 × 0.1 + (−4) × 0.1 = 0.3 − 0.4 = −0.1.

In your own words
In your own words: why does the gradient point in the direction of steepest climb?

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

In Python: a numerical gradient

Purpose. Measure the gradient of any function of any number of inputs.

Store the point as a NumPy array, and nudge one coordinate at a time:

import numpy as np

def numerical_gradient(f, point):
    h = 0.000001
    g = np.zeros(len(point))
    for i in range(len(point)):
        up = point.copy()
        down = point.copy()
        up[i] = up[i] + h
        down[i] = down[i] - h
        g[i] = (f(up) - f(down)) / (2 * h)
    return g

def f(p):
    return p[0] ** 2 + 3 * p[1] ** 2

print(np.round(numerical_gradient(f, np.array([1.0, 2.0])), 4).tolist())
It runs right here in your browser, with nothing to install.

point.copy() makes separate copies to nudge, so the original point is never changed. The answer, [2, 12], matches (2x, 6y).

Code flow. Step through the same loop at (1, 2). As in lesson 77, h is 0.5 here to keep the values short, and for this bowl the two-way nudge is exact at any h. Watch up and down as rows of boxes: each pass starts from a fresh copy of point and moves one entry only, and g fills in one entry per pass.

A named mistake: nudging the original. Writing up = point doesn't copy the array; both names point at the same numbers. Nudging up then nudges point too, so the point drifts as the loop runs, and later partials are measured from the wrong place. Write down = point as well and it gets worse: up and down are then one array, the two nudges cancel, and every entry of the gradient comes out 0. .copy() prevents both.

Any number of inputs. The same function works for three inputs, or three thousand: the loop runs once per coordinate, two evaluations each. That's fine for checking, and far too slow for training big models, which is why lesson 81 computes gradients a different way.

Worked example

Worked example: gradients of two functions at three points

Measure the gradient of two functions at three points each, and compare with the hand formulas.

import numpy as np

def numerical_gradient(f, point):
    h = 0.000001
    g = np.zeros(len(point))
    for i in range(len(point)):
        up = point.copy()
        down = point.copy()
        up[i] = up[i] + h
        down[i] = down[i] - h
        g[i] = (f(up) - f(down)) / (2 * h)
    return g

def bowl(p):
    return p[0] ** 2 + p[1] ** 2

def three(p):
    return p[0] * p[1] + p[2] ** 2

for pt in [[3.0, 4.0], [0.0, 1.0], [-1.0, 2.0]]:
    print(pt, np.round(numerical_gradient(bowl, np.array(pt)), 4).tolist())
print(np.round(numerical_gradient(three, np.array([1.0, 2.0, 3.0])), 4).tolist())
In the lesson you can change this and run it.

For x² + y² the gradient is (2x, 2y): (6, 8), (0, 2) and (−2, 4) at the three points, each pointing straight away from the bottom at the origin. For xy + z² it's (y, x, 2z) = (2, 1, 6): three inputs, three entries, from the same function.

Quick check
What does this print?
import numpy as np

def f(p):
    return 2 * p[0] + p[1] ** 2

h = 0.000001
p = np.array([1.0, 3.0])
g0 = (f(p + np.array([h, 0])) - f(p - np.array([h, 0]))) / (2 * h)
g1 = (f(p + np.array([0, h])) - f(p - np.array([0, h]))) / (2 * h)
print(round(g0, 4), round(g1, 4))
  1. 1.0 6.0
  2. 2.0 3.0
  3. 6.0 2.0
  4. 2.0 6.0
Show the answer

2.0 6.0

∂f/∂x = 2 and ∂f/∂y = 2y = 6 at y = 3. Adding (h, 0) nudges only the first input.

Checking a hand-worked gradient. Whenever you work out a gradient by hand, compare it with numerical_gradient at a point or two. The two are computed in completely different ways, so agreement is strong evidence both are right. Real libraries test their own gradient code exactly like this, on small random inputs, before trusting it on a model with millions of weights.

Drill

A numerical gradient that copies

Fix numerical_gradient so it nudges copies of the point, not the point itself. Then set g to the gradient of x² + xy + y² at (1, 2), rounded to 4 places, as a list.

import numpy as np

def numerical_gradient(f, point):
    h = 0.000001
    g = np.zeros(len(point))
    for i in range(len(point)):
        up = point
        down = point
        up[i] = up[i] + h
        down[i] = down[i] - h
        g[i] = (f(up) - f(down)) / (2 * h)
    return g

def f(p):
    return p[0] ** 2 + p[0] * p[1] + p[1] ** 2

g = []
print(g)
In the lesson, your code is checked as you write it.
In your own words
In the drill's starter, up = point and down = point. Why does that make every entry of the gradient 0?

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

In AI and ML: the gradient of a line's loss

Purpose. The direction to move both weights at once.

For a line ŷ = w·x + b with mean squared error L, lesson 77's two partials make the gradient. The w-entry is a sum of errors times inputs, which is a dot product:

∇L=(2n e⋅x,  2n∑iei),e=y^−y\nabla L = \left( \frac{2}{n}\, \mathbf{e} \cdot \mathbf{x},\; \frac{2}{n} \sum_i e_i \right), \qquad \mathbf{e} = \hat{\mathbf{y}} - \mathbf{y}

In plain words: the error vector dotted with the inputs, and the errors summed, each times 2/n.

Watch it computed point by point on four days of tent data, starting from w = 0, b = 0. The picture draws each error as the gap between a day's point and the line, which starts flat along the bottom, ŷ = 0.

The same gradient in code. The flow's lines, with @ for the dot product, on the same four days:

import numpy as np

x = np.array([1, 2, 3, 4])
y = np.array([3, 5, 6, 9])
w, b = 0, 0
e = w * x + b - y
grad = np.array([2 / 4 * (e @ x), 2 / 4 * np.sum(e)])
print(e.tolist(), grad.tolist())
print(round(float(np.linalg.norm(grad)), 2))

A line stuck at 0 predicts too low on every day, so every error is negative, and so are both entries of the gradient: raise w and b. The second line is the gradient's length (lesson 49).

In PyTorch. Now the same loss in PyTorch, with loss.backward() finding the gradient:

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(0.0, requires_grad=True)
b = torch.tensor(0.0, requires_grad=True)
loss = ((w * x + b - y) ** 2).mean()
loss.backward()
print(w.grad, b.grad)

The two .grad entries are the formula's gradient, −33.5 and −11.5, the same numbers the NumPy cell printed. PyTorch never saw the formula. It ran the chain rule back through the loss, which works the same way for a line's two weights or a network's millions.

Quick check
The NumPy cell printed the gradient's length, 35.42. What does that number tell you?
  1. How many steps training will take to finish
  2. How fast the loss climbs, at its steepest
  3. How far w and b are from the best fit
  4. The size of the loss at w = 0, b = 0
Show the answer

How fast the loss climbs, at its steepest

A gradient's length is the steepest rate of change: moving (w, b) a small distance along the gradient raises the loss about 35.42 times that distance. Against the gradient, it falls just as fast.

Quick check
The gradient of a loss is (0, 0) at some (w, b). What does that mean?
  1. A flat spot: the bottom of a convex loss
  2. The loss is 0
  3. The weights are 0
  4. Training should take a bigger step
Show the answer

A flat spot: the bottom of a convex loss

A zero gradient means every partial is 0, the condition for a minimum; for the line's convex loss, it's the best fit.

Why the gradient shrinks as the line improves. Both entries are built from the errors. As training pulls the line closer to the points, the errors shrink, and so does the gradient: at w = 2, b = 0.5 it's only (−1, −0.5), a fraction of the starting (−33.5, −11.5). That's what makes training slow down near the end, and what lets it stop: a gradient of zero means no errors left to fix, or at least none a straight line can fix.

Quick check
At w = 2, b = 0, 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 + 0 - y
print(2 / 4 * (e @ x), 2 / 4 * np.sum(e))
  1. 3.5 1.5
  2. -7.0 -3.0
  3. -3.5 -1.5
  4. -1.5 -3.5
Show the answer

-3.5 -1.5

The errors are −1, −1, 0 and −1. e·x = −1 − 2 + 0 − 4 = −7, times 2/4 is −3.5; Σe = −3, times 2/4 is −1.5.

Drill

The loss gradient, as a dot product

For the tent data at w = 2, b = 0.5, set e to the error vector, grad to the gradient [∂L/∂w, ∂L/∂b] (using @ for the dot product), and better to whether one step of 0.05 against the gradient lowers the loss.

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)

w, b = 2, 0.5
e = np.zeros(4)
grad = [0, 0]
better = False
print(e, np.round(grad, 4).tolist(), better)
In the lesson, your code is checked as you write it.
In your own words
Why is ∂L/∂w a dot product of the errors with the inputs?

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

Goes deeper in

  • Gradients: gradients for functions of many inputs.

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 the gradient of f at a point tell you?

  1. The direction f rises fastest, and how fast
  2. The value of f at that point
  3. Where f is lowest on the whole map
  4. The area under f

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