Index Ai Academy
Foundation · Algebra

Sets, and reading the symbols

Sets, union and intersection, ℝⁿ and f : ℝⁿ → ℝᵐ, and reading a paper's first equation.

About 41 minutes · Free lesson

What it covers6

Why it matters

Written math has an alphabet of symbols, and most people stall at the first unfamiliar one. This lesson is a phrase book. It starts with sets, the idea of a collection, and the symbols for "is in", "both" and "either". Then it reads the shorthand that opens almost every machine learning paper: ℝⁿ for a list of numbers, f : ℝⁿ → ℝ for a model, and the hats, bars and subscripts you've already met. By the end you can read a paper's first equation aloud.

What you'll be able to do

  • Read set notation: ∈, ⊆, ∪, ∩ and ∅, and work out unions and intersections
  • Name the number sets ℕ, ℤ and ℝ, and read ℝⁿ as lists of n real numbers
  • Read a function's signature, f : ℝⁿ → ℝᵐ, and the marks ML uses: hats, bars, subscripts and Greek letters
  • Use Python's set, in, | and &, and describe a model's inputs and outputs as sets
  • Build a vocabulary as a sorted set and turn words into ids, and read x ∈ ℝᵈ as a tensor's shape
Quick check
Have a guess before you start. A = {cat, dog} and B = {dog, owl}. How many different animals are in A or B, or both?
  1. 2
  2. 1
  3. 3
  4. 4
Show the answer

3

cat, dog and owl. dog is in both, but a collection counts each thing once: 3.

The math: collections, and the symbols for them

Purpose. Learn the alphabet of written math, starting with collections.

A set is a collection of different things, written in curly brackets: {2, 4, 6}. Order doesn't matter, and nothing is counted twice. A few symbols do almost all the work:

  • ∈ means "is in": 4 ∈ {2, 4, 6}. ∉ means "isn't in".
  • ⊆ means "is a subset of": every member of the first is in the second. {2, 4} ⊆ {2, 4, 6}.
  • ∪, union, is everything in either set. ∩, intersection, is what's in both.
  • ∅ is the empty set, with nothing in it.
  • |A|, a set between bars, is its size: how many members it has. |{2, 4, 6}| = 3.
Quick check
From an earlier lesson: what does the subscript in x₃ mean?
  1. x raised to the power 3
  2. Three copies of x side by side
  3. The third item of x
  4. x multiplied by 3
Show the answer

The third item of x

A subscript names a position: x₃ is the third term of x. It's one of the marks this lesson reads.

Union and intersection, one item at a time. To find A ∩ B, go through A and keep each item that's also in B. To find A ∪ B, take all of A, then add each item of B that isn't already there. Watch it on two short sentences, each turned into the set of its words.

The picture is a Venn diagram: one circle for each sentence, overlapping in the middle, where the words in both go. Each step checks one word of A. If B has it too, the word moves into the overlap and B's copy goes, because a set holds each word once. A word that only A has stays on A's side. The last step lights every word in either circle, the union, and counts them.

Try it now

Then put a word from sentence A into sentence B and press Use these numbers: the intersection grows and the union stays the same size.

The number sets. Some sets of numbers have their own letters, written with a double stroke:

  • ℕ, the natural numbers: the counting numbers 1, 2, 3, … (some books include 0).
  • ℤ, the integers: whole numbers with their negatives, … −2, −1, 0, 1, 2, ….
  • ℝ, the real numbers: every point on the number line, decimals included.

So −3 ∈ ℤ but −3 ∉ ℕ, and 0.5 ∈ ℝ but 0.5 ∉ ℤ. Each set sits inside the next: ℕ ⊆ ℤ ⊆ ℝ.

Quick check
Which is true?
  1. −3 ∈ ℤ but −3 ∉ ℕ
  2. 0.5 ∈ ℤ
  3. −3 ∈ ℕ
  4. ℝ ⊆ ℕ
Show the answer

−3 ∈ ℤ but −3 ∉ ℕ

−3 is a whole number, so it's an integer, but it isn't a counting number.

Symbols and formula. Two pieces of shorthand open most ML papers:

x∈Rnf:Rn→Rmx \in \mathbb{R}^{n} \qquad f : \mathbb{R}^{n} \to \mathbb{R}^{m}

In plain words: "x is a list of n real numbers", and "f takes a list of n numbers and gives back a list of m."

