Index Ai Academy
Foundation · Calculus

Jacobians and Hessians

Slopes of vector functions, a layer's Jacobian, second partials, and bowls, domes and saddles.

About 42 minutes · Free lesson

What it covers6

Why it matters

So far each derivative has been a single slope, or a gradient: one slope per input, for one output. Layers in a network have many outputs too: 784 pixels in, 128 numbers out. The Jacobian collects every slope of every output with respect to every input into one matrix. And to understand the shape of a loss, flat or steep, bowl or saddle, you need the slopes of the slopes: the Hessian. These two words appear constantly in machine-learning papers. This lesson builds both by hand and by nudging, connects the Jacobian of a layer to its weight matrix, checks it on a PyTorch layer, and uses the Hessian to explain why saddle points, not bad valleys, are what slow deep networks down.

What you'll be able to do

  • Build the Jacobian of a function with vector inputs and outputs: one row per output, one column per input
  • See that the Jacobian of a layer z = Wx is W itself, check it on PyTorch's nn.Linear by nudges and by .grad, and see that an element-wise function's Jacobian is diagonal
  • Build the Hessian, the table of second partials, and use it to tell a bowl, a dome and a saddle apart
  • Read the words advanced papers use: Jacobian shapes of layers, and saddle points in training
Quick check
Have a guess before you start. A function takes 2 numbers in and gives 3 numbers out. How many slopes are there, one for each output and each input?
  1. 5
  2. 6
  3. 2
  4. 3
Show the answer

6

Each of the 3 outputs has a slope with respect to each of the 2 inputs: 3 × 2 = 6.

The math: all the slopes in a grid

Purpose. Derivatives when inputs and outputs are both vectors, and curvature in many directions.

For a function f from n inputs to m outputs, the Jacobian J is an m × n matrix: row i holds the gradient of output i, and column j says how every output responds to input j.

Jij=∂fi∂xjJ_{ij} = \frac{\partial f_i}{\partial x_j}

In plain words: one row per output, one column per input, each entry one slope.

For a linear layer z = Wx, output i is Σⱼ Wᵢⱼxⱼ, whose slope with respect to xⱼ is just Wᵢⱼ. So the Jacobian of a layer is its weight matrix: nudge input j, and the outputs move by column j of W.

Quick check
From lesson 55: what is the shape of W x when W is 3 × 2?
  1. 1 number out
  2. 2 numbers out, from 3 in
  3. 6 numbers out
  4. 3 numbers out, from 2 in
Show the answer

3 numbers out, from 2 in

W x has one entry per row of W: 3 outputs from 2 inputs. Its Jacobian is W, 3 × 2.

The picture. Step through the Jacobian of a 2 → 3 layer. The drawing is the Jacobian itself, a grid of slopes: one row per output, z₁ to z₃, and one column per input, x₁ and x₂. It starts as question marks, slopes still to measure. Each step nudges one input, and because one nudge moves every output at once, a whole column fills in, and it is a column of W. Darker cells are bigger slopes. The code lane's PyTorch tab writes the same nudge for a PyTorch layer.

Try it now

Then add a third number to each line of matrix W, 4 on the first line, 0 on the second and 2 on the third, and press Use these numbers: a third input, so the grid gains a third column.

Element-wise functions. An activation like relu acts on each entry separately: output i depends only on input i. So every slope off the diagonal is 0, and the Jacobian is diagonal. For relu at z = (2, −1, 0.5), it's diag(1, 0, 1): 1 where the unit is on, 0 where it's off. Backpropagation multiplies by such Jacobians without ever building them, which is what lesson 81's da * (z > 0) did.

The Hessian. For a function with one output and several inputs, the Hessian H is the table of second partials, the slopes of the slopes:

Hij=∂2f∂xi ∂xjf=x2+3y2  ⇒  H=(2006)H_{ij} = \frac{\partial^2 f}{\partial x_i\,\partial x_j} \qquad f = x^2 + 3y^2 \;\Rightarrow\; H = \begin{pmatrix} 2 & 0 \\ 0 & 6 \end{pmatrix}

In plain words: the curvature in each direction, plus how the slope in one direction changes as you move in another. The order doesn't matter, so H is symmetric (lesson 57).

