Index Ai Academy
Foundation · Probability

Conditional probability and Bayes' rule

Conditionals from tables, why P(A | B) isn't P(B | A), Bayes' rule, and precision and recall.

About 45 minutes · Free lesson

What it covers6

Why it matters

A chance changes when you learn something. The chance of rain is one number; the chance of rain given that the sky is black is another. That "given" is conditional probability, and it's everywhere in machine learning: a language model predicts the next word given the words so far, and a spam filter scores a message given its words. A classic trap comes with it: the chance a test is positive given you're sick is not the chance you're sick given the test is positive, and confusing them can be badly wrong. Bayes' rule is the bridge between the two. This lesson builds both from a simple table of counts.

What you'll be able to do

  • Find P(A | B) from a two-way table: keep only the B column, then take the share
  • See that P(A | B) and P(B | A) are different numbers, often very different
  • Use Bayes' rule, drawn as paths on a tree, to turn one into the other, as for a test with false alarms
  • Read a classifier's results table both ways, precision and recall, in NumPy and with PyTorch
Quick check
Have a guess before you start. Of 100 hikers, 30 carried a map, and 24 of those finished the trail. Of the map carriers, what share finished?
  1. 0.24
  2. 0.8
  3. 0.3
  4. 0.72
Show the answer

0.8

Restrict to the 30 map carriers: 24 of 30 finished, 0.8. That's a conditional probability: finished, given a map.

The math: restrict, then take the share

Purpose. Update a chance when something is known.

A sign classifier was tested on 100 signs. The table counts what each sign was (rows) and what it was called (columns):

blankcalled tentcalled tarp
tent4010
tarp545

"Given it was called tent" means: look only at that column, 45 signs. Of those, 40 were tents:

P(A∣B)=P(A and B)P(B)=4045≈0.889P(A \mid B) = \frac{P(A \text{ and } B)}{P(B)} = \frac{40}{45} \approx 0.889

In plain words: shrink the world to the cases where B happened, then ask what share of those have A.

Quick check
From lesson 88: what is P(called tent) in that table?
  1. 0.4
  2. 0.45
  3. 0.9
  4. 0.5
Show the answer

0.45

40 + 5 = 45 of the 100 signs were called tent.

Step through conditioning on the "called tent" column: keep it, then turn its counts into shares.

The picture. The table is drawn as areas: a bar as wide as all 100 signs, with each column of the table on its own line and each piece as wide as its count. The empty part of each line is room for the other column's signs. The first step keeps one column and fades the other. Then the kept column gets a bar of its own: its signs are now the whole, and each piece's share of that bar is a conditional chance.

Try it now

Then set the column to keep to 1: given "called tarp", the shares are 10/55 and 45/55.

Symbols and formula. The two directions use different totals:

P(tent∣called tent)=4045≈0.889P(called tent∣tent)=4050=0.8P(\text{tent} \mid \text{called tent}) = \frac{40}{45} \approx 0.889 \qquad P(\text{called tent} \mid \text{tent}) = \frac{40}{50} = 0.8

In plain words: the first restricts to a column (calls); the second restricts to a row (actual tents).

P(A | B) is not P(B | A). Here they're close, 0.889 and 0.8, but they can be wildly different. Of all cows, nearly all have four legs; of all four-legged animals, few are cows. The order of the bar matters.

Quick check
In the sign table, what is P(called tarp | tarp)?
  1. 0.5
  2. 0.818
  3. 0.45
  4. 0.9
Show the answer

0.9

Restrict to the tarp row, 50 signs: 45 were called tarp, 0.9.

Bayes' rule. Often you know P(B | A) and want P(A | B). Draw it as paths: multiply down each branch to the evidence, add the branches for the total, and take one branch's share:

P(A∣B)=P(B∣A) P(A)P(B),P(B)=P(B∣A)P(A)+P(B∣not A)P(not A)P(A \mid B) = \frac{P(B \mid A)\,P(A)}{P(B)}, \qquad P(B) = P(B \mid A)P(A) + P(B \mid \text{not } A)P(\text{not } A)

