Index Ai Academy
Foundation · Probability

Review: find the slip (probability)

Probability slips to fix, mixed practice from the module, and its formula sheet.

About 36 minutes · Free lesson

What it covers6

Why it matters

Probability slips are quieter than most. A list of chances that adds up to 0.9 still samples without an error. Two dependent events multiplied as if they were independent give a neat, wrong number. A test that catches 90% of the sick gets read as "a positive means 90% sick", and a whole decision rests on the swap. A simulation without a seed gives a different answer every run, so nobody can check it. This review gathers the module's five commonest slips, each paired with the one-line check that catches it, mixes problems from all of Module 6, and collects every rule on one sheet, ready for Module 7, where these chances meet real data and a model's loss.

What you'll be able to do

  • Spot the common slips of Module 6: chances that don't add up to 1, dependent events multiplied as if independent, P(A | B) swapped with P(B | A), a simulation with no seed, and a variance left without its square root
  • Find and fix slips in probability code that runs but gives a wrong answer
  • Mix problems from every lesson of the module, and run a short probability program in your head, line by line
  • Use the module's formula sheet: each rule, what it says, and its Python line, and see where Module 6 sits in a model
Quick check
Have a guess before you start. A spam filter flags 95% of spam. A friend says: "So a flagged email is 95% likely to be spam." Is that right?
  1. No: it swaps P(flag | spam) for P(spam | flag)
  2. Only if the filter is new
  3. Yes, always
  4. It's right when there are more than 100 emails
Show the answer

No: it swaps P(flag | spam) for P(spam | flag)

95% is P(flagged | spam). P(spam | flagged) also depends on how much email is spam and how often good mail is flagged: Bayes' rule.

Find the slip

Purpose. Five slips cover most of Module 6's mistakes, and each has a quick check:

  • Chances that don't add up to 1. [0.5, 0.3, 0.1] isn't a distribution. Check: p.sum() must be 1.
  • Dependent events multiplied. P(A and B) = P(A) × P(B) only when A doesn't change B's chance. Check: is B's chance the same once A has happened? If not, use P(A) × P(B | A).
  • P(A | B) swapped with P(B | A). They restrict to different groups. Check: say aloud which group is being counted in, and use Bayes' rule to move between them.
  • No seed. default_rng() with nothing inside gives new numbers every run. Check: run it twice; the answer must not change.
  • A variance left as a spread. Σ (x − μ)²p is in squared units. Check: the units. A spread in tents² is a variance; take the square root for σ.

Below are ten worked lines, with a comment saying what each should give. Five have a slip.

Try it now

How the checks catch them. Each slip fails a one-line test. p.sum() prints 0.9 for the next-word chances. Asking "is tomorrow's chance the same after a rainy day?" gives 0.7 against 0.4, so the events are dependent. Saying "among the positives, how many are sick?" shows that 0.9 answered a different question, among the sick. Running the simulation twice prints two different answers. And the units of Σ (x − μ)²p come out squared. Predict the next one before you run it.

Quick check
What does this print?
import numpy as np

v = np.array([0.0, 10.0])
p = np.array([0.5, 0.5])
mean = v @ p
var = np.sum((v - mean) ** 2 * p)
print(var, var ** 0.5)
  1. 25.0 25.0
  2. 25.0 5.0
  3. 5.0 25.0
  4. 5.0 5.0
Show the answer

25.0 5.0

Both values sit 5 from the mean of 5, so the variance is 5² = 25 and σ, its square root, is 5: the typical distance, in the data's units.

Slips that hide in code. Like the earlier modules', these slips mostly run without an error. rng.choice refuses chances that don't add up to 1, but an expected value v @ p or a sampler by slices (lesson 91) uses them without complaint, so the slip surfaces far from where it was made. A Bayes calculation that forgets one path into P(B) returns a number between 0 and 1 that looks like a probability. The two drills below are slips of exactly this kind: each runs, each gives a confident wrong answer, and one check exposes each.

Quick check
A disease affects 1 in 100 people. A test is positive for 90% of the sick and 5% of the well. Roughly what is P(sick | positive)?
  1. 0.9
  2. About 0.15
  3. 0.01
  4. 0.05
Show the answer

About 0.15

Of 1,000 people: 9 sick test positive, and about 50 of the 990 well do too. 9 of 59 positives are sick: about 0.15.

Drill

Chances that don't add up

This code turns next-word counts into chances, but they add up to more than 1. Find the slip and fix it.

import numpy as np

counts = np.array([6, 3, 1])
p = counts / 6
print(p.tolist(), float(np.sum(p)))
In the lesson, your code is checked as you write it.
In your own words
Which check would you run on any list of chances before sampling from it, and why that one first?

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

Mixed practice

Purpose. Problems from across Module 6, mixed. Name each one's lesson before you start: counting, chances, and-or, conditionals, Bayes, random variables, expected values, named distributions or covariance. If one stops you, the steps show the way, and the formula sheet in the last part has every rule in one place.

Play computer. The program below runs the module in small: a count of groups, chances from counts and their check, an expected value, a variance and its square root, and two dependent events in a row. Most lines are a spot where one of the first part's slips could creep in, written here the right way. Work out every value in your head before you type it, the way Python prints it. .item() turns NumPy's one-number answers into plain Python numbers, so they print plainly.

Worked example

Worked example: a simulation with its checks built in

Simulate a rainy-day chain, and check the chances add up to 1, the run repeats exactly, and the answer agrees with the multiplication rule.

import numpy as np

p_today = np.array([0.4, 0.6])
print("adds to 1:", float(p_today.sum()) == 1.0)

