Index Ai Academy
Foundation · Vectors and matrices

Length and distance: norms

L2, L1 and max norms, unit vectors, distance, and the norms inside losses and clipping.

About 42 minutes · Free lesson

What it covers6

Why it matters

How big is a list of numbers? There's more than one fair answer. The straight-line length of its arrow is one, the L2 norm. The distance you'd walk along a grid of streets is another, the L1 norm. And sometimes only the biggest number matters, the max norm. Machine learning uses all three: to measure errors, to keep weights small, and to stop a training step from growing too large. This lesson puts them side by side, computes each with a loop and then with one NumPy call, turns any vector into a unit vector of length 1, and shows where each norm turns up inside the losses and safety limits of real training code.

What you'll be able to do

  • Measure a vector's size three ways: the L2 norm, the L1 norm and the max norm
  • Make a unit vector by normalizing, and find a distance as the norm of a difference
  • Compute norms with a loop and with np.linalg.norm, and check that a unit vector has length 1
  • See the norms inside ML: mean absolute and squared error, weight decay, and gradient clipping, in NumPy and in PyTorch
Quick check
Have a guess before you start. To get from (0, 0) to (3, 4), how far do you walk on a grid of streets, and how far does a bird fly?
  1. Both 5
  2. Walk 5, fly 7
  3. Both 7
  4. Walk 7, fly 5
Show the answer

Walk 7, fly 5

On streets you go 3 across and 4 up: 7 blocks. The bird flies straight: √(3² + 4²) = 5. Two honest ways to measure one movement.

The math: how big is a vector?

Purpose. One number for the size of a whole list of numbers.

A norm measures a vector's size. Three are common:

  • The L2 norm, ‖v‖₂: the arrow's straight-line length, Pythagoras in any number of dimensions. Square each component, add, take the root. For (3, −4), that's 5.
  • The L1 norm, ‖v‖₁: add the sizes of the components, ignoring signs. For (3, −4), that's 7: the street-grid walk.
  • The max norm, ‖v‖∞: the biggest size of any one component. For (3, −4), that's 4.

When people say "the norm" or "the length" with no label, they mean L2.

Quick check
From an earlier lesson: what is |−6|?
  1. −6
  2. 0
  3. 36
  4. 6
Show the answer

6

The absolute value is the distance from zero, so |−6| = 6. The L1 norm adds these sizes.

The picture. Watch the L2 norm of (3, −4): square each component, add the squares, then take the square root. The picture draws the arrow with its two legs, 3 across and 4 down, and builds a real square on each leg: 3² is a 3 by 3 square of 9 small squares. Add the two areas, take the root, and you have the arrow's length.

Try it now

Then set which norm to 1 and press Use these numbers: the picture walks the legs like streets, 3 + 4 = 7. Set it to max for the biggest size. A vector of three components, like 1, 2, 2, works too (length 3), but has no flat picture.

Symbols and formula. The three norms, and a unit vector:

∥v∥2=∑vi2∥v∥1=∑∣vi∣v^=v∥v∥\lVert v \rVert_2 = \sqrt{\textstyle\sum v_i^2} \qquad \lVert v \rVert_1 = \textstyle\sum |v_i| \qquad \hat{v} = \frac{v}{\lVert v \rVert}

In plain words: L2 is the root of the sum of squares; L1 is the sum of sizes. Dividing a vector by its length makes a unit vector, v̂ ("v hat"), with length exactly 1 and the same direction.

Distance is a norm. The distance between points a and b is the length of the arrow between them: ‖b − a‖₂. That's lesson 41's distance formula, now in one symbol. Making a unit vector is called normalizing: (3, −4) normalized is (0.6, −0.8).

Which norm when? All three give 0 for the zero vector, and doubling v doubles each of them. They differ in what they count. L2 is the length you'd measure with a ruler, and it punishes one big component more than several small ones. L1 counts every component's size equally, as a walk along a grid would. The max norm cares only about the worst component, which suits limits like "no weight may exceed 5". For (3, −4) they give 5, 7 and 4: the L1 norm is never smaller than the other two, and the max norm never bigger.

Three shapes of size 1. Why does L1 always come out biggest? Draw every arrow of size 1 under each norm: a circle for L2, a diamond for L1, a square for max. Press Next to see each one with v = (0.6, 0.8), then all three.

Quick check
What is the L2 norm of (1, 2, 2)?
  1. √5
  2. 5
  3. 3
  4. 9
Show the answer

3

1 + 4 + 4 = 9, and √9 = 3.