Quick check
What is the Hessian of f = x² + xy + y²?
  1. [[1, 1], [1, 1]]
  2. [[2, 1], [0, 2]]
  3. [[2, 1], [1, 2]]
  4. [[2, 0], [0, 2]]
Show the answer

[[2, 1], [1, 2]]

∂²f/∂x² = 2, ∂²f/∂y² = 2, and the cross term ∂²f/∂x∂y = 1, in both off-diagonal places.

Bowl, dome, saddle. At a flat point, the Hessian's eigenvalues (lesson 62) say what shape the surface has:

  • all positive: a bowl, curving up in every direction: a minimum. x² + 3y² has eigenvalues 2 and 6.
  • all negative: a dome: a maximum. −x² − y² has −2 and −2.
  • mixed signs: a saddle, up in some directions and down in others, like a mountain pass. x² − y² has 2 and −2.

A saddle has zero slope but isn't a minimum: there's always a way further down.

The picture. Each frame below draws one surface from above, as level curves, like the contour lines on a hiking map. From the flat point at (0, 0), two short paths run along x and along y, each labeled with the surface's curvature in that direction: the Hessian's eigenvalues, since these Hessians are diagonal.

In your own words
In your own words: why is the Jacobian of a linear layer just its weight matrix?

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

In Python: a numerical Jacobian

Purpose. Measure every slope of a vector function by nudging one input at a time.

import numpy as np

def jacobian(f, x):
    h = 0.000001
    fx = f(x)
    J = np.zeros((len(fx), len(x)))
    for j in range(len(x)):
        up = x.copy()
        down = x.copy()
        up[j] = up[j] + h
        down[j] = down[j] - h
        J[:, j] = (f(up) - f(down)) / (2 * h)
    return J

W = np.array([[1.0, 2.0], [0.0, -1.0], [3.0, 1.0]])

def layer(x):
    return W @ x

print(np.round(jacobian(layer, np.array([0.5, 2.0])), 4).tolist())
print(np.round(jacobian(np.tanh, np.array([0.0, 1.0])), 4).tolist())
It runs right here in your browser, with nothing to install.

Each pass fills one column, J[:, j], with how all outputs moved when input j moved. The layer's Jacobian is W exactly. tanh acts entry by entry, so its Jacobian is diagonal: slope 1 at 0 and 0.42 at 1.

Code flow. Step through the same loop on the math part's layer, one line at a time, with W written out in place of f. The nudge here is h = 0.5, which keeps the boxes readable. A layer is a straight-line function, so a nudge of any size measures its slopes exactly. Watch up and down differ from x in place j only, and J gain one column per pass.

A named mistake: rows and columns swapped. It's easy to fill J[j], a row, instead of J[:, j], a column. One nudge gives one number per output, but a row of J has one place per input. When the two counts differ, NumPy stops with an error, because the outputs don't fit in a row. When they're equal, nothing stops you, and J quietly comes out as the transpose, with the right shape. So check one slope you know by hand: row i, column j must be output i's slope for input j.

Hessians numerically. A Hessian is the Jacobian of the gradient: nudge each input and see how the whole gradient changes. For functions whose second partials are simple, working them out by hand is easier, and the eigenvalues then come from np.linalg.eigvalsh, the version of lesson 62's eigh that returns only eigenvalues.

Worked example

Worked example: classify four surfaces

Write down the Hessians of the picture's three surfaces and of x² + xy + y², and classify each flat point from its eigenvalues.

import numpy as np

hessians = [("bowl", np.array([[2.0, 0.0], [0.0, 6.0]])),
            ("dome", np.array([[-2.0, 0.0], [0.0, -2.0]])),
            ("saddle", np.array([[2.0, 0.0], [0.0, -2.0]])),
            ("tilted bowl", np.array([[2.0, 1.0], [1.0, 2.0]]))]
for name, H in hessians:
    ev = np.linalg.eigvalsh(H)
    if np.all(ev > 0):
        shape = "minimum"
    elif np.all(ev < 0):
        shape = "maximum"
    else:
        shape = "saddle"
    print(name, np.round(ev, 3).tolist(), shape)
In the lesson you can change this and run it.

x² + 3y² has eigenvalues 2 and 6, both positive: a minimum. −x² − y² has −2 and −2, both negative: a maximum. x² − y² has −2 and 2: a saddle. x² + xy + y² has off-diagonal entries, so you can't read the curvatures straight off the diagonal, but its eigenvalues, 1 and 3, are both positive: a bowl turned at an angle. np.all checks that every eigenvalue passes the test.