In plain words: the share of all the ways to see B that came through A.

A test catches 90% of a condition that 1% of people have, but also flags 5% of healthy people. Step through it as a tree. From one person, the first branches say sick (0.01) or healthy (0.99); the second say what the test shows. Each step multiplies down one path, and the last adds the two paths to a positive and takes the sick path's share.

Most positives are false alarms, because healthy people vastly outnumber sick ones. A good test, used to look for something rare, still gives a positive that is usually wrong.

In your own words
In your own words: why is P(sick | positive) so much lower than P(positive | sick) for a rare condition?

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

In Python: a table as an array

Purpose. Store counts as a 2-D array, then get every conditional by dividing.

import numpy as np

T = np.array([[40, 10],
              [5, 45]])
cols = T.sum(axis=0)
rows = T.sum(axis=1)
print(cols.tolist(), rows.tolist())
print((T / cols).round(4).tolist())
print((T / rows.reshape(2, 1)).round(4).tolist())
It runs right here in your browser, with nothing to install.

T.sum(axis=0) adds down each column (lesson 64); axis=1 adds across each row. T / cols divides every column by its own total, by broadcasting: each column now holds P(row | that column). Dividing by the row totals, reshaped into a column so they line up with the rows, gives P(column | row) instead.

Code flow. Step through dividing the table by its row totals, one row at a time. np.zeros((2, 2)) makes a 2 × 2 table of zeros for the loop to fill with shares. Each pass of the loop takes one row's total and divides that row by it, so the row becomes P(called | what it was). The last line does all of it at once, the broadcasting way, and prints the same table.

A named mistake: the wrong total. Dividing a cell by the grand total gives P(A and B), not a conditional. Dividing by its row total gives P(column | row); by its column total, P(row | column). Before dividing, say the condition aloud: "given called tent" names a column, so divide by that column's total.

Every conditional at once. The two divided tables above hold all eight conditionals of the 2 × 2 table, each column (or row) adding to 1. That's a quick check on the arithmetic: if a conditioned column doesn't add to 1, the wrong total was used.

Worked example

Worked example: every conditional in a 2 × 3 table

A camp survey: rows are "liked it" and "didn't", columns are three trails. Find P(liked | trail) for each trail.

import numpy as np

T = np.array([[30, 10, 10],
              [5, 25, 20]])
per_trail = T.sum(axis=0)
liked_given_trail = T[0] / per_trail
print(per_trail.tolist())
print(liked_given_trail.round(4).tolist())
print((T / per_trail).sum(axis=0).tolist())
In the lesson you can change this and run it.

Each trail had 35, 35 and 30 hikers. The share who liked each: 30/35 ≈ 0.857, 10/35 ≈ 0.286 and 10/30 ≈ 0.333. The last line checks the arithmetic: every conditioned column adds to 1. Comparing conditionals, not raw counts, is fair even when the trails had different numbers of hikers.

Quick check
What does this print?
import numpy as np

T = np.array([[8, 2],
              [2, 8]])
print((T / T.sum(axis=0)).tolist())
  1. [[8, 2], [2, 8]]
  2. [[0.4, 0.1], [0.1, 0.4]]
  3. [[0.5, 0.5], [0.5, 0.5]]
  4. [[0.8, 0.2], [0.2, 0.8]]
Show the answer

[[0.8, 0.2], [0.2, 0.8]]

Each column totals 10, so each cell is divided by 10: the shares within each column.

Drill

Bayes' rule as a function

Fix bayes(prior, hit, false_alarm) so it returns P(A | positive) for a test with P(positive | A) = hit and P(positive | not A) = false_alarm. Then set p1 for prior 0.01, hit 0.9, false alarm 0.05, and p2 for prior 0.3 with the same test, both rounded to 4 places.

def bayes(prior, hit, false_alarm):
    return hit * prior

p1 = 0
p2 = 0
print(p1, p2)
In the lesson, your code is checked as you write it.
In your own words
The same test gives P(A | positive) of 0.15 when A is rare and 0.89 when it's common. Why?

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