Quick check
What is (6, 8) normalized?
  1. (6, 8)
  2. (0.6, 0.8)
  3. (0.75, 1)
  4. (3, 4)
Show the answer

(0.6, 0.8)

Its length is √(36 + 64) = 10. Dividing each component by 10 gives (0.6, 0.8), length 1.

In your own words
In your own words: what does each of the three norms measure about a vector?

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

In Python: loops, then np.linalg.norm

Purpose. Write each norm once by hand to see it, then use NumPy's one call.

import math

def l1(v):
    total = 0
    for x in v:
        total = total + abs(x)
    return total

def l2(v):
    total = 0
    for x in v:
        total = total + x ** 2
    return math.sqrt(total)

print(l1([3, -4]), l2([3, -4]), l2([1, 2, 2]))
It runs right here in your browser, with nothing to install.

Code flow. Here are both loops folded into one, on (3, −4), with NumPy's answer at the end. Step through it and watch the two running totals: walk adds each size, and total adds each square, 9 then 16, the same squares the flow in the math part wrote in its boxes.

NumPy has all three in np.linalg.norm, chosen with ord. With no ord it's L2:

import numpy as np

v = np.array([3, -4])
print(np.linalg.norm(v), np.linalg.norm(v, ord=1), np.linalg.norm(v, ord=np.inf))

np.inf is infinity, NumPy's name for the max norm.

Normalizing, and checking it. Divide by the norm, then confirm the result has length 1:

import numpy as np

v = np.array([3, -4])
u = v / np.linalg.norm(v)
print(u.tolist(), np.linalg.norm(u))

A named mistake: normalizing the zero vector. (0, 0) has length 0, and dividing by 0 gives nan ("not a number") with a warning. The zero vector has no direction to keep, so code that normalizes should check for a zero length first.

Worked example

Worked example: three distances between the same two points

Measure the gap from (1, 2) to (4, 6) with each norm of the difference.

import numpy as np

a = np.array([1, 2])
b = np.array([4, 6])
d = b - a
print(d.tolist())
print(np.linalg.norm(d), np.linalg.norm(d, ord=1), np.linalg.norm(d, ord=np.inf))
In the lesson you can change this and run it.

The difference is (3, 4). Its L2 norm, 5.0, is the straight-line distance. Its L1 norm, 7.0, is the street walk. Its max norm, 4.0, is the biggest single gap, across or up. Each is a fair answer to "how far apart?", and which one a model uses changes what it treats as close.

Quick check
What does this print?
import numpy as np

v = np.array([2, -2, 1])
print(np.linalg.norm(v), np.linalg.norm(v, ord=1))
  1. 9.0 5.0
  2. 5.0 3.0
  3. 3.0 5.0
  4. 3.0 1.0
Show the answer

3.0 5.0

L2: √(4 + 4 + 1) = 3.0. L1: 2 + 2 + 1 = 5.0.

Quick check
Which line makes v a unit vector?
  1. v - np.linalg.norm(v)
  2. v * np.linalg.norm(v)
  3. v / v.max()
  4. v / np.linalg.norm(v)
Show the answer

v / np.linalg.norm(v)

Dividing by the length scales it to length 1, keeping its direction.

Drill

Two norms and a unit vector

Fix l1 and l2, then set u to (6, −8) normalized, as a list.

import math
import numpy as np

def l1(v):
    total = 0
    for x in v:
        total = total + x
    return total

def l2(v):
    total = 0
    for x in v:
        total = total + x ** 2
    return total

u = (np.array([6, -8]) / 8).tolist()
print(l1([3, -4]), l2([3, -4]), u)
In the lesson, your code is checked as you write it.
In your own words
Why can't the zero vector be normalized?

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

In AI and ML: errors, penalties and limits

Purpose. Norms appear wherever a model needs one number for the size of many.

Errors. For predictions ŷ and answers y, the error vector is ŷ − y. Its L1 norm, divided by n, is the mean absolute error; its L2 norm squared, divided by n, is the mean squared error from lesson 26:

MAE=1n∥y^−y∥1MSE=1n∥y^−y∥22\text{MAE} = \tfrac{1}{n}\lVert \hat{y} - y \rVert_1 \qquad \text{MSE} = \tfrac{1}{n}\lVert \hat{y} - y \rVert_2^2

In plain words: MAE averages the sizes of the misses; MSE averages their squares, so it punishes big misses more.

import numpy as np

pred = np.array([3.0, 5.0, 9.0])
y = np.array([2.0, 5.0, 7.0])
err = pred - y
print(np.abs(err).mean(), (err ** 2).mean())
Quick check
What does this print?
import numpy as np

