Index Ai Academy
Foundation · Transposition of formulas

Probability formulas: solve for the missing chance

Conditionals, Bayes' rule for the prior, the or rule, expected values, variance, and z-scores turned around.

About 45 minutes · Free lesson

What it covers6

Why it matters

Every probability formula can be asked backward. A test report gives P(positive | sick), but you want the base rate. A game's average is known, but one payout is missing. A system must be 99% reliable, and you need the number of checks. Each is a transposition with the moves you know, plus one new condition: the answer must be a chance, between 0 and 1.

What you'll be able to do

  • Turn the complement, "and", "or" and Bayes rules around for any chance, the prior and the likelihood included
  • Free a chance that appears twice in the total-probability rule by expanding, collecting and dividing
  • Rearrange expected value, variance, binomial and z-score formulas, and choose the root that fits
  • Solve pⁿ ≥ target for n with logs, flipping the sign because ln p is negative
  • Check that every answer lies between 0 and 1, with exact fractions and a seeded simulation
Quick check
Have a guess before you start. 30% of the trail club's hikers carry a map, and 27% carry a map and finish. Of the map carriers, what share finish?
  1. 8.1%
  2. 27%
  3. 90%
  4. 57%
Show the answer

90%

P(map and finish) = P(map) × P(finish | map). Undo the multiplication by dividing: P(finish | map) = 0.27 ÷ 0.3 = 0.9.

The math: run each rule backward

Purpose. Make any chance in a probability formula the subject, and check the answer can be a chance.

Each rule from the probability module turns around with the four moves of lesson 30:

RuleTurned around
P(not A) = 1 − P(A)P(A) = 1 − P(not A)
P(A and B) = P(A) × P(B given A)P(B given A) = P(A and B) ÷ P(A)
P(A or B) = P(A) + P(B) − P(A and B)P(A and B) = P(A) + P(B) − P(A or B)
P(A given B) = P(B given A) × P(A) ÷ P(B)P(A) = P(A given B) × P(B) ÷ P(B given A)

P(B | A) is read "the chance of B given A", as in lesson 90. In Bayes' rule, P(A) is the prior: the chance before any evidence. P(B | A) is the likelihood: the chance of the evidence if A is true. Either can be the subject, so P(B | A) = P(A | B) × P(B) ÷ P(A) too.

Conditions. Divide only by a chance above 0. And every answer must land from 0 to 1. Say P(A) = 0.5, P(B) = 0.4 and P(A or B) = 0.95. The overlap comes out as −0.05, so these three numbers can't all be true. That's a check on the data, not a rounding slip.

Quick check
From an earlier lesson: P(A) = 0.5, P(B) = 0.4 and P(A and B) = 0.2. What is P(A or B)?
  1. 0.9
  2. 0.2
  3. 1.1
  4. 0.7
Show the answer

0.7

Add the two, then take away the overlap so it isn't counted twice: 0.5 + 0.4 − 0.2 = 0.7.

A chance that appears twice. In the trail club, 90% of hikers with a map finish, and 50% without one do. Overall, 62% finish. What share carry a map? Call it a. Finishers come by two paths, with a map or without:

0.62=0.9a+0.5(1−a)0.62 = 0.9a + 0.5(1 - a)

The letter a appears twice, so use the move from lesson 32: expand, collect, divide. That gives 0.62 = 0.5 + 0.9a − 0.5a = 0.5 + 0.4a. So 0.4a = 0.12, and a = 0.3. Collected, the rule is a two-step machine: multiply by 0.4, which is 0.9 − 0.5, then add 0.5. Watch it built and peeled.

Try it now

Try a = 0 and a = 1: the finish rate runs from 0.5 to 0.9. A rate outside that range has no map share that fits.

Symbols and formula. The total-probability rule, solved for the prior:

P(B)=P(B∣A)P(A)+P(B∣not A)(1−P(A))  ⇒  P(A)=P(B)−P(B∣not A)P(B∣A)−P(B∣not A)P(B) = P(B \mid A)P(A) + P(B \mid \text{not } A)\big(1 - P(A)\big) \;\Rightarrow\; P(A) = \frac{P(B) - P(B \mid \text{not } A)}{P(B \mid A) - P(B \mid \text{not } A)}

In plain words: how far the overall rate sits above the "not A" rate, as a share of the gap between the two rates.

