Index Ai Academy
Foundation · Statistics and information

Scoring a classifier: confusion table, precision, recall, F1

The four cells, accuracy, precision, recall and F1, and what moving a threshold does to each.

About 35 minutes · Free lesson

What it covers6

Why it matters

A classifier that is right 95 times out of 100 sounds good, until you learn that only 5 of the 100 cases were yeses and it said no to every one of them. Accuracy hides which mistakes a model makes. So professional evaluation counts the mistakes by kind, in a small table called the confusion table, and reads a few numbers from it: precision, recall and F1. This lesson builds the table from the arrow detector of lesson 102, works each number by hand and in code, and moves the threshold to watch them trade against each other.

What you'll be able to do

  • Fill a confusion table from a classifier's calls: true positives, false negatives, false positives, true negatives
  • Compute accuracy, precision, recall and F1 from the table, and say which one matters when a miss costs more than a false alarm
  • Count the four cells in Python with a loop, then with array comparisons, and in PyTorch with (pred == 1) & (y == 1)
  • Move a threshold and predict which scores rise and which fall, and read a three-class table row by row
Quick check
Have a guess before you start. 100 trail signs, 5 of them arrows. A detector says "not an arrow" for every sign. How accurate is it?
  1. 0%, because it finds no arrows
  2. 95%, though it never finds an arrow
  3. 50%, a coin toss
  4. 5%, the share of arrows
Show the answer

95%, though it never finds an arrow

It's right about all 95 boards and wrong about the 5 arrows: 95 of 100. A high accuracy, from a detector that is useless for the one thing it's for.

The math: four cells and four scores

Purpose. Count a classifier's right and wrong answers by kind, and read four scores from the count.

The four cells. Each time a yes-or-no classifier meets an example, one of four things happens. Call the yes class "1" (an arrow) and the no class "0" (anything else).

  • It says 1 and the answer is 1: a true positive, TP. A hit.
  • It says 0 and the answer is 1: a false negative, FN. A miss.
  • It says 1 and the answer is 0: a false positive, FP. A false alarm.
  • It says 0 and the answer is 0: a true negative, TN.

"True" or "false" says whether the call was right; "positive" or "negative" says what was called. Count each kind and lay the counts out in a 2 × 2 table, rows for what really is and columns for what the model said. That's the confusion table (often called the confusion matrix): it shows exactly what the model confuses with what.

Quick check
From lesson 90: a classifier called 12 signs "tent", and 8 of them really were tents. What is P(tent | called tent)?
  1. 0.4
  2. 0.333
  3. 1.5
  4. 0.667
Show the answer

0.667

Given the 12 called tent, 8 are tents: 8 ÷ 12 ≈ 0.667. That lesson named it precision; here it comes from the said-1 column of the table.

The picture. Here are the ten signs from lesson 102: the arrow detector's chance for each, and the real answer. At a threshold of 0.5 each chance becomes a call. Then the signs drop into the table one at a time, each lighting its cell; the totals sit in the "all" row and column. Last, each score lights the cells it reads and writes itself as a fraction. Watch which cells precision reads, and which recall reads.

Try it now

Then set threshold to 0.7 and press Use these numbers: precision rises to 1, recall falls to 0.6, and accuracy stays at 0.8.

Symbols and formula.

accuracy=TP+TNTP+FN+FP+TNprecision=TPTP+FPrecall=TPTP+FNF1=2⋅precision⋅recallprecision+recall\text{accuracy} = \frac{TP + TN}{TP + FN + FP + TN} \quad \text{precision} = \frac{TP}{TP + FP} \quad \text{recall} = \frac{TP}{TP + FN} \quad F_1 = \frac{2 \cdot \text{precision} \cdot \text{recall}}{\text{precision} + \text{recall}}

In plain words: accuracy is the share of all calls that were right. Precision: of the yes calls, how many were right. Recall: of the real yeses, how many were found. F1 blends the two.

Why F1 is a harmonic mean. A plain average would let one good score hide a bad one. A detector with precision 1 and recall 0.1 finds one arrow in ten, but averages (1 + 0.1) ÷ 2 = 0.55. Its F1 is 2 × 1 × 0.1 ÷ (1 + 0.1) = 0.18. The harmonic mean sits near the smaller of the two, so F1 is high only when both are. It is also 2TP ÷ (2TP + FP + FN): true negatives don't count at all, which is why F1 suits a rare yes class.