ℝⁿ is the set of all lists of n real numbers, so a point in ℝ³ is three numbers, like (1.5, −2, 0). The arrow line is a function's signature: what goes in and what comes out.

The marks on letters. A hat, ŷ, marks a prediction or estimate. A bar, x̄, marks a mean. A subscript, xᵢ, names a position; a superscript, x², is a power. And Greek letters are ordinary names: θ for a model's weights, η for a learning rate, σ for a spread, μ for a mean.

Quick check
How do you read f : ℝ² → ℝ out loud?
  1. f takes one number and gives two
  2. f is the square of a real number
  3. f takes two numbers and gives one number
  4. f is two times a real number
Show the answer

f takes two numbers and gives one number

The left of the arrow is what goes in, ℝ², a pair of numbers. The right is what comes out, ℝ, one number. For example, f(x, y) = x + y.

In your own words
In your own words: what's the difference between A ∪ B and A ∩ B?

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

In Python: set, in, | and &

Purpose. Python has sets built in, with the same operations as the math.

A = {"cat", "dog"}
B = {"dog", "owl"}
print(len(A | B), sorted(A | B), sorted(A & B))
print("cat" in A, "owl" in A)
It runs right here in your browser, with nothing to install.

| is union and & is intersection; in is ∈. A set prints in no particular order, so sorted turns it into a list in alphabetical order for printing. len counts the members.

Code flow. & does the math part's sweep in one character. Here is the same sweep written out, on the two sentences from the flow: go through a and keep each word that's also in b. in works on a list too, where it checks every item. Step through and watch both collect the words that moved into the overlap. The last two lines build the union and count it.

Turning a list into a set removes repeats, which is how a vocabulary is found:

words = ["a", "big", "a", "cat", "big", "a"]
vocab = set(words)
print(len(words), len(vocab), sorted(vocab))

A named mistake: {} is not an empty set. In Python, {} makes an empty dictionary, a different kind of collection. An empty set is written set(). And a set has no positions, so vocab[0] is an error: to get members in order, use sorted(vocab), which gives a list.

Difference, and subsets. A - B keeps what's in A but not B, and <= asks whether one set is a subset of another: {2, 4} <= {2, 4, 6} is True. Every math symbol in this lesson has a one-character Python partner, which makes sets a handy way to check a hand calculation.

Worked example

Worked example: two vocabularies

Two short documents. Find each one's vocabulary, the words they share, and the combined vocabulary.

doc1 = ["the", "cat", "sat", "on", "the", "mat"]
doc2 = ["the", "dog", "sat", "on", "the", "log"]
v1 = set(doc1)
v2 = set(doc2)
print(len(v1), len(v2), len(v1 | v2))
print(sorted(v1 & v2))
In the lesson you can change this and run it.

Each document has 6 words but only 5 different ones, because "the" appears twice. Together they have 7 different words: the union counts the shared ones once. The intersection, the words both use, is on, sat and the. A language model's vocabulary is built the same way, as the union of the words (or word pieces) across all of its training text.

Quick check
What does this print?
s1 = {1, 2, 3}
s2 = {2, 3, 4, 5}
print(len(s1 | s2), len(s1 & s2), 4 in s1)
  1. 5 2 True
  2. 5 3 False
  3. 7 2 False
  4. 5 2 False
Show the answer

5 2 False

The union is {1, 2, 3, 4, 5}: 5. The intersection is {2, 3}: 2. And 4 isn't in s1.

Quick check
Which line makes an empty set in Python?
  1. s = ∅
  2. s = {}
  3. s = []
  4. s = set()
Show the answer

s = set()

set() is an empty set. {} is an empty dictionary, and [] an empty list.

Drill

Shared and combined words

Fix the code so shared is the set of words in both lists, combined the number of different words in either, and has_hat whether "hat" is in the first list's set.

w1 = ["a", "cat", "and", "a", "hat"]
w2 = ["a", "bat", "and", "a", "cat"]
s1 = set(w1)
s2 = set(w2)
shared = s1 | s2
combined = len(w1) + len(w2)
has_hat = "hat" == s1
print(sorted(shared), combined, has_hat)
In the lesson, your code is checked as you write it.
In your own words
Why does turning a list into a set change its length sometimes?

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

In AI and ML: reading a paper's first equation