Conditions. The two rates must differ. If they're equal, B happens at the same rate either way, so it says nothing about A, and the formula divides by 0. And P(B) must lie between the two rates, or the answer leaves 0 to 1.

Named mistakes.

  • Dividing by the wrong chance: P(A and B) ÷ P(B) is P(A | B), not P(B | A).
  • Writing 0.5a for the second path. Hikers without a map are 1 − a of the club, not a.
  • Keeping an answer of 1.3 or −0.2 instead of rechecking the data.
Quick check
A spam filter flags posts with a certain word. P(spam | word) = 0.8, P(word) = 0.05 and P(spam) = 0.2. Solve Bayes' rule for the likelihood P(word | spam).
  1. 0.2
  2. 0.008
  3. 0.04
  4. 3.2
Show the answer

0.2

P(word | spam) = P(spam | word) × P(word) ÷ P(spam) = 0.8 × 0.05 ÷ 0.2 = 0.2.

Averages and spreads, turned around.

  • A missing value. E[X] = Σxp is a sum of products. Tent rentals of 10, 20 or x, with chances 0.2, 0.5 and 0.3, have E[X] = 21. So 2 + 10 + 0.3x = 21, giving 0.3x = 9 and x = 30.
  • A missing chance. All the chances add to 1, so write the last one as 1 minus the others. Rentals of 10, 20 or 30 with chances 0.2, q and 0.8 − q, and E[X] = 25: 2 + 20q + 30(0.8 − q) = 25. Collect q: 26 − 10q = 25, so q = 0.1. Check that no chance goes below 0: q must lie from 0 to 0.8.
  • The second moment. E[X²], the mean of the squares, comes from Var(X) = E[X²] − μ² turned around: E[X²] = Var(X) + μ². For the first rentals, 49 + 21² = 490.
  • A binomial counts the successes in n independent tries, each with chance p. The mean μ = np gives n = μ/p and p = μ/n (p above 0, and n must come out whole). The variance np(1 − p) = v is a quadratic in p, np² − np + v = 0. By lesson 34, p = (1 ± √(1 − 4v/n))/2. Both roots lie from 0 to 1, and they add to 1: p and 1 − p give the same spread. The variance can't choose between them, but the mean can. A real root needs v ≤ n/4.
Quick check
A model answers 100 questions, each right with chance p. Its number right has variance 21, so np(1 − p) = 21 gives p = 0.3 or p = 0.7. The model gets most questions right. Which fits?
  1. Neither: 21 > 100/4
  2. Both, with mean 50
  3. p = 0.3, mean 30
  4. p = 0.7, mean 70
Show the answer

p = 0.7, mean 70

Both roots give variance 21, since 100 × 0.3 × 0.7 = 21 either way. "Most right" means p above 0.5, so p = 0.7 and the mean is np = 70.

Distances and repeats, turned around. A z-score z = (x − μ)/σ has three other letters to free. Multiply by σ and add μ: x = μ + zσ, the value z standard deviations above the mean. Take zσ away: μ = x − zσ. Or divide: σ = (x − μ)/z, which needs z ≠ 0.

Independent repeats multiply. If each step goes right with chance p, all n steps do with chance pⁿ. For the most steps that keep this at or above a target, take logs (lesson 35): n·ln p ≥ ln(target). But ln p is negative for p between 0 and 1, so dividing by it flips the sign (lesson 36): n ≤ ln(target)/ln p. With p = 0.9 and a target of 0.5, n ≤ 6.58. Round down to 6, since 0.9⁷ ≈ 0.478 falls short.

In your own words
A rearranged chance comes out as 1.2. What should you conclude, and why?

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

In Python: exact fractions and a seeded simulation

Purpose. Check a rearrangement two ways: exactly, with fractions, and by building the world forward with random numbers.

from fractions import Fraction
import numpy as np

finish, given_map, given_none = Fraction(62, 100), Fraction(9, 10), Fraction(1, 2)
a = (finish - given_none) / (given_map - given_none)
print(a, given_map * a + given_none * (1 - a))

rng = np.random.default_rng(0)
has_map = rng.random(100000) < 0.3
finished = rng.random(100000) < 0.5 + 0.4 * has_map
rate = float(finished.mean())
print(round(rate, 4), round((rate - 0.5) / 0.4, 4))
It runs right here in your browser, with nothing to install.
  • Fraction keeps every number exact. The map share is 3/10, and putting it back gives 31/50, which is 0.62, with no rounding error at all.
  • The seeded generator makes 100,000 hikers, about 30% with a map. Each one's chance to finish is 0.5 + 0.4 × has_map: True counts as 1, so that's 0.9 with a map and 0.5 without.
  • The simulated rate gives back about 0.3, not exactly. The rate wobbles a little, and the solve divides that wobble by 0.4, which makes it 2.5 times bigger.
