Index Ai Academy
Foundation · Statistics and information

Surprise, entropy and cross-entropy

Surprise in bits, entropy, cross-entropy and KL divergence, perplexity, and a language model's loss.

About 45 minutes · Free lesson

What it covers6

Why it matters

Nearly every classifier and every language model is trained on the same number: cross-entropy. Lesson 100 met it as a negative log-likelihood and lesson 102 as the log loss, without asking what it measures. This lesson gives it a meaning. An unlikely event is surprising, and surprise can be measured in bits: a coin toss carries one bit, a 1-in-8 event three. The average surprise of a source is its entropy, how unpredictable it is at best. The average surprise of the truth under a model's predictions is the cross-entropy, and it can never be less than the entropy: the gap is exactly what the model gets wrong. So a falling training loss means a model is being surprised less by real text. Perplexity, the number language models are compared by, is the same quantity read as "how many equally likely choices the model is torn between".

What you'll be able to do

  • Measure surprise as −log₂ p: rare events surprise more, and a 1-in-2 event is one bit
  • Compute entropy, the average surprise of a distribution, and cross-entropy, the average surprise of the truth under a model
  • Compute both as dot products with a log, and see that with one right answer cross-entropy is −log of its probability
  • Recognize cross-entropy as a language model's training loss, report it as perplexity, and check its value and its slope p − y with PyTorch's F.cross_entropy
Quick check
Have a guess before you start. Which surprises you more: a fair coin landing heads, or a fair die landing on 6?
  1. Heads
  2. They surprise you the same
  3. The 6: it was less likely
  4. Neither: both are possible
Show the answer

The 6: it was less likely

A 6 had chance 1/6, heads 1/2. The less likely an outcome, the more it surprises, and this lesson puts a number on that.

The math: surprise, averaged

Purpose. Measure how wrong a predicted distribution is, in one number.

Surprise. An event with chance p carries a surprise of −log₂ p, also written log₂(1/p), measured in bits. A 1-in-2 event is 1 bit, 1-in-4 is 2 bits, 1-in-8 is 3: each halving of the chance adds one bit. A certain event, p = 1, is 0 bits: no surprise. An event with p = 0.9 is 0.152 bits; one with p = 0.01 is 6.6 bits. The log makes surprises of independent events add, just as their chances multiply (lesson 89).

Entropy. The entropy of a distribution is its average surprise, each outcome's surprise weighted by its chance: H(p) = Σ pᵢ × (−log₂ pᵢ). A fair coin: ½ × 1 + ½ × 1 = 1 bit. A coin with chances 0.3 and 0.7: 0.88 bits, less, since it's more predictable. A two-headed coin: 0 bits. A fair die: log₂ 6 = 2.585 bits. Entropy is the smallest average surprise anyone can have about that source.

Quick check
From lesson 25: what is log₂ 8?
  1. 4
  2. 2.08
  3. 16
  4. 3
Show the answer

3

2³ = 8, so log₂ 8 = 3: a 1-in-8 event carries 3 bits of surprise.

Cross-entropy. Now a model predicts chances q while the truth follows p. The cross-entropy H(p, q) is the average surprise the model feels at what really happens: each outcome's surprise is measured with the model's q, but weighted by how often it truly happens, p. Step through it for a source with chances 0.5, 0.25 and 0.25 and a model that guesses 0.25, 0.25 and 0.5. The picture starts with the two side by side, each outcome's p beside its q. Then it draws each outcome's surprise as a bar, and last it weights the bars by p.

Try it now

Then set the model's chances to the truth's, 0.5, 0.25, 0.25, and press Use these numbers: the average drops to 1.5 bits, the entropy, the lowest possible.

Symbols and formula.

H(p)=−∑ipilog⁡2piH(p,q)=−∑ipilog⁡2qiKL(p ∥ q)=H(p,q)−H(p)≥0H(p) = -\sum_i p_i \log_2 p_i \qquad H(p, q) = -\sum_i p_i \log_2 q_i \qquad \text{KL}(p \,\|\, q) = H(p, q) - H(p) \ge 0

In plain words: entropy is the truth's own average surprise; cross-entropy is the average surprise when using the model's chances; the difference, KL divergence, is never negative and is 0 only when the model's chances match the truth.

