Index Ai Academy
Foundation · Probability

Random variables and distributions

Uncertain numbers, the probability of a range, sampling by slices, and sampling versus argmax.

About 42 minutes · Free lesson

What it covers6

Why it matters

Lesson 88 found the chance of an event. A random variable goes further: it's an uncertain number, like a die's face or tomorrow's rentals, described completely by its distribution, the chance of every value it can take. Once you have the distribution, you can answer any question about the number, and you can draw samples from it: pick values at random, with the likely ones picked more often. That last idea is how a language model writes. At every step it has a distribution over the next word, and generating text means sampling from it, over and over. This lesson builds distributions, samples them by hand and in Python, and writes a few words that way.

What you'll be able to do

  • Describe an uncertain number as a random variable with a distribution: a table or bars that sum to 1
  • Find the probability of a range of values, and read a curve's area as probability for continuous values
  • Sample from a distribution with rng.choice, count the samples into a histogram, and watch it approach the bars
  • Generate text by sampling next words, compare it with always taking the most likely one, and reshape the odds with temperature and top-k in PyTorch
Quick check
Have a guess before you start. A spinner lands on 1 half the time, 2 a third of the time and 3 otherwise. What is P(3)?
  1. 1/2
  2. 1
  3. 1/6
  4. 1/3
Show the answer

1/6

The chances must add to 1: 1 − 1/2 − 1/3 = 1/6.

The math: an uncertain number and its distribution

Purpose. A full description of an uncertain number.

A random variable X is a number whose value depends on chance: the face of a die, the number of heads in ten tosses, the next word's position in a vocabulary. Its distribution gives the probability of every value:

x1234
P(X = x)0.50.30.150.05

In plain words: a table (or a bar chart) of each value and its chance. The chances are between 0 and 1 and add up to 1.

Questions about X become sums: P(X ≥ 3) = 0.15 + 0.05 = 0.2; P(X is even) = 0.3 + 0.05 = 0.35.

Quick check
From lesson 88: in that table, what is P(X ≠ 1)?
  1. 0.5
  2. 0.3
  3. 1
  4. 0
Show the answer

0.5

The complement: 1 − P(X = 1) = 1 − 0.5 = 0.5.

Sampling. To draw a value at random from the distribution, give each value a slice of the numbers from 0 to 1, as wide as its probability. Then pick a uniform random number u, one that is equally likely to land anywhere from 0 up to 1, and see whose slice it lands in. Running totals mark the slices' edges.

The picture. Step through it with u = 0.65. The picture draws the numbers from 0 to 1 as a line, with u as a ring on it. Each step jumps along the line by the next word's chance, from one running total to the next, so each jump spans that word's slice. Watch for the jump that carries the walk past u: its word is the sample.

Try it now

Then set the random number u to 0.1 and press Use these numbers: the ring lands in fire's slice. Try 0.9 too: tent's. Across many random u, each word is picked as often as its probability.

Symbols and formula. A distribution's probabilities sum to 1, and a range's probability sums its values':

∑xP(X=x)=1P(a≤X≤b)=∑a≤x≤bP(X=x)\sum_x P(X = x) = 1 \qquad P(a \le X \le b) = \sum_{a \le x \le b} P(X = x)

In plain words: add the bars in the range.

Continuous values. Some quantities, like a temperature, can take any value in a range. Then no single value has a chance of its own; instead a density curve is drawn, and probability is the area under it over a range, lesson 84's integral. The total area is 1, just as the bars add to 1.

Quick check
In the table above, what is P(2 ≤ X ≤ 3)?
  1. 0.3
  2. 0.45
  3. 0.5
  4. 0.15
Show the answer

0.45

Add the bars for 2 and 3: 0.3 + 0.15 = 0.45.

In your own words
In your own words: why does slicing [0, 1) by running totals make each value come up as often as its probability?

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

In Python: rng.choice, and a histogram

Purpose. Sample from a distribution in one call, and check it with counts.

import numpy as np

rng = np.random.default_rng(0)
p = np.array([0.5, 0.3, 0.15, 0.05])
for n in [20, 2000]:
    s = rng.choice(4, size=n, p=p)
    print(n, (np.bincount(s, minlength=4) / n).round(3).tolist())
It runs right here in your browser, with nothing to install.