In AI and ML: predictions are conditional

Purpose. Models predict one thing given another.

A language model gives P(next word | the words so far); a spam filter gives P(spam | the message's words). A classifier's results table, like the sign table, gives two numbers people care about, and they're conditionals in opposite directions:

precision=P(tent∣called tent)recall=P(called tent∣tent)\text{precision} = P(\text{tent} \mid \text{called tent}) \qquad \text{recall} = P(\text{called tent} \mid \text{tent})

In plain words: precision asks how many of its "tent" calls were right; recall asks how many of the real tents it found.

import numpy as np

T = np.array([[40, 10],
              [5, 45]])
precision = T[0, 0] / T[:, 0].sum()
recall = T[0, 0] / T[0].sum()
print(round(float(precision), 4), round(float(recall), 4))

For "tent", precision is 0.8889 (column) and recall 0.8 (row). A classifier can be high on one and low on the other, which is why both are reported. The picture lights the cells each one divides by.

Quick check
A classifier calls 10 signs "tent", and all 10 are tents, but it misses 40 other tents. What are its precision and recall for tent?
  1. Precision 1.0, recall 0.2
  2. Both 0.2
  3. Precision 0.2, recall 1.0
  4. Both 1.0
Show the answer

Precision 1.0, recall 0.2

All its tent calls were right: precision 10/10. It found only 10 of the 50 tents: recall 10/50 = 0.2.

Naive Bayes. One of the oldest text classifiers runs Bayes' rule directly: P(spam | words) is built from P(words | spam), counted from labeled examples, and the prior P(spam). It assumes the words are independent given the class, which is false but works surprisingly well. This lesson's paths are its whole calculation.

Precision and recall pull against each other. They share the hits on top and differ only in the total below, exactly like P(A | B) and P(B | A). A model can raise its recall by calling "tent" more often: it catches more real tents, but it also calls more tarps "tent", which lowers its precision.

In PyTorch. The same two divisions on a tensor. T.sum(dim=1, keepdim=True) adds across each row and keeps the totals standing as a column, (2, 1), so they line up with the rows, the job .reshape(2, 1) did in the Python part. dim=0 adds down each column instead.

import torch

T = torch.tensor([[40.0, 10.0], [5.0, 45.0]])
by_row = T / T.sum(dim=1, keepdim=True)   # P(called | what it was)
by_col = T / T.sum(dim=0, keepdim=True)   # P(what it was | called)
print(by_row)
print(round(by_col[0, 0].item(), 4), round(by_row[0, 0].item(), 4))

The first row of by_row splits the 50 real tents: 0.8 were called tent (the recall) and 0.2 called tarp. The last line prints 0.8889 and 0.8, the precision and recall the NumPy cell printed. Evaluation code does exactly this to a model's results table, one row and one column per class.

Quick check
What does this print? (Rows: actual tent, tarp. Columns: called tent, tarp.)
import numpy as np

T = np.array([[8, 2], [4, 6]])
print(round(float(T[0, 0] / T[:, 0].sum()), 3), round(float(T[0, 0] / T[0].sum()), 3))
  1. 0.667 0.8
  2. 0.667 0.4
  3. 0.8 0.667
  4. 0.4 0.8
Show the answer

0.667 0.8

Precision: 8 of the 12 called tent, 0.667. Recall: 8 of the 10 real tents, 0.8.

Drill

Precision and recall from a table

For the classifier's table below (rows: actual tent, tarp; columns: called tent, tarp), set precision and recall for tent, and tarp_precision for tarp, each rounded to 4 places.

import numpy as np

T = np.array([[30, 20],
              [10, 40]])
precision = 0
recall = 0
tarp_precision = 0
print(precision, recall, tarp_precision)
In the lesson, your code is checked as you write it.
In your own words
When would you care more about recall than precision?

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

P(A and B) = 0.2 and P(B) = 0.5. What is P(A | B)?

  1. 0.4
  2. 0.1
  3. 0.7
  4. 2.5

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