def simulate(seed, n):
    rng = np.random.default_rng(seed)
    both = 0
    for day in range(n):
        rain = rng.random() < 0.4
        if rain:
            if rng.random() < 0.7:
                both = both + 1
    return both / n

a = simulate(1, 20000)
print("repeats:", a == simulate(1, 20000))
print(round(a, 2), round(0.4 * 0.7, 2))
It runs right here in your browser, with nothing to install.

The first check would catch chances that don't add up; the second, a missing seed, since the same seed must give the same answer. The last line compares the simulation, about 0.28, with the multiplication rule for dependent events, P(rain) × P(rain | rain the day before) = 0.4 × 0.7 = 0.28. Had the code used 0.4 × 0.4 = 0.16, the simulation would have disagreed at once. Three cheap checks catch most probability bugs.

Quick check
What does this print?
import numpy as np

counts = np.array([2, 3, 5])
p = counts / counts.sum()
print(p.tolist(), float(p.sum()))
  1. [0.2, 0.3, 0.5] 10.0
  2. [0.2, 0.3, 0.5] 1.0
  3. [0.4, 0.6, 1.0] 1.0
  4. [2, 3, 5] 10.0
Show the answer

[0.2, 0.3, 0.5] 1.0

Dividing each count by the total, 10, gives chances that add up to exactly 1: a distribution.

Quick check
Two cards are drawn from 10, of which 4 are red, without putting the first back. Which is P(both red)?
  1. 4/10 × 3/9
  2. 4/10 + 3/9
  3. 4/10 × 4/10
  4. 4/10
Show the answer

4/10 × 3/9

Without replacement the second draw depends on the first: once a red is gone, 3 reds are left among 9 cards.

Drill

A simulation nobody can check

This function should estimate the chance of rolling a six, and give the same answer every time it runs with the same seed. It doesn't. Find the slip and fix it.

import numpy as np

def six_rate(seed, n):
    rng = np.random.default_rng()
    rolls = rng.integers(1, 7, size=n)
    return float(np.mean(rolls == 6))

print(six_rate(5, 6000), six_rate(5, 6000))
In the lesson, your code is checked as you write it.
In your own words
Which kind of problem in the mixed ladder did you have to stop and think about most? What told you which method to use?

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

The formula sheet

Purpose. Every rule of Module 6 in one place, with what it says and its Python line.

lessonrulein plain wordsin Python
87n!; n!/(n − r)!; n!/(r!(n − r)!)orders; ordered picks; groupsmath.factorial(n), math.perm(n, r), math.comb(n, r)
88P(A) = ways for A ÷ all ways; P(not A) = 1 − P(A)a share of equally likely outcomesnp.mean(event) over seeded trials
89P(A or B) = P(A) + P(B) − P(A and B)add, then remove the overlappa + pb - pab
89P(A and B) = P(A) × P(B), if independentmultiply only when one doesn't change the otherpa * pb
90P(A given B) = P(A and B) ÷ P(B)count inside the group where B happenedT / T.sum(axis=0)
90Bayes: P(A given B) = P(B given A) P(A) ÷ P(B)turn one conditional into the otherpba * pa / pb
Quick check
Which row of the sheet so far catches a P(A | B) read as P(B | A)?
  1. Lesson 87: groups
  2. Lesson 89: the "or" rule
  3. Lesson 90: Bayes' rule
  4. Lesson 88: the complement
Show the answer

Lesson 90: Bayes' rule

Bayes' rule is exactly the bridge from P(B | A) to P(A | B), and it shows they differ unless P(A) = P(B).

The rest of the sheet:

lessonrulein plain wordsin Python
91Σ pᵢ = 1; P(range) = Σ of its pᵢa chance for every valuerng.choice(v, size=n, p=p)
92E[X] = Σ xᵢpᵢ; Var = Σ (xᵢ − μ)²pᵢ; σ = √Varbalance point; spread, in the data's unitsv @ p, ((v - mu) ** 2) @ p, var ** 0.5
93P(k) = C(n, k) pᵏ(1 − p)ⁿ⁻ᵏ; mean np; z = (x − μ)/σyeses in n trials; distance in σ'smath.comb(n, k) * p ** k * (1 - p) ** (n - k)
94cov = mean of (x − x̄)(y − ȳ); r = cov ÷ (σₓσᵧ)moving together, from −1 to 1np.mean(dx * dy), np.corrcoef(x, y)

Each row is also a check: if an answer breaks a row, the slip is in that step.

Where Module 6 lives in a model. Probability is how a model talks about what it doesn't know. It turns scores into chances that add up to 1, one per possible next word, and sampling draws from them. Its loss is an expected value, averaged over a batch. Its precision and recall are conditional chances, and its accuracy needs an error bar, from the binomial. Counting says how attention's work grows with length, and chained chances say how fast many steps that usually work become likely to fail. Its starting weights are random draws, and covariance shows which inputs repeat each other.

Coming up. First, lesson 96 turns this module's formulas around: Bayes' rule solved for the prior, and expected values, variances and z-scores run backward. Then Module 7's chances meet real data. Lesson 97 describes a column of numbers with the same mean and spread, divided by n or n − 1. Lesson 100 picks a model's numbers to make the data as likely as possible, and lessons 104 and 105 turn a model's scores into a distribution like the ones here, then measure how surprised it is by the right answer: the loss that every model in the academy is trained on.

In your own words
Pick the rule on the sheet you're most likely to slip on. What check would you use to catch the slip?

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

Goes deeper in

Practice what you just read

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

Try a quiz question

What's the slip in p = np.array([0.5, 0.3, 0.1]) for the only three possible outcomes?

  1. The chances add up to 0.9, not 1
  2. Chances can't be decimals
  3. There should be more than three
  4. There's no slip

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