rng.choice(4, size=n, p=p) draws n values from 0, 1, 2, 3 with the given probabilities. np.bincount counts how many times each value came up, and dividing by n turns counts into shares: a histogram. With 20 samples the shares are rough (value 3 might not appear at all); with 2,000 they're close to the bars.

Code flow. np.bincount does its counting out of sight. Here is the same counting as a loop you can step through: six samples with seed 0 (the first six of the twenty above), and a list counts with one tally box for each value, 0 to 3. Watch each sample add 1 to its own box: a histogram filling as samples arrive.

A named mistake: probabilities that don't add to 1. rng.choice refuses a p that doesn't sum to 1, with "probabilities do not sum to 1". Counts must be turned into shares first (lesson 88), and rounded probabilities can drift: 0.33 + 0.33 + 0.33 is 0.99. Divide by the sum to fix both.

Sampling words directly. rng.choice also accepts a list of words, returning words instead of positions, which is how the next part writes text.

Worked example

Worked example: a weighted die, 20 and 2,000 times

A die is weighted so that 6 comes up half the time and every other face 0.1. Sample it 20 and 2,000 times and compare the shares with the table.

import numpy as np

rng = np.random.default_rng(4)
p = np.array([0.1, 0.1, 0.1, 0.1, 0.1, 0.5])
faces = np.array([1, 2, 3, 4, 5, 6])
for n in [20, 2000]:
    s = rng.choice(faces, size=n, p=p)
    print(n, round(float(np.mean(s == 6)), 3), round(float(np.mean(s == 1)), 3))
print(p.sum())
In the lesson you can change this and run it.

With 20 rolls the share of sixes can easily land 0.15 away from 0.5; with 2,000 it's within about 0.02. The last line checks the table: its probabilities add to 1, as rng.choice requires. Small samples are noisy; large ones settle on the distribution, the law of large numbers (lesson 98).

Quick check
What does this print?
import numpy as np

s = np.array([0, 2, 1, 0, 0, 2])
print(np.bincount(s, minlength=3).tolist(), (np.bincount(s, minlength=3) / 6).round(2).tolist())
  1. [3, 1, 2] [3, 1, 2]
  2. [2, 1, 3] [0.33, 0.17, 0.5]
  3. [3, 1, 2] [0.5, 0.17, 0.33]
  4. [0, 2, 1] [0.0, 0.33, 0.17]
Show the answer

[3, 1, 2] [0.5, 0.17, 0.33]

Value 0 appears 3 times, 1 once and 2 twice. Divided by 6: 0.5, 0.17 and 0.33.

Drill

Counts into probabilities, then sample

The counts below don't add to 1, so rng.choice would refuse them. Fix probs so it does, then sample 5,000 values with seed 2 and set share2 to the share of 2s, rounded to 2 places.

import numpy as np

counts = np.array([6, 3, 1])
probs = counts
rng = np.random.default_rng(2)
share2 = 0
print(probs, share2)
In the lesson, your code is checked as you write it.
In your own words
Why do 20 samples rarely match the distribution's bars, while 2,000 usually do?

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

In AI and ML: generating text is sampling

Purpose. A language model writes by sampling, one word at a time.

At each step a model gives a distribution over the next word. Sampling picks a word with those odds; taking the argmax always picks the single most likely one:

wnext∼P(w∣context)orwnext=arg⁡max⁡wP(w∣context)w_{\text{next}} \sim P(w \mid \text{context}) \qquad \text{or} \qquad w_{\text{next}} = \arg\max_w P(w \mid \text{context})

In plain words: "∼" means "drawn from". argmax means "the one with the biggest probability".

import numpy as np

words = ["fire", "tent", "trail"]
p = [0.6, 0.2, 0.2]
rng = np.random.default_rng(3)
print(rng.choice(words, size=10, p=p).tolist())
print(words[int(np.argmax(p))])

Ten samples are mostly "fire" with some variety; argmax gives "fire" every time. That's why sampled text varies and argmax text repeats itself.

Quick check
A model always takes the argmax next word. What tends to happen to its writing?
  1. It becomes random, like rolling dice
  2. It stops after one word
  3. It uses rare words more often than it should
  4. It's predictable and can loop on the same phrases
Show the answer

It's predictable and can loop on the same phrases

Always taking the most likely word removes all variety, so the same context gives the same words, often repeating.