Purpose. Most papers state their setup in this lesson's symbols. Reading them is now just translation.

Here is how the setup of a paper reads, piece by piece:

  • A vocabulary is a set. V = {all the tokens a model knows}, and |V|, the size of V, might be 50,000.
  • An input is a point in ℝⁿ. A trail sign drawn on a 5 by 5 grid is 25 brightness values: x ∈ ℝ²⁵.
  • A model is a function between them. A classifier that sorts signs into three kinds (arrow, tent and water) is f : ℝ²⁵ → ℝ³: 25 numbers in, three scores out, one per kind.
  • Weights are a set of numbers too. θ ∈ ℝᵈ says the model has d adjustable numbers.
fθ:R25→R3,y^=fθ(x)f_\theta : \mathbb{R}^{25} \to \mathbb{R}^{3}, \qquad \hat{y} = f_\theta(x)

In plain words: a function with weights θ takes 25 numbers and gives 3; its output for an input x is the prediction ŷ.

Quick check
A paper says its model is f : ℝ⁷⁸⁴ → ℝ¹⁰. What does it take in and give out?
  1. One number between 10 and 784
  2. 784 times 10 numbers
  3. 784 numbers in, 10 numbers out
  4. 10 numbers in, 784 out
Show the answer

784 numbers in, 10 numbers out

Left of the arrow is the input: a list of 784 numbers, like a 28 × 28 image. Right is the output: 10 numbers, like a score for each digit 0 to 9.

Translating a whole line. Here's a typical sentence from a paper, translated piece by piece. "Given a dataset {(xᵢ, yᵢ)}, i = 1 to n, with xᵢ ∈ ℝᵈ and yᵢ ∈ {0, 1}, we learn f_θ : ℝᵈ → [0, 1]." It says: there are n examples; each input is d numbers; each answer is 0 or 1; and the model takes d numbers and gives a score between 0 and 1. The square brackets [0, 1] are a range with both ends included, the interval from lesson 18. Nothing in it is new.

Quick check
What does this print?
labels = ["arrow", "tent", "arrow", "water", "arrow"]
print(len(labels), len(set(labels)), "arrow" in set(labels))
  1. 5 3 False
  2. 5 5 True
  3. 3 5 True
  4. 5 3 True
Show the answer

5 3 True

There are 5 labels in the list, but only 3 different kinds: arrow, tent and water. And arrow is one of them.

Words to ids. A model can't compute with words, only with numbers. So before it reads any text, each word in its vocabulary gets a number of its own, its id. One simple way: sort the vocabulary, a set, into a list, and use each word's position in the list as its id. Here is a line of the camp log, turned into ids:

log = ["the", "tent", "is", "up", "the", "fire", "is", "lit"]
vocab = sorted(set(log))
print(len(log), len(vocab), vocab)
ids = []
for w in log:
    ids.append(vocab.index(w))
print(ids)

vocab.index(w) gives the position of w in the list: its id. In this lesson's symbols, V = {fire, is, lit, tent, the, up} and |V| = 6, so every id is a whole number from 0 to 5. The 8 words of the log become 8 numbers, and a word that repeats keeps its id: both copies of "the" are 4. Sorting matters here: a set has no order of its own, so sorting gives the same ids on every run. Real models split text into word pieces, with a |V| near 50,000, and fix each piece's id once, when the vocabulary is built. Lesson 47 then gives each id a list of numbers of its own, an embedding.

In the real tools. A paper's "x ∈ ℝ²⁵" becomes a line real code can check. A tensor's .shape lists how many numbers it holds along each direction. Here is a trail sign flattened to 25 numbers (all zeros, standing in for its brightness values):

Drill

A model's sets, in code

A sign reader takes 5 × 5 pictures and sorts them into the kinds in kinds. Set n_in to its input size n (for ℝⁿ), n_out to its output size (one score per kind), and n_seen to how many different kinds have turned up in labels_seen so far. Careful: not every kind has turned up yet.

kinds = ["arrow", "tent", "water"]
labels_seen = ["arrow", "arrow", "tent", "arrow", "tent", "arrow"]
n_in = 5 + 5
n_out = 1
n_seen = len(labels_seen)
print(n_in, n_out, n_seen)
In the lesson, your code is checked as you write it.
In your own words
Translate f_θ : ℝ²⁵ → ℝ³ into a plain sentence about the sign reader.

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