Quick check
A detector says yes 8 times and 6 of those are right. There were 10 real yeses. What are its precision and recall?
  1. Both 0.6
  2. Precision 0.75, recall 0.6
  3. Precision 0.75, recall 0.8
  4. Precision 0.6, recall 0.75
Show the answer

Precision 0.75, recall 0.6

Precision is 6 of its 8 yes calls, 0.75. Recall is 6 of the 10 real yeses, 0.6.

Quick check
Precision is 0.9 and recall is 0.1. Which is F1 closest to?
  1. 0.18
  2. 0.5
  3. 0.9
  4. 0.1
Show the answer

0.18

2 × 0.9 × 0.1 ÷ (0.9 + 0.1) = 0.18 ÷ 1 = 0.18: near the weak score, far below the plain average of 0.5.

Moving the threshold. Every call came from a threshold, and moving it moves the cells. Raise it and the model says yes less often: fewer false alarms, so precision usually rises, but more misses, so recall falls. Lower it and the trade runs the other way. Below, 200 cases are placed by a model's score, real arrows above and boards below, with the table and the four scores for the threshold you choose.

In your own words
In your own words: why can't accuracy alone tell you whether a detector is any good?

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

In Python: count the cells, then score them

Purpose. Count the four cells with a loop, then with array comparisons, and compute the four scores.

The loop asks of each sign, in turn, which of the four cases it is:

import numpy as np

p = np.array([0.95, 0.03, 0.67, 0.35, 0.97, 0.46, 0.55, 0.02, 0.95, 0.05])
y = np.array([1, 0, 0, 1, 1, 0, 1, 0, 1, 0])
pred = (p >= 0.5).astype(int)
tp, fn, fp, tn = 0, 0, 0, 0
for i in range(len(y)):
    if y[i] == 1 and pred[i] == 1:
        tp = tp + 1
    elif y[i] == 1:
        fn = fn + 1
    elif pred[i] == 1:
        fp = fp + 1
    else:
        tn = tn + 1
print(pred.tolist())
print(tp, fn, fp, tn)

The calls are 1, 0, 1, 0 and so on, and the counts are 4, 1, 1 and 4: the table the flow filled. The order of the branches matters. The first catches the hits; by the second, y is 1 but the call wasn't, so it's a miss; by the third, y is 0, so a 1 call is a false alarm; whatever is left is a true negative.

Code flow. Step through the same loop on four examples, one of each kind, and watch which branch each one takes and which counter goes up.

Array comparisons. NumPy can ask all ten signs at once. y == 1 is an array of Trues and Falses, and & joins two of them place by place: True only where both are. np.sum counts the Trues. Each comparison needs its own brackets, because & is worked out before ==.

import numpy as np

p = np.array([0.95, 0.03, 0.67, 0.35, 0.97, 0.46, 0.55, 0.02, 0.95, 0.05])
y = np.array([1, 0, 0, 1, 1, 0, 1, 0, 1, 0])
pred = (p >= 0.5).astype(int)
tp = np.sum((y == 1) & (pred == 1))
fn = np.sum((y == 1) & (pred == 0))
fp = np.sum((y == 0) & (pred == 1))
tn = np.sum((y == 0) & (pred == 0))
precision = tp / (tp + fp)
recall = tp / (tp + fn)
print(tp, fn, fp, tn)
print((tp + tn) / len(y), precision, recall, round(2 * precision * recall / (precision + recall), 3))

The same four counts, and accuracy, precision, recall and F1 all 0.8: one mistake of each kind, out of five of each.

Quick check
What does this print?
import numpy as np

y = np.array([1, 1, 0, 0, 1])
pred = np.array([1, 0, 0, 1, 1])
print(np.sum((y == 1) & (pred == 1)), np.sum((y == 0) & (pred == 1)))
  1. 2 2
  2. 2 1
  3. 3 2
  4. 1 2
Show the answer

2 1

Places 0 and 4 are hits (both 1): TP = 2. Place 3 is a false alarm (y 0, said 1): FP = 1.