Quick check
What does this print?
import numpy as np

W = np.array([[2.0, 0.0, 1.0], [1.0, 1.0, 0.0]])
x = np.array([1.0, 1.0, 1.0])
print((W @ x).shape, W.shape)
  1. (3,) (2, 3)
  2. (2,) (3, 2)
  3. (2, 3) (2, 3)
  4. (2,) (2, 3)
Show the answer

(2,) (2, 3)

3 inputs give 2 outputs, and the Jacobian, W, is 2 × 3: one row per output, one column per input.

Quick check
What does this print?
import numpy as np

print(np.round(np.linalg.eigvalsh(np.array([[3.0, 1.0], [1.0, 3.0]])), 3).tolist())
  1. [3.0, 3.0]
  2. [2.0, 4.0]
  3. [0.0, 6.0]
  4. [4.0, 2.0]
Show the answer

[2.0, 4.0]

Another tilted bowl, like x² + xy + y² above: its curvatures are 3 − 1 = 2 and 3 + 1 = 4, sorted smallest first. Both are positive, so a minimum.

Drill

A Jacobian, column by column

Fix jacobian so it fills columns, not rows. Then set J to the Jacobian of f(x) = (x₀x₁, x₀ + 3x₁, x₁²) at (2, 1), rounded to 4 places, as a list of lists.

import numpy as np

def jacobian(f, x):
    h = 0.000001
    fx = f(x)
    J = np.zeros((len(fx), len(x)))
    for j in range(len(x)):
        up = x.copy()
        down = x.copy()
        up[j] = up[j] + h
        down[j] = down[j] - h
        J[j] = (f(up) - f(down)) / (2 * h)
    return J

def f(x):
    return np.array([x[0] * x[1], x[0] + 3 * x[1], x[1] ** 2])

J = []
print(J)
In the lesson, your code is checked as you write it.
In your own words
For the drill's f, 2 inputs and 3 outputs, filling J[j] instead of J[:, j] stops with an error. Why does the same slip give no error for a function with 2 inputs and 2 outputs, and how would you catch it there?

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

In AI and ML: the words in the papers

Purpose. Read Jacobian shapes and saddle points the way papers use them, and check a real layer's Jacobian in PyTorch.

Backpropagation multiplies Jacobians. The chain rule for vector functions multiplies Jacobians: for x → z → a, ∂a/∂x = (∂a/∂z)(∂z/∂x). A network's backward pass multiplies a gradient by each layer's Jacobian in turn, but never writes one out as a table. A layer's Jacobian is its W, so its step back is one @ with Wᵀ. Writing out relu's would waste memory: for 4,096 units it has 4,096 × 4,096 entries, about 16.8 million, and every one off the diagonal is 0. So backprop keeps only the diagonal, one 0 or 1 per unit.