Slices, in code. rng.choice does with numbers what the flow did on the line. The running totals of the chances, which np.cumsum computes, are the slice boundaries: for chances 0.6, 0.3 and 0.1 they're 0.6, 0.9 and 1.0, so a uniform u below 0.6 picks the first word, a u from 0.6 up to 0.9 the second, and the rest the third. Each word wins as often as its slice is wide. np.argmax ignores the slices entirely: it returns the position of the biggest chance, the same answer every time, however close the runner-up. Predict both printouts first.

Quick check
What does this print?
import numpy as np

p = np.array([0.6, 0.3, 0.1])
print(int(np.argmax(p)), np.cumsum(p).round(2).tolist())
  1. 2 [0.6, 0.9, 1.0]
  2. 0 [0.6, 0.9, 1.0]
  3. 0.6 [0.6, 0.9, 1.0]
  4. 0 [0.6, 0.3, 0.1]
Show the answer

0 [0.6, 0.9, 1.0]

argmax gives the position of the biggest chance, 0; the running totals 0.6, 0.9 and 1.0 are the slice boundaries.

In PyTorch. The same calls on a tensor. torch.argmax and .cumsum(0) do what NumPy's argmax and cumsum did. torch.multinomial(p, n) draws n positions, each as often as its chance: PyTorch's rng.choice. replacement=True puts each drawn position back, so it can come up again.

import torch

p = torch.tensor([0.6, 0.3, 0.1])
print(torch.argmax(p).item(), p.cumsum(0))
draws = torch.multinomial(p, 10000, replacement=True)
print((torch.bincount(draws, minlength=3) / 10000).round(decimals=1))

The first line prints 0 and the slice edges 0.6, 0.9 and 1.0: the numbers the NumPy check above printed, now as a tensor. The second shares out 10,000 draws, rounded to one place: 0.6, 0.3 and 0.1, the chances themselves. A language model calls torch.multinomial(probs, 1) once for every word it writes.

Temperature and top-k. Real systems reshape the distribution before sampling. A model's last layer gives each word a score, and softmax turns scores into chances (lesson 104 builds it): it takes e to the power of each score, then shares the results out so they add to 1. The temperature T divides the scores first. Here the scores are the logs of the chances, and e to the log of a chance is the chance, so at T = 1 softmax gives the chances back:

import torch
import torch.nn.functional as F

p = torch.tensor([0.6, 0.3, 0.1])
scores = torch.log(p)
for T in [0.5, 1.0, 2.0]:
    print(T, F.softmax(scores / T, dim=0).round(decimals=2))
top = p.topk(2)
print(top.values, top.indices)

A low temperature sharpens the chances toward the argmax: at 0.5, the first word's 0.6 grows to 0.78. A high one flattens them toward even: at 2, it shrinks to 0.47. Top-k keeps only the k most likely words and shares their chances out again so they add to 1: p.topk(2) finds the two biggest chances, 0.6 and 0.3, at positions 0 and 1. Both change the widths of the slices before the draw; the draw itself stays the same. The sampler widget in the math part has both controls.

Quick check
At temperature 0.5, the chances 0.6, 0.3 and 0.1 became 0.78, 0.2 and 0.02. What happens to text sampled from them?
  1. Nothing changes: temperature acts on scores
  2. It varies more, closer to rolling a fair die
  3. The first word comes up more often, the third almost never
  4. It's the argmax word every time, never another
Show the answer

The first word comes up more often, the third almost never

Sharper chances mean the likely word wins more often: 78 draws in 100 instead of 60, and the third word only about 2. The text gets safer and more repetitive, still with a little variety.

Drill

Sample a few words

Using the next-word distribution below, set sampled to 8 words sampled with seed 11 (as a list), top to the argmax word, and share_top to the share of sampled that equals top.

import numpy as np

words = ["tent", "stove", "map", "rope"]
p = [0.4, 0.3, 0.2, 0.1]
sampled = []
top = ""
share_top = 0
print(sampled, top, share_top)
In the lesson, your code is checked as you write it.
In your own words
Why would you sample instead of always taking the most likely word?

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

Goes deeper in

Practice what you just read

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

Which of these is a valid probability distribution?

  1. 0.2, 0.5, 0.3
  2. 0.4, 0.4, 0.4
  3. 0.6, −0.1, 0.5
  4. 0.1, 0.2, 0.3

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