Index Ai Academy
Foundation · Vectors and matrices

Review: find the slip (vectors and matrices)

Shape slips to fix, mixed practice from the module, and its formula sheet with shapes.

About 36 minutes · Free lesson

What it covers6

Why it matters

Module 4's slips are mostly about shape. Multiplying cells where rows should meet columns, a weight matrix stored the other way around, row 2 read where column 2 was meant, a math index used as a Python one: each either stops with a shape error or, worse, runs and gives a confident wrong answer. The cure is the habit this review practices: write down the shape of every array, check that the shapes fit before you multiply, and test new code on a case small enough to work by hand. The module's formula sheet gets a shapes column for exactly this reason. With these slips under control, the calculus of Module 5 can lean on matrices without a second thought.

What you'll be able to do

  • Spot the common slips of Module 4: shapes that don't fit, * for @, a transposed operand, row and column swapped, and counting from 1
  • Find and fix slips in matrix code that runs but gives a wrong answer
  • Mix problems from every lesson of the module, and run a short NumPy program in your head, line by line
  • Use the module's formula sheet, with a shapes column: each formula, what it says, its shapes and its Python line, and see where Modules 1 to 4 sit in a model
Quick check
Have a guess before you start. A learner computes the dot product of (1, 2, 2) and (2, 1, 2) and gets [2 2 4]. What went wrong?
  1. The vectors have different lengths
  2. They used *, so the products weren't added
  3. Nothing: a dot product is a vector
  4. They added instead of multiplying
Show the answer

They used *, so the products weren't added

a * b gives the products 2, 2 and 4 without adding them. a @ b adds them up: 8.

Find the slip

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

  • * for @. * multiplies matching cells; @ pairs rows with columns and adds. Check: a dot product is one number, and A @ x has one entry per row of A.
  • Shapes that don't fit. (m × n)(n × p) needs the inner sizes to match. Check: write both shapes before multiplying.
  • A transposed operand. A weight matrix stored as (outputs, inputs) needs .T before X @ W. Check: the inner sizes tell you which way around it must be.
  • Row and column swapped. A[1] is a row; a column is A[:, 1]. Check: say "row first" aloud.
  • Counting from 1. The math's a₂₃ is A[1, 2]. Check: subtract 1 from both numbers.

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

Try it now

How the checks catch them. Each slip fails a one-line test. A dot product that prints as three numbers can't be a dot product. A 2 × 3 matrix has rows 0 and 1, so A[2, 3] runs off the edge. Writing the shapes (4, 25) and (3, 25) side by side shows the inner sizes clash. Saying "row first" turns A[1] into "row 2". And 1 × 4 − 2 × 2 = 0 rules out the inverse before anything is computed. The last two fail a small case worked by hand: a table of 2 rows has ids 0 and 1, and a pattern of 3 along a list of 3 fits exactly once, not 3 − 3 = 0 times. Predict the next one before you run it.

Quick check
What does this print?
import numpy as np

a = np.array([1, 2, 2])
b = np.array([2, 1, 2])
print((a * b).tolist(), a @ b)
  1. [2, 2, 4] 8
  2. [2, 2, 4] [2, 2, 4]
  3. 8 [2, 2, 4]
  4. 8 8
Show the answer

[2, 2, 4] 8

a * b keeps the three products; a @ b adds them into the dot product, 8.

Slips that hide in code. The dangerous slips are the ones that run. A * B on two square matrices of the same size gives an answer of the right shape. A cosine that divides by only one length still gives a number. A function that reads A[i, j] for the math's aᵢⱼ works on every test where the matrix happens to be big enough, and quietly reads the wrong entry. The two drills below are slips of exactly this kind, and a small case worked by hand exposes each.

Quick check
W has shape (10, 64) and X has shape (32, 64). Which product gives one row of 10 scores per example?
  1. X * W
  2. X @ W
  3. W @ X
  4. X @ W.T
Show the answer

X @ W.T

(32, 64) @ (64, 10) gives (32, 10): the inner 64s meet once W is transposed.

Drill

A similarity that's too big