So a model can push its cross-entropy down toward the entropy, never below. Training drives it as low as it can, and whatever gap remains is the model's error; lesson 106 takes that gap apart. One right answer. For a training example the "truth" is one-hot: probability 1 on the right answer, 0 elsewhere. Then every term but one vanishes, and H(p, q) = −log₂ q of the right answer, exactly lesson 100's negative log-likelihood for one observation.

Quick check
What is the entropy of a fair coin?
  1. 0 bits
  2. 2 bits
  3. 1 bit
  4. 0.5 bits
Show the answer

1 bit

Each side has chance ½ and surprise 1 bit, so the average is 1 bit: the unit itself.

In your own words
In your own words: why can a model's cross-entropy never be lower than the truth's entropy?

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

In Python: dot products with a log

Purpose. Compute entropy and cross-entropy in one line each, and check the one-hot case.

import numpy as np

p = np.array([0.5, 0.25, 0.25])
q = np.array([0.25, 0.25, 0.5])
H = p @ np.log2(1 / p)
CE = p @ np.log2(1 / q)
print(H, CE, CE - H)

y = np.array([0.0, 1.0, 0.0])
guess = np.array([0.2, 0.7, 0.1])
print(round(float(y @ np.log2(1 / guess)), 4), round(float(np.log2(1 / 0.7)), 4))
It runs right here in your browser, with nothing to install.

Each is a dot product (lesson 50): the chances p dotted with the surprises. With a one-hot y, the dot product picks out a single surprise, the right answer's, 0.5146 bits. Libraries use the natural log instead of log₂; the answer is then in nats (1 nat = 1.443 bits), and everything else stays the same.

Code flow. Step through the same lines one at a time. Watch the boxes of s: the model's surprise at each outcome, the flow's −log₂ q cells. Each total is then one dot product with a row of surprises.

A named mistake: 0 × log 0. An outcome with p = 0 should add nothing to the entropy, since it never happens. But np.log2(0) is minus infinity, and 0 × infinity is nan, so a plain formula turns the whole sum into nan. Either skip the zero chances, p[p > 0], or follow the convention that 0 × log 0 = 0. That's safe for zeros in p, the truth's chances; a zero in the model's q is another story.

Worked example

Worked example: the entropies of three distributions

Compute the entropy of a fair coin, a 0.3/0.7 coin and a fair die, skipping zero chances safely.

import numpy as np

def entropy(p):
    nz = p[p > 0]
    return float(nz @ np.log2(1 / nz))

print(entropy(np.array([0.5, 0.5])))
print(round(entropy(np.array([0.3, 0.7])), 4))
print(round(entropy(np.ones(6) / 6), 4), entropy(np.array([1.0, 0.0])))
In the lesson you can change this and run it.

The fair coin carries 1 bit, the lopsided coin 0.8813, the fair die 2.585, which is log₂ 6, and the certain coin 0. More outcomes and more even chances mean more entropy; a source that always does the same thing has none. The p[p > 0] mask drops the zero chance before taking logs, so the certain coin gives 0 instead of nan.

Quick check
What does this print?
import numpy as np

q = np.array([0.8, 0.5, 0.25, 0.9])
h = np.mean(np.log2(1 / q))
print(round(float(h), 4), round(float(2 ** h), 3))
  1. 0.8685 0.548
  2. 0.6021 1.826
  3. 3.474 11.11
  4. 0.8685 1.826
Show the answer

0.8685 1.826

Four right-answer chances give surprises 0.32, 1, 2 and 0.15 bits, averaging 0.8685; 2 to that power, the perplexity, is 1.826.

Drill

Entropy and cross-entropy

Write entropy(p) (skipping zero chances) and cross_entropy(p, q), both in bits. Then set h, ce and kl for p = (0.5, 0.25, 0.25) and q = (0.25, 0.25, 0.5).

import numpy as np

def entropy(p):
    return 0.0

def cross_entropy(p, q):
    return 0.0

p = np.array([0.5, 0.25, 0.25])
q = np.array([0.25, 0.25, 0.5])
h = entropy(p)
ce = cross_entropy(p, q)
kl = 0.0
print(h, ce, kl)
In the lesson, your code is checked as you write it.
In your own words
Why does skipping p = 0 in the entropy make sense, while a model's q = 0 for a real outcome can't be skipped?

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

In AI and ML: the loss a language model is trained on

Purpose. Read a training loss as average surprise, and see its slope.

The loss. A language model's loss on a text is its average cross-entropy per word: for each word, −log of the probability it gave the word that actually came next, averaged. The camp-log model of lesson 88, shown a new sentence, "the tent was warm", gives the three words chances 0.2, 1 and 1/3. The cell finds each word's surprise, their average and 2 to that power:

import numpy as np

right = np.array([0.2, 1.0, 1 / 3])
bits = np.log2(1 / right)
loss = bits.mean()
print(bits.round(2).tolist(), round(float(loss), 2), round(float(2 ** loss), 2))

Surprises of 2.32, 0 and 1.58 bits average 1.3 bits per word. Perplexity is 2 to that power, 2.47: on average the model is as unsure as if choosing between about two and a half equally likely words. A better model has lower perplexity on new text. With the natural log, as libraries use, perplexity is e to the loss instead; it's the same number, as PyTorch shows below.

Quick check
A language model's perplexity on a test text drops from 40 to 20 after more training. What does that mean?
  1. It now gets twice as many next words exactly right
  2. The text got easier
  3. Its loss doubled
  4. It's half as unsure: like 20 equal choices instead of 40
Show the answer

It's half as unsure: like 20 equal choices instead of 40

Perplexity reads the average surprise as an effective number of choices; halving it means a full bit less surprise per word.

The slope. Softmax (lesson 104) followed by cross-entropy has the simplest possible slope with respect to the scores: p − y, the predicted chances minus the one-hot truth, the same result as lesson 102's single neuron. For scores 2, 1 and 0.1 with "tent", the second class, correct, the chances are 0.659, 0.242 and 0.099, and the slope is (0.659, −0.758, 0.099): push the right class's score up, and the others down in proportion to how much chance they stole. That one line is where backpropagation starts in every language model.

In PyTorch. F.cross_entropy(logits, target) takes the raw scores, not the chances, and does the softmax and the −log of the right answer's chance in one call, in nats, averaged over the batch. Made with requires_grad=True, as in lesson 82, the scores get their slope from backward():

import math
import torch
import torch.nn.functional as F

right = torch.tensor([0.2, 1.0, 1 / 3])
nats = -torch.log(right).mean()
print(round(nats.item(), 4), round(torch.exp(nats).item(), 2))

logits = torch.tensor([[2.0, 1.0, 0.1]], requires_grad=True)
loss = F.cross_entropy(logits, torch.tensor([1]))
loss.backward()
hand = -math.log(math.exp(1) / (math.exp(2) + math.exp(1) + math.exp(0.1)))
print(round(loss.item(), 4), round(hand, 4))
print(logits.grad)

The camp-log sentence costs 0.9027 nats per word, and torch.exp of that is 2.47, the perplexity the NumPy cell found from bits. F.cross_entropy agrees with the hand recipe, softmax and then −ln of tent's chance: 1.417 nats both ways. And logits.grad is p − y, the slope above to 3 places: 0.659, −0.7576 and 0.0986.

Quick check
What does this print?
import numpy as np

h = np.array([1.0, 2.0, 3.0])
print((2 ** h).tolist())
  1. [0.5, 0.25, 0.125]
  2. [2.0, 4.0, 8.0]
  3. [2.0, 3.0, 4.0]
  4. [1.0, 4.0, 9.0]
Show the answer

[2.0, 4.0, 8.0]

Perplexity is 2 to the cross-entropy in bits: each extra bit doubles the number of equally likely choices.

Drill

The loss before and after an improvement

before and after hold the chances an old and an improved model gave the right next words in the same five-word test. Set ce_before and ce_after to the average cross-entropy in bits, rounded to 3, ppl_after to 2 to the improved model's cross-entropy (unrounded), rounded to 3, and grad to the slope p − y for scores (2, 1, 0.1) with class 1 correct, rounded to 3, as a list.

import numpy as np

before = np.array([0.2, 1.0, 1 / 3, 0.6, 1 / 3])
after = np.array([0.4, 0.9, 0.5, 0.6, 0.5])
ce_before = 0
ce_after = 0
ppl_after = 0
z = np.array([2.0, 1.0, 0.1])
y = np.array([0.0, 1.0, 0.0])
grad = []
print(ce_before, ce_after, ppl_after, grad)
In the lesson, your code is checked as you write it.
In your own words
The slope p − y pushes down every wrong class's score in proportion to its chance. Why is that a sensible way to learn?

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

Goes deeper in

Practice what you just read

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

Try a quiz question

What does entropy measure?

  1. Its average surprise: how unpredictable it is
  2. The largest probability
  3. How many different outcomes there are
  4. The error of a model

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