w = np.array([0.5, -1.0, 2.0])
print(np.sum(w ** 2))
  1. 5.25
  2. 1.5
  3. 2.29
  4. 3.5
Show the answer

5.25

0.25 + 1 + 4 = 5.25: the L2 norm squared, the size weight decay penalizes.

Weight decay adds a small multiple of ‖w‖₂² to the loss, so training prefers small weights, which tend to generalize better. Gradient clipping caps a step: if ‖g‖ is bigger than a limit, g is scaled down to exactly that length, keeping its direction. For a limit of 1, that's just normalizing:

import numpy as np

g = np.array([3.0, 4.0])
n = np.linalg.norm(g)
if n > 1:
    g = g / n
print(n, g.tolist(), np.linalg.norm(g))

A gradient of length 5 becomes (0.6, 0.8), length 1: same direction, a safe size.

In PyTorch. The norm, clipping and weight decay are all built in. torch.linalg.norm(g) is the L2 norm. nn.utils.clip_grad_norm_ clips: it takes the weights whose gradients to clip and the limit, max_norm, and shrinks their gradients in place (the name ends in _). Weight decay is an option on the optimizer, weight_decay=. As in lesson 48, w.grad holds each gradient, put there by hand:

import torch
import torch.nn as nn

g = torch.tensor([3.0, 4.0])
print(torch.linalg.norm(g))

w = torch.tensor([1.0, 1.0], requires_grad=True)
w.grad = torch.tensor([3.0, 4.0])
nn.utils.clip_grad_norm_([w], max_norm=1.0)
print(w.grad)

w = torch.tensor([0.5, -1.0, 2.0], requires_grad=True)
w.grad = torch.zeros(3)
opt = torch.optim.SGD([w], lr=0.1, weight_decay=0.1)
opt.step()
print(w)

The first two lines match the NumPy cell: the gradient's length, 5, then the clipped gradient (0.6, 0.8), in PyTorch's four decimals. Clipping looks only at the gradient, so the weights' own values don't matter there. The last line is weight decay on its own. The gradient is all zeros (torch.zeros(3) makes three), yet the step still moves every weight toward 0: weight_decay=0.1 adds 0.1 × w to the gradient, which is how the ‖w‖₂² penalty in the loss reaches each weight. With lr=0.1, each weight loses 0.1 × 0.1 = 0.01 of itself, so (0.5, −1, 2) becomes (0.495, −0.99, 1.98).

Quick check
What does this print? The limit is 5 this time.
import torch
import torch.nn as nn

w = torch.tensor([0.0, 0.0], requires_grad=True)
w.grad = torch.tensor([6.0, 8.0])
nn.utils.clip_grad_norm_([w], max_norm=5.0)
print(w.grad)
  1. tensor([3.0000, 4.0000])
  2. tensor([0.6000, 0.8000])
  3. tensor([5., 5.])
  4. tensor([6., 8.])
Show the answer

tensor([3.0000, 4.0000])

(6, 8) has length 10, over the limit of 5, so it's scaled by 5 ÷ 10 = 0.5 to (3, 4): length 5, same direction.

Why squares in the loss, and absolute values elsewhere? Squaring errors (MSE) makes big mistakes count far more than small ones, which pushes a model hard to fix its worst predictions. Absolute errors (MAE) treat every unit of error the same, so one wild example can't dominate. Neither is "right": the choice says which mistakes matter most for the job at hand. A model that predicts house prices might use MAE so that one mansion doesn't dominate, while one that must never be far wrong, like a dose calculator, might use MSE so that big misses are punished hardest.

Drill

Clip a gradient, measure two errors

Fix the code: clip(g) should scale g down to length 1 when its length is above 1, and leave a shorter g as it is. Then make mae and mse the mean absolute and mean squared errors.

import numpy as np

def clip(g):
    n = np.linalg.norm(g)
    if n < 1:
        g = g / 10
    return g

pred = np.array([1.0, 4.0, 4.0])
y = np.array([2.0, 4.0, 1.0])
err = pred - y
mae = err.mean()
mse = (err * 2).mean()
print(clip(np.array([6.0, 8.0])).tolist(), mae, mse)
In the lesson, your code is checked as you write it.
In your own words
Why might a model be trained with MSE instead of MAE, or the other way around?

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

Goes deeper in

Practice what you just read

  • 7 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 are the L1 and L2 norms of (−6, 8)?

  1. L1 14, L2 10
  2. L1 10, L2 14
  3. L1 2, L2 10
  4. L1 14, L2 100

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