This cosine runs, but the cosine similarity of (3, 4) with itself comes out as 5 instead of 1. Find the slip and fix it.

import numpy as np

def cosine(a, b):
    return (a @ b) / np.linalg.norm(a)

a = np.array([3.0, 4.0])
print(cosine(a, a), cosine(a, np.array([4.0, 3.0])))
In the lesson, your code is checked as you write it.
In your own words
Which known case would you use to check a cosine similarity function, and why?

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

Mixed practice

Purpose. Problems from across Module 4, mixed. Name each one's lesson before you start: norms, dot products, cosines, coordinates, matrix products, determinants, rank, shapes, lookups or sliding patterns. If one stops you, the steps show the way, and the formula sheet in the last part has every rule, with its shapes, in one place.

Play computer. The program below runs the module in small: a product with * and one with @, a column, an entry named the math's way, the shape of a product with a transpose, and a sum along an axis. Each line hides one of the slips from the first part. Work out every value in your head before you type it, the way Python would print it. .tolist() and .item() turn NumPy's answers into plain Python lists and numbers, so they print plainly.

Worked example

Worked example: print the shapes, find the slip

A layer's weights arrive stored one row per output. Print the shapes, see why X @ W can't work, and fix it.

import numpy as np

X = np.array([[1, 1], [2, 0], [0, 3], [1, 2]])
W_rows = np.array([[1, 0], [0, 1], [2, 1]])
print(X.shape, W_rows.shape)
print(X.shape[1] == W_rows.shape[0])
W = W_rows.T
Z = X @ W
print(W.shape, Z.shape)
print(Z.tolist())
It runs right here in your browser, with nothing to install.

X is (4, 2): four examples, two features. The weights are (3, 2): one row per output. Written side by side, (4, 2)(3, 2) has inner sizes 2 and 3, so X @ W_rows would stop with an error, and the check prints False. Transposing gives (2, 3), the inner 2s meet, and Z is (4, 3): one row of three scores per example. Printing shapes first turns a confusing error into an obvious fix.

Quick check
What does this print?
import numpy as np

A = np.array([[4, 9, 2],
              [3, 5, 7]])
print(A[1].tolist(), A[:, 1].tolist(), A[1, 2])
  1. [3, 5, 7] [9, 5] 7
  2. [9, 5] [3, 5, 7] 7
  3. [4, 9, 2] [4, 3] 9
  4. [3, 5, 7] [9, 5] 5
Show the answer

[3, 5, 7] [9, 5] 7

A[1] is the second row; A[:, 1] is the second column, read down; A[1, 2] is row 2, column 3 in the math's numbering: 7.

Quick check
Which line reads the math's entry a₃₁ of a NumPy matrix A?
  1. A[0, 2]
  2. A[2, 0]
  3. A[:, 3]
  4. A[3, 1]
Show the answer

A[2, 0]

Subtract 1 from both: row 3 is index 2, column 1 is index 0.

Drill

The wrong entry

This entry(A, i, j) should return the math's aᵢⱼ, counting rows and columns from 1. It runs on big matrices but reads the wrong entry. Find the slip and fix it.

import numpy as np

def entry(A, i, j):
    return A[i, j]

A = np.array([[6, 1, 8], [7, 5, 3], [2, 9, 4]])
print(entry(A, 1, 1), entry(A, 2, 3))
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 formula of Module 4 in one place, with what it says, the shapes it takes, and its Python line.