Worked example

Worked example: a binomial's p from its spread

A model answers n = 100 questions. Its number right has variance 21 and mean 70. Solve np(1 − p) = 21 for both roots, keep the one the mean agrees with, and check E[X²] = Var + μ² by simulation.

import math
import numpy as np

def binomial_p(n, var):
    disc = 1 - 4 * var / n
    if disc < 0:
        return None
    root = math.sqrt(disc)
    return (round((1 - root) / 2, 6), round((1 + root) / 2, 6))

print(binomial_p(100, 21), binomial_p(100, 25), binomial_p(100, 30), round(70 / 0.7))
rng = np.random.default_rng(1)
x = rng.binomial(100, 0.7, size=100000)
mu, var = float(x.mean()), float(x.var())
print(round(mu, 1), round(var, 1))
print(round(float((x ** 2).mean()), 2), round(var + mu ** 2, 2), 21 + 70 ** 2)
In the lesson you can change this and run it.

A variance of 21 gives the pair 0.3 and 0.7, and the mean of 70 picks 0.7. Then n = μ/p = 70 ÷ 0.7 gives back the 100 questions. A variance of 25 is the largest any 100 trials can have, so both roots meet at 0.5. A variance of 30 has no real p, and the function says so with None. In the simulation, the last line's first two numbers match: for any list of numbers, the mean of the squares is exactly its variance plus its mean squared. They sit near 4,921, not on it, because the simulated mean and variance only come close to 70 and 21.

Quick check
What does this print?
from fractions import Fraction

p_a, p_b, p_or = Fraction(1, 2), Fraction(2, 5), Fraction(7, 10)
p_and = p_a + p_b - p_or
print(p_and, p_and / p_a)
  1. 8/5 16/5
  2. 1/5 1/10
  3. 0.2 0.4
  4. 1/5 2/5
Show the answer

1/5 2/5

The "or" rule turned around gives P(A and B) = 1/2 + 2/5 − 7/10 = 1/5. Dividing by P(A) = 1/2 gives P(B | A) = 2/5. Fractions print as fractions.

Quick check
An agent gets each step right with chance 0.95, independently. Solving 0.95ⁿ ≥ 0.6 for n, what is the longest task it finishes at least 60% of the time?
  1. At most 10 steps
  2. At most 9 steps
  3. At most 12 steps
  4. At least 10 steps
Show the answer

At most 9 steps

n·ln 0.95 ≥ ln 0.6. ln 0.95 is negative, so dividing flips the sign: n ≤ 9.96. Round down, since 0.95¹⁰ ≈ 0.599 falls just short of 0.6.

Drill

Fix the backward rules

prior_from_total divides by the wrong thing and never checks its answer. most_steps rounds the wrong way. Fix both. Return None when the rates are equal or the answer leaves 0 to 1.

import math

def prior_from_total(p_b, b_given_a, b_given_not_a):
    return (p_b - b_given_not_a) / b_given_a

def most_steps(p, target):
    return math.ceil(math.log(target) / math.log(p))

print(prior_from_total(0.62, 0.9, 0.5), most_steps(0.9, 0.5))
In the lesson, your code is checked as you write it.
In your own words
The simulated hikers gave a map share of about 0.3, not exactly 0.3. Why does solving make the wobble bigger, and what does each check tell you?

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

In AI and ML: base rates, checks, thresholds and costs

Purpose. Four everyday questions in testing and running a model are probability formulas run backward.

The base rate behind a classifier. The base rate is the share of cases that really are positive. A spam filter on the club's message board has recall r = 0.8 (it catches 80% of spam), a false-positive rate f = 0.05 (it flags 5% of good posts) and precision 0.8 (80% of its flags are spam). Precision is Bayes' rule, with the base rate π inside it twice:

prec=rπrπ+f(1−π)  ⇒  π=prec⋅fr(1−prec)+prec⋅f\text{prec} = \frac{r\pi}{r\pi + f(1 - \pi)} \;\Rightarrow\; \pi = \frac{\text{prec} \cdot f}{r(1 - \text{prec}) + \text{prec} \cdot f}