Goes deeper in

  • Reading math: the notation of ML papers, symbol by symbol.
  • Sets: Python's sets in more depth.

Practice what you just read

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

Try a quiz question

A = {1, 2, 3, 4} and B = {3, 4, 5}. What is A ∩ B?

  1. {3, 4}
  2. {1, 2, 3, 4, 5}
  3. {1, 2}
  4. {5}

Answer it at the end of the lesson to see if you're right, and why.

Before this lesson

Keep learning

Where this lesson leads.

575 lessons in thirteen phases. 176 are free without an account, and a free account opens the rest. See every lesson.

Foundation · about 96 hours of study

Foundation math

From whole numbers to the math inside a neural network: each idea by hand, in Python, and in AI 118 lessons All free
  1. Numbers and place value FreeWhat a digit's place is worth, the number line, and Python as a calculator that never tires.36 min
  2. Multiplying and dividing: groups FreeEqual groups, quotient and remainder, and cutting training data into batches.35 min
  3. Order of operations, and names for numbers FreeBrackets, powers, then multiply and divide, then add and subtract; variables hold numbers.36 min
  4. Numbers below zero FreeThe number line through zero, sign rules, distance from zero, and an error's direction and size.37 min
  5. Fractions: equal parts, equal fractions, adding FreePieces of a whole, equal fractions, and re-cutting to add; accuracy as a fraction.45 min
  6. Multiplying and dividing fractions FreeA share of a share, dividing by flipping, and why chances in a row get small.35 min
  7. Decimals and rounding FreeFractions in place value, rounding, and why 0.1 + 0.2 isn't exactly 0.3.36 min
  8. Percentages FreePer hundred, percent change, percentage points, and the accuracy and error rates of models.35 min
  9. Ratios, rates and proportion FreeSharing in a ratio, rates per unit, scaling, and splitting data 80/10/10.35 min
  10. Powers and roots FreeRepeated multiplying, the laws of exponents, square roots, and squared error.43 min
  11. Very big and very small numbers FreePowers of ten, e-notation like 3e-4, orders of magnitude, and a model's size in memory.36 min
  12. Bits, bytes and floats: how numbers are stored FreeBase 2, what n bits can hold, a float as sign, power and digits, and a tensor's memory.35 min
  13. Review: find the slip (numbers) FreeBroken calculations to fix, mixed practice from the whole module, and its formula sheet.34 min
  14. Letters for numbers FreeVariables, terms and like terms, substitution, and a model's formula as a Python function.41 min
  15. Expanding and factoring FreeBrackets as areas, pulling out common factors, and a squared error expanded into a bowl.41 min
  16. Solving equations: keep the balance FreeThe same move on both sides, undoing steps in reverse, and running a model's formula backward.41 min
  17. Rearranging a formula FreeMaking any letter the subject, round-trip checks, and planning a training run.36 min
  18. Inequalities and true-or-false FreeRanges, flipping the sign, if and elif, and the thresholds, clips and ReLU inside a model.42 min
  19. Functions: a rule from input to output Freef(x) notation, tables and graphs, domain and range, loops over lists, and loss as a function.42 min
  20. Chaining and undoing functions Freeg(f(x)), inverses that undo, scaling and unscaling, and a network as a chain.42 min
  21. Straight lines: slope and intercept FreeRise over run, the line through two points, and a model's weight and bias as slope and intercept.42 min
  22. Two equations, two unknowns FreeSubstitution and elimination, where lines cross, and why models are fitted, not solved.42 min
  23. Quadratics: bowls and their lowest point FreeRoots by factoring and by formula, the discriminant, the vertex, and the best weight of a model.42 min
  24. Exponentials: growth and decay FreeThe same factor each step, the number e, and decaying learning rates.43 min
  25. Logarithms: the power question FreeTo what power?, the laws of logs, and adding log-probabilities instead of multiplying.45 min
  26. Sequences and Σ FreeArithmetic and geometric sequences, Σ as a loop that adds, and mean squared error.40 min
  27. Weighted and moving averages FreeWeights that add to 1, a window average, the exponential moving average, and smoothing a loss curve.35 min
  28. Sets, and reading the symbols FreeSets, union and intersection, ℝⁿ and f : ℝⁿ → ℝᵐ, and reading a paper's first equation.41 min
  29. Review: find the slip (algebra) FreeBroken algebra and code to fix, mixed practice from the whole module, and its formula sheet.34 min
  30. Transposing step by step: undo in reverse order FreeA formula's layers, the opposite of each, peeling from the outside in, conditions, and round-trip checks.35 min
  31. Formulas with fractions: clear them first FreeClearing denominators, cross-multiplying, a letter in the bottom, and reciprocal formulas like 1/R = 1/R₁ + 1/R₂.35 min
  32. When the letter appears twice: collect and factor FreeGathering the letter on one side, factoring it out, dividing by the bracket, and rearranging precision and F1.35 min
  33. Squares, roots and powers FreeSquare roots with ±, squaring to undo a root, cube and nth roots, and the √d inside attention.40 min
  34. When the letter is squared and plain: quadratics FreeRearranging into ax² + bx + c = 0, the formula, completing the square, and choosing the root that fits.35 min
  35. Letters in the power: exponentials and logarithms FreeTaking logs to bring a power down, exponentiating to free a letter, and the logit that undoes the sigmoid.40 min
  36. Rearranging inequalities: when the sign flips FreeThe four moves on an inequality, negatives and reciprocals that flip it, logs below 1, and sample sizes.35 min
  37. Inverse functions, lines and scaling FreeUndoing a function by making x the subject, domains that allow it, line forms, and unscaling predictions.40 min
  38. Sequences and sums: find n, a, d and r FreeEvery letter of the arithmetic and geometric formulas as the subject, and an average's window from its decay.40 min
  39. Combining formulas: substitute and eliminate FreePutting one formula inside another to remove a letter, and sizing a training run from a time or money budget.35 min
  40. Review: rearrange anything (algebra) FreeBroken rearrangements to fix, mixed practice from the whole algebra block, a strategy chart, and its formula sheet.35 min
  41. Coordinates and distance FreePoints as (x, y), Pythagoras, distance in any number of coordinates, and nearest neighbors.42 min
  42. Angles, degrees and radians FreeMeasuring a turn, converting units, arcs, and the angle between two arrows.36 min
  43. Sine and cosine FreeAcross and up: right triangles, the unit circle, and directions and rotations.42 min
  44. Waves: height, speed and shift FreeAmplitude, period and phase, sampling a wave, and position codes in transformers.37 min
  45. Review: find the slip (shapes and waves) FreeBroken geometry and code to fix, mixed practice from the module, and its formula sheet.29 min
  46. Angles, triangles and waves: rearranging with sin, cos and tan FreeSides and angles from SOH CAH TOA, principal values, arcs, polar coordinates, and a wave's time and period.45 min
  47. Vectors: lists of numbers that point FreeA list, a point and an arrow; components, dimension, NumPy arrays, and data as vectors.42 min
  48. Adding and scaling vectors FreeComponent-wise sums, scalar multiples, mixes, and the weight update w − ηg.43 min
  49. Length and distance: norms FreeL2, L1 and max norms, unit vectors, distance, and the norms inside losses and clipping.42 min
  50. The dot product FreeMultiply in pairs and add; a·a as squared length; a @ b; one neuron as a dot product.43 min
  51. Angle, cosine similarity and projection FreeDirection without length, perpendicular vectors, shadows, and search by meaning.45 min
  52. Perpendicular directions: bases and coordinates FreeOrthonormal directions, coordinates as dot products, rebuilding a vector, and taking a direction out.35 min
  53. Matrices: tables of numbers FreeRows, columns and entries; two-dimensional arrays and slices; a data set as a matrix.41 min
  54. Adding, scaling and transposing matrices FreeEntry-by-entry sums and scalings, the transpose, mean images, and tables turned around.36 min
  55. A matrix times a vector FreeEach row dotted with the vector, the size rule, A @ x, and a layer acting on one example.42 min
  56. Matrix multiplication FreeRow meets column, the size rule, order matters, and a batch through a layer: X W + b.45 min
  57. Identity, diagonal, triangular and symmetric FreeFour patterns and their jobs: rescaling, distance tables, and the causal mask.37 min
  58. Matrices as movements of space FreeStretches, flips, shears and rotations; columns as landing spots; chaining; a layer moving data.42 min
  59. Determinant and inverse FreeThe area factor ad − bc, singular matrices, undoing a matrix, and redundant features.42 min
  60. Solving systems by elimination FreeAugmented matrices, row moves, back-substitution, the three outcomes, and fitting weights.45 min
  61. Independence, span and rank FreeRedundant vectors, span, rank, outer products, and low-rank updates like LoRA.42 min
  62. Eigenvectors: directions that only stretch FreeAv = λv, checking candidates, np.linalg.eig, and the main direction of a data cloud.41 min
  63. SVD and PCA: the important directions first FreeA matrix as pieces by size, the best rank-k copy, compression, and PCA maps of data.45 min
  64. Tensors, shapes and broadcasting FreeAxes and shapes, reshape, axis=, broadcasting, and shapes through a small model.43 min
  65. One-hot vectors and lookup tables: embeddings FreeA one-hot row picks a table's row, a sentence looked up as vectors, and a score for every word.35 min
  66. Sliding dot products: convolution FreeA small pattern slid along a list and over a grid, output sizes, stride and padding, and shared weights.40 min
  67. Review: find the slip (vectors and matrices) FreeShape slips to fix, mixed practice from the module, and its formula sheet with shapes.36 min
  68. Vector equations: rearranging with arrows FreeSolving for a vector or a scale, recovering a gradient from two weight snapshots, and an angle from a dot product.40 min
  69. Matrix equations: multiply by the inverse, on the correct side FreeNo dividing by a matrix: inverses from the left or right, order, transposes, and the normal equations.40 min
  70. Rates of change FreeChange over change, secants, rates from readings with np.diff, and reading a loss curve.41 min
  71. Limits: what a value heads toward FreeApproaching from both sides, holes, corners and jumps, epsilon, and judging activations.37 min
  72. The derivative: slope at a point FreeShrinking secants, f′(x) and dy/dx, Δy ≈ f′Δx, and which way a weight should move.45 min
  73. Derivative rules FreeConstants, powers, multiples, sums, eˣ and ln x, checked numerically, and a squared error's slope.41 min
  74. The product rule and the chain rule FreeProducts and chains of functions, forward then backward, and one neuron's dL/dw.45 min
  75. Lowest points and curvature Freef′ = 0, the second-derivative test, tables, local and global minima, and convex losses.43 min
  76. Standing in for a curve near a point FreeTangent lines, a curvature term, growing error, and why learning rates must be small.37 min
  77. Partial derivatives FreeOne input at a time, ∂, nudging in Python, and the two slopes of a line's loss.41 min
  78. The gradient FreeAll the slopes as a vector, steepest climb and descent, a numerical gradient, and the loss gradient.42 min
  79. Gradient descent FreeStepping against the gradient, the learning rate, a training loop, and fitting a line.45 min
  80. Faster descent: momentum and Adam FreeMomentum and Adam by hand, the bias correction, and three optimizers down one narrow valley.40 min
  81. The chain rule with many paths: backpropagation by hand FreeGraphs, multiply along paths and add across them, gradient checks, and a 2-2-1 network by hand.45 min
  82. Automatic differentiation: how PyTorch finds every slope FreeA tape of steps walked backward, and requires_grad, backward(), .grad, zero_grad() and no_grad().40 min
  83. Jacobians and Hessians FreeSlopes of vector functions, a layer's Jacobian, second partials, and bowls, domes and saddles.42 min
  84. Integrals: adding up thin slices FreeStrip and trapezoid sums, summing undoes differencing, probability as area, and AUC.43 min
  85. Review: find the slip (calculus) FreeCalculus slips to fix, mixed practice from the module, and its formula sheet.36 min
  86. Rearranging in calculus: slopes, steps and constants FreeSetting a slope to zero, Newton's step, the chain rule turned around, constants from a point, and learning rates.45 min
  87. Counting: choices, orders and groups FreeThe counting principle, factorials, ordered picks and groups, and why attention's cost grows with the square of the length.43 min
  88. Probability: from counts to chances FreeEqually likely outcomes, the complement, distributions, seeded simulation, and a next-word model.43 min
  89. Combining events: and, or, independent FreeThe or rule, independence, probability trees, drawing with and without replacement, and chains of steps.42 min
  90. Conditional probability and Bayes' rule FreeConditionals from tables, why P(A | B) isn't P(B | A), Bayes' rule, and precision and recall.45 min
  91. Random variables and distributions FreeUncertain numbers, the probability of a range, sampling by slices, and sampling versus argmax.42 min
  92. Expected value, variance and standard deviation FreeProbability-weighted averages, spread in the data's own units, and a training loss as an expected value.42 min
  93. Bernoulli, binomial, uniform and normal FreeYes-or-no trials, counts of yeses, the 68-95-99.7 rule, z-scores, and an accuracy's error bar.45 min
  94. Two variables at once: covariance and correlation FreeJoint tables and marginals, covariance, correlation, the covariance matrix, and features that carry the same information.45 min
  95. Review: find the slip (probability) FreeProbability slips to fix, mixed practice from the module, and its formula sheet.36 min
  96. Probability formulas: solve for the missing chance FreeConditionals, Bayes' rule for the prior, the or rule, expected values, variance, and z-scores turned around.45 min
  97. Describing data: center, spread and scale FreeMean, median and mode, variance and standard deviation, percentiles, outliers, and standardizing features.42 min
  98. Samples, the law of large numbers and the central limit theorem FreeSamples and populations, the standard error σ/√n, the bell of averages, and error bars on test scores.43 min
  99. Is the difference real? Comparing two models FreePaired differences, a bootstrap interval, what a p-value is and isn't, and why many tries make lucky wins.40 min
  100. Maximum likelihood FreeLikelihoods as products, log-likelihoods as sums, grid search, underflow, and the negative log-likelihood loss.45 min
  101. Linear regression: the best line FreeResiduals, least squares by formula, three roads to one line, the matrix form, and train versus test error.45 min
  102. Logistic regression: a line that answers yes or no FreeThe sigmoid, the log loss, its slope p − y, a training loop, and choosing a threshold.45 min
  103. Scoring a classifier: confusion table, precision, recall, F1 FreeThe four cells, accuracy, precision, recall and F1, and what moving a threshold does to each.35 min
  104. Softmax: scores into probabilities FreeExponentiate and share out, shifting and temperature, the safe softmax, and a classifier's last step.43 min
  105. Surprise, entropy and cross-entropy FreeSurprise in bits, entropy, cross-entropy and KL divergence, perplexity, and a language model's loss.45 min
  106. KL divergence: how far one distribution is from another FreeKL by hand, cross-entropy as entropy plus KL, why it isn't symmetric, and a soft-target loss.35 min
  107. Review: find the slip (statistics and information) FreeStatistics slips to fix, mixed practice from the module, and its formula sheet.38 min
  108. Statistics and information: n, z, logits and bits FreeSample sizes from error bars, inputs from probabilities, logit gaps from softmax, and chances from bits and losses.40 min
  109. One neuron, start to finish FreeWeighted sum, activation, loss, slopes and update, by hand and in code, and what one straight line can and can't split.45 min
  110. A layer and a small network as matrices FreeTwo layers on a batch, the shape of every matrix, adding a hidden unit, and XOR solved.45 min
  111. Training a small network FreeThe backward pass in matrix form, gradient checks, a full training loop, and reading loss curves.45 min
  112. The same network in PyTorch Freenn.Sequential with the NumPy weights loaded, the same loss and slopes, then SGD and mini-batches.45 min
  113. Attention as matrix math FreeScaled dot-product scores, the causal mask, a row-by-row softmax, and blending value vectors.45 min
  114. Residual connections and layer norm FreeAdding the input back and why its slope keeps learning alive, layer norm by hand, and add and norm.40 min
  115. A transformer block, start to finish FreeA sentence through embeddings, attention, add and norm, a small network and next-word scores, every shape named.45 min
  116. Planning a model: rearranging the formulas of a working network FreeLayer widths from parameter counts, sizes from memory and compute, the attention scale, and a training plan.40 min
  117. Final test: transpose any formula FreeSlips to fix from every topic, mixed practice of every kind of rearranging, the strategy chart and the full sheet.45 min
  118. Capstone: a sign reader from the formulas FreeBuild, train and test a trail-sign classifier with NumPy alone, and report its accuracy with an error bar.45 min
Part of a free course 118 lessons

The Foundation Math For Ai & ML: from arithmetic to attention

Learn the math behind AI from arithmetic up: numbers, algebra, vectors and matrices, calculus, probability and statistics, each shown as numbers moving and checked in Python, ending with a network you build and train from the formulas.

Never trained an AI? Teach a small one to write, right in your browser. It takes about 20 seconds and needs no account. Teach it to write