Worked example

Worked example: 95% accurate, and useless

The opening question in code: 100 signs, 5 of them arrows, and a model that says 0 to every one. Compute its accuracy and its recall.

import numpy as np

y = np.array([1] * 5 + [0] * 95)
pred = np.zeros(100, dtype=int)
tp = np.sum((y == 1) & (pred == 1))
fn = np.sum((y == 1) & (pred == 0))
print(len(y), np.sum(y))
print(np.mean(pred == y), tp / (tp + fn))
In the lesson you can change this and run it.

[1] * 5 + [0] * 95 is a list of five 1s then ninety-five 0s. The model is right about every 0: accuracy 0.95. But its recall is 0.0: it found none of the 5 arrows. Its precision can't even be worked out, since it never said 1 and 0 ÷ 0 has no answer; libraries report 0 and print a warning. Whenever one class is rare, check recall before you trust an accuracy.

A named mistake: swapping precision and recall. Both divide TP by something, and the two somethings are easy to mix up. Swap them at a threshold of 0.3 and a detector that misses nothing (recall 1.0) gets reported as one that never raises a false alarm. One way to keep them apart: Precision divides by the Predicted yeses, the said-1 column, TP + FP; Recall divides by the Real yeses, the real-1 row, TP + FN.

Quick check
What does this print?
tp, fn, fp = 3, 0, 2
print(tp / (tp + fn), tp / (tp + fp))
  1. 0.6 1.0
  2. 1.0 0.6
  3. 0.6 0.6
  4. 1.0 1.0
Show the answer

1.0 0.6

The first divides by the real yeses, TP + FN = 3: recall 1.0, nothing missed. The second divides by the yes calls, TP + FP = 5: precision 0.6.

Drill

Fix the four scores

scores(y, pred) has three slips: two of its scores are swapped, F1 is a plain average, and a model that never says 1 crashes precision with 0 ÷ 0. Fix it so it returns accuracy, precision, recall and F1 as floats, with precision 0.0 when nothing was said 1 and F1 0.0 when precision and recall are both 0.

import numpy as np

def scores(y, pred):
    tp = np.sum((y == 1) & (pred == 1))
    fn = np.sum((y == 1) & (pred == 0))
    fp = np.sum((y == 0) & (pred == 1))
    tn = np.sum((y == 0) & (pred == 0))
    accuracy = (tp + tn) / len(y)
    precision = tp / (tp + fn)
    recall = tp / (tp + fp)
    f1 = (precision + recall) / 2
    return float(accuracy), float(precision), float(recall), float(f1)

y = np.array([1, 0, 0, 1, 1, 0, 1, 0, 1, 0])
pred = np.array([1, 0, 1, 1, 1, 1, 1, 0, 1, 0])
print(scores(y, pred))
In the lesson, your code is checked as you write it.
In your own words
Why do the four cells have to be counted from the same calls before any score is worked out?

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

In AI and ML: scoring the sign detector

Purpose. Choose a detector's threshold by what its mistakes cost, and read a three-way sign reader's table row by row.

The arrow detector at three thresholds. The same ten chances, called at 0.3, 0.5 and 0.7. Each line prints the threshold, then accuracy, precision, recall and F1:

import numpy as np

p = np.array([0.95, 0.03, 0.67, 0.35, 0.97, 0.46, 0.55, 0.02, 0.95, 0.05])
y = np.array([1, 0, 0, 1, 1, 0, 1, 0, 1, 0])
for t in [0.3, 0.5, 0.7]:
    pred = (p >= t).astype(int)
    tp = np.sum((y == 1) & (pred == 1))
    fp = np.sum((y == 0) & (pred == 1))
    fn = np.sum((y == 1) & (pred == 0))
    precision = tp / (tp + fp)
    recall = tp / (tp + fn)
    f1 = 2 * precision * recall / (precision + recall)
    print(t, np.mean(pred == y), round(precision, 3), round(recall, 3), round(f1, 3))