In plain words: clear the fraction, gather the π terms on one side, and divide by their bracket.

from fractions import Fraction

def base_rate(precision, recall, fpr):
    return precision * fpr / (recall * (1 - precision) + precision * fpr)

pi = base_rate(Fraction(4, 5), Fraction(4, 5), Fraction(1, 20))
print(pi, Fraction(4, 5) * pi / (Fraction(4, 5) * pi + Fraction(1, 20) * (1 - pi)))

One post in five is spam, and putting 1/5 back into the precision formula gives 4/5 exactly.

Quick check
The same filter moves to another board. Its recall and false-positive rate stay the same, but its precision drops to 0.5. What happened to the base rate?
  1. It rose, to about 50%
  2. It stayed at 20%
  3. It fell, to about 6%
  4. It fell to 0
Show the answer

It fell, to about 6%

π = 0.5 × 0.05 ÷ (0.8 × 0.5 + 0.5 × 0.05) = 0.025 ÷ 0.425 ≈ 0.059. Spam is rarer here, so the 5% of good posts it flags make up more of its flags.

How many checks? A checking step catches a wrong answer with chance 0.6, and the checks are independent. All n miss with chance 0.4ⁿ, so by the complement at least one catches it with chance 1 − 0.4ⁿ. For 99%, 0.4ⁿ ≤ 0.01. Take logs, and divide by ln 0.4 < 0 to flip the sign: n ≥ 5.03. Round up to 6 checks, since 5 still miss 1.02%.

An anomaly threshold. A model server's response times have mean μ = 200 ms and σ = 12 ms. Flag any time more than 3σ above the mean: x = μ + zσ = 236 ms. Turned back, z = (x − μ)/σ says how unusual a time was.

Where two actions cost the same. The filter gives a post a spam chance p, then hides it or lets it through. Hiding a good post costs 1 (an annoyed member). Letting spam through costs 4. Letting through has expected cost 4p, and hiding has expected cost 1 × (1 − p). They're equal when 4p = 1 − p. Collect p: 5p = 1, so p = 0.2. Hide every post above 0.2. In general, with c_fp for a false alarm and c_fn for a miss, the threshold is c_fp/(c_fp + c_fn).

Quick check
What does this print?
import math

def checks_needed(catch, target):
    return math.ceil(math.log(1 - target) / math.log(1 - catch))

def cost_threshold(cost_fp, cost_fn):
    return cost_fp / (cost_fp + cost_fn)

print(checks_needed(0.6, 0.99), checks_needed(0.8, 0.99), cost_threshold(1, 4))
  1. 5 3 0.8
  2. 6 3 0.2
  3. 6 3 0.25
  4. 5 2 0.2
Show the answer

6 3 0.2

ln 0.01 ÷ ln 0.4 ≈ 5.03 rounds up to 6, and ln 0.01 ÷ ln 0.2 ≈ 2.86 rounds up to 3. The threshold is 1 ÷ (1 + 4) = 0.2.

Drill

Base rates and cost thresholds

base_rate divides by recall alone, and cost_threshold puts the wrong cost on top. Fix both so each one undoes its formula.

def base_rate(precision, recall, fpr):
    return precision * fpr / recall

def cost_threshold(cost_fp, cost_fn):
    return cost_fn / (cost_fp + cost_fn)

print(base_rate(0.8, 0.8, 0.05), cost_threshold(1, 4))
In the lesson, your code is checked as you write it.
In your own words
The same spam filter shows precision 0.8 on one board and 0.5 on another. Why, and what does running Bayes' rule backward give you?

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

Goes deeper in

Practice what you just read

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

Make the prior P(A) the subject of Bayes' rule, P(A | B) = P(B | A)P(A)/P(B).

  1. P(A) = P(A | B)P(B)/P(B | A)
  2. P(A) = P(B | A)P(B)/P(A | B)
  3. P(A) = P(A | B)P(B | A)/P(B)
  4. P(A) = 1 − P(A | B)

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.

Part of a free course 19 lessons

Transposition of Formulas: algebraic manipulation in every topic

Learn to make any letter of any formula the subject: layers undone in reverse order, fractions, a letter that appears twice, powers, roots, quadratics, logs, inequalities, trigonometry, vectors, matrices, calculus, probability, statistics and the formulas inside AI models, each checked in Python.

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