lessonformulain plain wordsshapesin Python
48a + b, caentry by entry(n,), (n,) → (n,)a + b, c * a
49‖v‖ = √(Σ vᵢ²)length(n,) → one numbernp.linalg.norm(v)
50a · b = Σ aᵢbᵢpairs multiplied, then added(n,), (n,) → one numbera @ b
51cos θ = a·b ÷ (‖a‖ ‖b‖)direction only(n,), (n,) → one number(a @ b) / (norm(a) * norm(b))
52cᵢ = v · qᵢ, so v = Σ cᵢqᵢamounts along perpendicular unit directions(n, n), (n,) → (n,)Q.T @ v
53aᵢⱼrow i, then column j(m, n)A[i - 1, j - 1]
54Aᵀrows become columns(m, n) → (n, m)A.T
55(Ax)ᵢ = Σⱼ Aᵢⱼxⱼeach row dotted with x(m, n), (n,) → (m,)A @ x
56(AB)ᵢⱼ = Σₖ AᵢₖBₖⱼrow i meets column j(m, n), (n, p) → (m, p)A @ B
Quick check
Which row of the sheet so far matches (5, 3) @ (3,), and what shape comes out?
  1. Lesson 56, A @ B: shape (5, 3)
  2. Lesson 54, A.T: shape (3, 5)
  3. Lesson 50, a @ b: one number
  4. Lesson 55, A @ x: shape (5,)
Show the answer

Lesson 55, A @ x: shape (5,)

A matrix times a vector: the 3s meet, and one number comes out per row, (5,).

The rest of the sheet, from determinants to tensors:

lessonformulain plain wordsshapesin Python
59det = ad − bcarea factor; 0 means no inverse(2, 2) → one numbernp.linalg.det(A)
60Ax = belimination, then back-substitution(n, n), (n,) → (n,)np.linalg.solve(A, b)
61rankindependent columns(m, n) → one numbernp.linalg.matrix_rank(A)
62Av = λvonly stretched(n, n) → n pairsnp.linalg.eig(A); np.linalg.eigh(A) if A is symmetric
63A = UΣVᵀpieces, biggest first(m, n) → three arraysnp.linalg.svd(A)
64sum along an axisthat axis disappears(m, n) → (n,) for axis 0X.sum(axis=0)
65eᵢE = row i of Ea one-hot row picks a row of the table(vocab, d), ids (n,) → (n, d)E[ids]
66yⱼ = w · (xⱼ, …, xⱼ₊ₖ₋₁)a pattern slid along, a dot product at each stop(n,), (k,) → (n − k + 1,)x[j:j + k] @ w

Each row's shapes column is also a check: if two shapes don't fit the pattern, the slip is in that step.

Quick check
Which row of the sheet says how many outputs a pattern of 5 numbers gives as it slides along a list of 12?
  1. Lesson 66: 12 − 5 = 7 outputs
  2. Lesson 65: 12 × 5 = 60 outputs
  3. Lesson 64: 12 + 5 = 17
  4. Lesson 66: 12 − 5 + 1 = 8 outputs
Show the answer

Lesson 66: 12 − 5 + 1 = 8 outputs

A sliding pattern is a convolution: (n,) with (k,) gives n − k + 1 outputs. The pattern can start at places 0 to 7, so 8 stops.

Where Modules 1 to 4 live in a model. Module 4 is the model's skeleton. Each input becomes numbers, then a vector, and a batch of them is a matrix, one row per example. A layer is X @ W + b: the matrix product with the bias broadcast to every row. Word ids become vectors by a lookup in an embedding table, and image layers slide a small pattern along, one dot product per stop. Attention hides later words with a triangular mask, one of the special matrices. On the way back, the norm of the gradient decides when to clip it, and each update is w − η·g, vector arithmetic. Rank and the SVD read the weights themselves, which is how low-rank updates fine-tune a big layer. Modules 1 and 2 had already lit the data, the activation, the chances, the targets, the loss, the split, the metrics and the memory. The map below lights all four modules together; what's still dark comes in Modules 5 to 7.

Coming up. First, lesson 68 and lesson 69 practice rearranging vector and matrix equations. Then Module 5's calculus asks how an output changes when its inputs change a little. For a model with many weights, the answer is a vector of rates, the gradient, the same shape as the weights. Training then moves the weights a small step against it: w ← w − η g, the vector update from lesson 48. Every shape habit from this review comes along: a gradient must have exactly the shape of the weights it updates, and @, .T and axis= appear on almost every line of a backward pass.

In your own words
Pick the row of 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 scores = X @ W when X is (100, 20) and W is (5, 20)?

  1. W needs transposing: X @ W.T
  2. X needs transposing
  3. It should be X * W
  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