∂a∂x=diag(relu′(z))⏟activation  W⏟layer\frac{\partial \mathbf{a}}{\partial \mathbf{x}} = \underbrace{\text{diag}(\text{relu}'(\mathbf{z}))}_{\text{activation}}\; \underbrace{W}_{\text{layer}}

In plain words: a layer followed by relu has Jacobian "relu's 0s and 1s on the diagonal, times W".

A real layer's Jacobian. The trail club's sign reader ends with a layer from 4 features of a sign to 3 scores, one each for arrow, tent and trail. Nudge each feature of one sign, and watch the scores move:

import numpy as np

W = np.array([[1.5, -0.5, 0.25, 2.0], [-1.0, 0.75, 1.0, -0.5], [0.5, 1.25, -1.5, 0.25]])
b = np.array([0.5, -0.25, 0.0])
x = np.array([2.0, 0.5, 1.0, 0.0])
print((W @ x + b).tolist())

h = 0.25
J = np.zeros((3, 4))
for j in range(4):
    e = np.zeros(4)
    e[j] = h
    J[:, j] = ((W @ (x + e) + b) - (W @ (x - e) + b)) / (2 * h)
print(J.tolist())
print(np.array_equal(J, W))

The sign scores 3.5 for arrow, the highest. The Jacobian is 3 × 4, one row per score and one column per feature, and it is W, number for number. The bias drops out, since it's added to both the nudged-up and the nudged-down scores. The nudge is 0.25 here: the layer is a straight line in every direction, so any nudge measures its slopes exactly, and a quarter keeps every number exact in binary.

In PyTorch. The same layer is nn.Linear(4, 3), loaded with W and b as in lesson 50. The nudges run under torch.no_grad(), because they are measurements, not training. The nudge's size matters more here. PyTorch works in float32 by default (lesson 12), whose rounding is too coarse for the Python part's nudge of 0.000001: a nudge that small moves the scores by little more than their own rounding, and the slopes come out wrong. A quarter is still exact.

import torch
import torch.nn as nn

layer = nn.Linear(4, 3)
with torch.no_grad():
    layer.weight.copy_(torch.tensor([[1.5, -0.5, 0.25, 2.0], [-1.0, 0.75, 1.0, -0.5], [0.5, 1.25, -1.5, 0.25]]))
    layer.bias.copy_(torch.tensor([0.5, -0.25, 0.0]))
x = torch.tensor([2.0, 0.5, 1.0, 0.0])
print(layer(x).tolist())

h = 0.25
J = torch.zeros(3, 4)
with torch.no_grad():
    for j in range(4):
        e = torch.zeros(4)
        e[j] = h
        J[:, j] = (layer(x + e) - layer(x - e)) / (2 * h)
print(J.tolist())
print(torch.equal(J, layer.weight))

It prints the same scores and the same Jacobian as the NumPy cell, and torch.equal confirms that J is layer.weight, every entry. PyTorch stores a layer's weight as (outputs, inputs), 3 × 4, exactly the Jacobian's shape. Autograd (lesson 82) finds the same slopes without nudging: backward() from one score fills x.grad with that score's row of the Jacobian.

Quick check
The same layer, with x now recording its slopes. What does this print?
import torch
import torch.nn as nn

layer = nn.Linear(4, 3)
with torch.no_grad():
    layer.weight.copy_(torch.tensor([[1.5, -0.5, 0.25, 2.0], [-1.0, 0.75, 1.0, -0.5], [0.5, 1.25, -1.5, 0.25]]))
    layer.bias.copy_(torch.tensor([0.5, -0.25, 0.0]))
x = torch.tensor([2.0, 0.5, 1.0, 0.0], requires_grad=True)
layer(x)[2].backward()
print(x.grad.tolist())
  1. [0.25, 1.0, -1.5]
  2. [0.125]
  3. [1.5, -0.5, 0.25, 2.0]
  4. [0.5, 1.25, -1.5, 0.25]
Show the answer

[0.5, 1.25, -1.5, 0.25]

layer(x)[2] is the trail score. backward() from it fills x.grad with its slope for each of the 4 features: row 3 of the Jacobian, which is row 3 of W. That's how autograd builds a Jacobian when one is needed: one backward pass per output, one row each.

Saddles slow training. In very high dimensions, a flat point with a Hessian of mixed signs, a saddle, is far more common than a true minimum: with millions of directions, it's unlikely that every one curves up. Near a saddle the gradient is tiny, so training seems stuck, though there's a way down. Momentum (lesson 80) and noise from small batches help carry it through, which is part of why they work so well in practice.

Quick check
A layer maps 64 inputs to 10 outputs and is followed by relu. What is the shape of the combined Jacobian ∂a/∂x?
  1. 10 × 10
  2. 64 × 64
  3. 10 × 64
  4. 64 × 10
Show the answer

10 × 64

diag(relu′) is 10 × 10 and W is 10 × 64, so their product is 10 × 64: outputs × inputs.

Drill

Shapes through a network

A network maps 784 → 256 → 64 → 10, with relu after the first two layers. Set shapes to the list of Jacobian shapes (as tuples) of the three layers, and full to the shape of the whole network's Jacobian, from input to output.

shapes = [(784, 256), (256, 64), (64, 10)]
full = (784, 10)
print(shapes, full)
In the lesson, your code is checked as you write it.
In your own words
Why might training look stuck near a saddle even though the loss could still go down?

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 shape of the Jacobian of a function from 5 inputs to 3 outputs?

  1. 3 × 5
  2. 5 × 3
  3. 15 × 1
  4. 3 × 3

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