Accuracy doesn't move: 0.8 at every threshold. Underneath, the mistakes change places. At 0.3 the detector finds every arrow (recall 1.0) but two of its seven yes calls are boards (precision 0.714). At 0.7 every yes call is an arrow (precision 1.0), but it finds only 3 of the 5 (recall 0.6). F1 is best at 0.3 here, 0.833, but the right threshold depends on what each mistake costs, which no score knows.

Quick check
A trail-rescue alert flags hikers who may be in trouble. A miss could cost a life; a false alarm costs a phone call. Which score should it keep high?
  1. Recall, even if precision falls
  2. F1, since it blends both
  3. Precision, even if recall falls
  4. Accuracy, since it counts everything
Show the answer

Recall, even if precision falls

Recall counts the real cases found. When a miss is far worse than a false alarm, lower the threshold until recall is high, and accept the extra calls.

A three-class table, read row by row. The sign reader of the capstone (lesson 118) tells three kinds apart: arrows, tent signs and trail markers. Its table is 3 × 3, rows for the real kind and columns for what it said. Each kind gets its own recall from its row, the right calls (on the diagonal) over the row's total, and its own precision from its column. T.diagonal() reads the diagonal, and T.sum(axis=1) adds each row:

import numpy as np

T = np.array([[9, 1, 0],
              [2, 7, 1],
              [0, 2, 8]])
print(round(T.diagonal().sum() / T.sum(), 3))
print((T.diagonal() / T.sum(axis=1)).round(3).tolist())
print((T.diagonal() / T.sum(axis=0)).round(3).tolist())

Accuracy is 0.8, 24 right of 30. Row by row, the recalls are 0.9 for arrows, 0.7 for tent signs and 0.8 for markers: tent signs are the ones it misses, 2 called arrows and 1 a marker. Column by column, the precisions are 0.818, 0.7 and 0.889. One number would hide all of that.

Quick check
In the sign reader's table, which kind's precision is lowest, and what does that mean?
  1. Markers, 0.889: it calls markers least
  2. Tent signs, 0.7: it finds only 7 in 10 tents
  3. Tent signs, 0.7: of its tent calls, 3 in 10 are wrong
  4. Arrows, 0.818: it misses arrows most
Show the answer

Tent signs, 0.7: of its tent calls, 3 in 10 are wrong

The tent column holds 1 + 7 + 2 = 10 calls, 7 of them right: precision 0.7, so 3 of every 10 tent calls are another kind.

In PyTorch. The same comparisons work on tensors. (pred == 1) & (y == 1) is a tensor of Trues and Falses, .sum() counts them into a one-number tensor, and .item() takes the number out:

import torch

p = torch.tensor([0.95, 0.03, 0.67, 0.35, 0.97, 0.46, 0.55, 0.02, 0.95, 0.05])
y = torch.tensor([1, 0, 0, 1, 1, 0, 1, 0, 1, 0])
pred = (p >= 0.5).int()
tp = ((pred == 1) & (y == 1)).sum().item()
fp = ((pred == 1) & (y == 0)).sum().item()
fn = ((pred == 0) & (y == 1)).sum().item()
print(pred.tolist())
print(tp, fp, fn, tp / (tp + fp), tp / (tp + fn))

The same calls, the same TP 4, FP 1 and FN 1, and the same precision and recall, 0.8 each, as the NumPy cells. In a training loop this is how a model's held-back calls get scored at the end of each pass.

Drill

Which kind does the reader miss?

A second run of the sign reader gave the table T (rows: real arrow, tent, marker; columns: what it said). Set recalls to each kind's recall, rounded to 3 places, as a list, worst to the name of the kind with the lowest recall, and marker_precision to the markers' precision.

import numpy as np

T = np.array([[8, 2, 0],
              [1, 9, 0],
              [3, 1, 6]])
kinds = ["arrow", "tent", "marker"]
recalls = []
worst = ""
marker_precision = 0
print(recalls, worst, marker_precision)
In the lesson, your code is checked as you write it.
In your own words
After a change, a detector's accuracy rose from 0.80 to 0.82, but its recall fell from 0.9 to 0.6. Is it a better detector?

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

Goes deeper in

Practice what you just read

  • 6 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

A detector raises a false alarm. Which cell of the confusion table goes up?

  1. False positive: said yes, really no
  2. False negative: said no, really yes
  3. True positive
  4. True negative

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