Index Ai Academy
Foundation · Probability

Two variables at once: covariance and correlation

Joint tables and marginals, covariance, correlation, the covariance matrix, and features that carry the same information.

About 45 minutes · Free lesson

What it covers6

Why it matters

So far every random variable has stood alone. Real data comes in pairs and more: temperature and rentals, height and weight, two pixels of the same picture. The question is whether they move together, and how strongly. Covariance measures it in the data's units; correlation rescales it to a number from −1 to 1 that's easy to read. In ML this tells you which features carry the same information, which ones a model can do without, and it ties back to two earlier lessons: the covariance matrix whose eigenvectors gave PCA's directions (lessons 62 and 63), and correlation, which turns out to be exactly lesson 51's cosine similarity, applied to centered data.

What you'll be able to do

  • Read a joint table, get each variable's own distribution (the marginals) by summing, and test independence
  • Compute covariance by centering, multiplying pair by pair and averaging, and correlation from −1 to 1
  • Build a covariance matrix as XᵀX/n on centered data, and check it against np.cov and torch.cov
  • Find features that carry the same information, and see that correlation is the cosine of centered data
Quick check
Have a guess before you start. On hotter days the tent shop rents more tents. What sign would their covariance have?
  1. It can't be known
  2. Positive: they rise together
  3. Negative
  4. Zero
Show the answer

Positive: they rise together

When one is above its average the other tends to be too, so their centered products are mostly positive.

The math: moving together

Purpose. Do two quantities move together?

A joint table counts two things at once. 100 days, by weather and by rentals:

blankhigh rentalslow rentals
sunny3010
rainy1545

The marginals are each variable on its own: sum each row for weather (40 sunny, 60 rainy) and each column for rentals (45 high, 55 low). If weather and rentals were independent, P(sunny and high) would equal P(sunny) × P(high) = 0.4 × 0.45 = 0.18. It's actually 0.30, so they're not independent: sun goes with high rentals.

Quick check
From lesson 92: what is the variance of the values 1, 2, 3, 4, each equally likely?
  1. 2.5
  2. 1.25
  3. 1.118
  4. 5
Show the answer

1.25

The mean is 2.5; squared distances 2.25, 0.25, 0.25, 2.25 average to 1.25. Covariance is the same idea with two variables.

Covariance. Center each variable (subtract its mean), multiply the pairs, and average. Picture the points on a scatter plot with a cross drawn through the two means. Points in the top-right and bottom-left quarters, above both means or below both, give positive products; points in the other two quarters give negative ones. If most points fall in the first pair of quarters, the average is positive and the variables rise together; if they're spread evenly among all four, the products cancel toward 0. The picture draws exactly that for four days: the points, the dashed cross through the two means, and for each pair a rectangle from the cross to its point. Its sides are the pair's centered values and its area is their product, so points far from both means, with the biggest rectangles, count most.

Try it now

Then set y values to 9, 5, 4, 2 and press Use these numbers: the points move into the − quarters (one sits on a dashed line), and the covariance turns negative.

Symbols and formula. Covariance has awkward units (degrees times tents). Dividing by both standard deviations gives the correlation r, always between −1 and 1:

cov(x,y)=1n∑i(xi−xˉ)(yi−yˉ)r=cov(x,y)σx σy\text{cov}(x, y) = \frac{1}{n}\sum_i (x_i - \bar{x})(y_i - \bar{y}) \qquad r = \frac{\text{cov}(x, y)}{\sigma_x\,\sigma_y}

In plain words: r = 1 is a perfect rising line, −1 a perfect falling line, 0 no straight-line link.

For the four pairs: cov = 2.75, σₓ = √1.25 ≈ 1.118 and σᵧ = √6.5 ≈ 2.55, so r = 2.75 ÷ (1.118 × 2.55) ≈ 0.965: strongly rising together. Correlation is not cause. Ice-cream sales and sunburns correlate because both follow the sun; neither causes the other.

Quick check
x = (1, 2, 3, 4) and y = (8, 6, 4, 2). What is their correlation?
  1. 0
  2. −1
  3. 1
  4. −0.5
Show the answer

−1

y falls by exactly 2 for every step up in x: a perfect falling line, r = −1.

The covariance matrix. Every pair of variables has a covariance, and a variable paired with itself gives its variance: centering x and multiplying it by itself squares the distances. Written as a table, one row and one column per variable, x and y need four entries. Press Next to see which entry is which.

In your own words
In your own words: why does a correlation always land between −1 and 1, while a covariance can be any size?

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

In Python: center, multiply, average

Purpose. Compute covariance by hand-written lines, then the whole covariance matrix at once.

import numpy as np

x = np.array([1.0, 2.0, 3.0, 4.0])
y = np.array([2.0, 4.0, 5.0, 9.0])
dx = x - x.mean()
dy = y - y.mean()
cov = np.mean(dx * dy)
r = cov / (x.std() * y.std())
print(cov, round(float(r), 3), round(float(np.corrcoef(x, y)[0, 1]), 3))
print(np.cov(x, y, bias=True).tolist())

np.corrcoef returns a table of correlations; entry [0, 1] is between x and y, and it matches the hand-written r. np.cov returns the covariance matrix from the math part's picture, 1.25 and 6.5 on the diagonal and 2.75 off it (bias=True is explained below). With many features, center a data matrix X (one row per example) and Xᵀ X / n gives every covariance at once (lesson 62 found PCA's directions in this matrix).

Code flow. Step through center, multiply, average one line at a time. The arrays show as rows of boxes, the same boxes as the flow in the math part: dx and dy are the centered columns, products their pairs multiplied.

A named mistake: n or n − 1. np.cov divides by n − 1 unless told bias=True, which divides by n. Both are used: n − 1 corrects a small bias when estimating from a sample (lesson 97). They differ noticeably only for small samples, but mixing them makes hand checks fail. Here, everything divides by n, so the check uses bias=True.

import numpy as np

X = np.array([[20, 30], [25, 45], [30, 60], [22, 40], [28, 55]], dtype=float)
Xc = X - X.mean(axis=0)
C = Xc.T @ Xc / 5
print(C.round(2).tolist(), np.allclose(C, np.cov(X.T, bias=True)), np.allclose(C, np.cov(X.T)))

Dividing by n, 5 here, matches np.cov with bias=True (True) and not its default (False).

Worked example

Worked example: a 2 × 2 covariance matrix by hand-written lines

Build the covariance matrix of temperature and rentals entry by entry, and check it against np.cov.

import numpy as np

t = np.array([20.0, 25.0, 30.0, 22.0, 28.0])
r = np.array([30.0, 45.0, 60.0, 40.0, 55.0])
tc = t - t.mean()
rc = r - r.mean()
C = np.array([[np.mean(tc * tc), np.mean(tc * rc)],
              [np.mean(rc * tc), np.mean(rc * rc)]])
print(C.round(2).tolist())
print(np.allclose(C, np.cov(np.array([t, r]), bias=True)))
print(round(float(C[0, 1] / (C[0, 0] ** 0.5 * C[1, 1] ** 0.5)), 3))
In the lesson you can change this and run it.

The diagonal holds each variable's variance, 13.6 and 114; the off-diagonal entries are the covariance, 39, twice, since cov(t, r) = cov(r, t): the matrix is symmetric (lesson 57). Dividing the covariance by the two standard deviations, the roots of the diagonal, gives r = 0.99: on these days, temperature and rentals rise almost in lockstep.

Quick check
What does this print?
import numpy as np

a = np.array([1.0, 2.0, 3.0])
b = np.array([2.0, 2.0, 2.0])
print(np.mean((a - a.mean()) * (b - b.mean())))
  1. 0.0
  2. 2.0
  3. 1.0
  4. 6.0
Show the answer

0.0

b never changes, so every centered b is 0, and so is every product: no covariance with a constant.

Plot it. Centering moves the cross of the means to (0, 0), so the four quarters become the plot's own. Draw the five tent days centered, with the cross as two dashed lines:

import numpy as np
import matplotlib.pyplot as plt
t = np.array([20, 25, 30, 22, 28])
r = np.array([30, 45, 60, 40, 55])
plt.plot(t - t.mean(), r - r.mean(), "o")
plt.plot([-6, 6], [0, 0], "--")
plt.plot([0, 0], [-20, 20], "--")
plt.xlabel("temperature, centered")
plt.ylabel("rentals, centered")
plt.show()
Quick check
Read the plot. How many of the five days sit in the top-right or bottom-left quarter?
  1. 5
  2. 4
  3. 3
  4. 2
Show the answer

4

Two days sit up and right, two down and left, and the 25-degree day is exactly on the upright dashed line: its centered temperature is 0, so its product is 0. Four positive products and one 0 give the positive covariance, 39.

Units change covariance, not correlation. Measure temperature in Fahrenheit instead of Celsius and every value is multiplied by 1.8 and shifted by 32. The shift vanishes when the data is centered, and the 1.8 multiplies both the covariance and σₓ, so it cancels in r. The covariance itself grows by the same factor 1.8, which is why covariances of differently measured variables can't be compared and correlations can. A negative stretch flips r's sign and nothing else. One limit is worth knowing early: r measures straight-line links only. Values that rise and then fall, like y = x² for x from −2 to 2, have r = 0 even though x settles y completely.

Quick check
What does this print?
import numpy as np

c = np.array([10.0, 15.0, 20.0, 25.0])
r = np.array([30.0, 45.0, 40.0, 60.0])
f = c * 1.8 + 32
print(round(float(np.corrcoef(c, r)[0, 1]), 3), round(float(np.corrcoef(f, r)[0, 1]), 3))
  1. 0.878 1.58
  2. 0.878 0.878
  3. 0.878 0.488
  4. 1.0 1.0
Show the answer

0.878 0.878

Changing units stretches and shifts c, and r ignores both: 0.878 either way. The covariance grows 1.8 times; r doesn't.

Drill

Correlation by hand

Fix corr(x, y) so it divides the covariance by both standard deviations. Then set r1 for the pairs below, rounded to 3 places, and same to whether it matches np.corrcoef to 3 places.

import numpy as np

def corr(x, y):
    dx = x - x.mean()
    dy = y - y.mean()
    return np.mean(dx * dy)

x = np.array([2.0, 4.0, 6.0, 8.0])
y = np.array([1.0, 3.0, 2.0, 6.0])
r1 = round(float(corr(x, y)), 3)
same = False
print(r1, same)
In the lesson, your code is checked as you write it.
In your own words
Why is a covariance matrix always symmetric?

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

In AI and ML: features that carry the same information

Purpose. Spot redundant features, and see correlation as cosine similarity.

Correlation is lesson 51's cosine similarity, applied to centered data:

r=xc⋅yc∥xc∥ ∥yc∥r = \frac{\mathbf{x}_c \cdot \mathbf{y}_c}{\lVert \mathbf{x}_c \rVert \, \lVert \mathbf{y}_c \rVert}

In plain words: center both columns, then take the cosine of the angle between them.

import numpy as np

t = np.array([20.0, 25.0, 30.0, 22.0, 28.0])
r = np.array([30.0, 45.0, 60.0, 40.0, 55.0])
tc = t - t.mean()
rc = r - r.mean()
print(round(float(tc @ rc / (np.linalg.norm(tc) * np.linalg.norm(rc))), 3))

0.99, the same as before. A feature almost perfectly correlated with another adds almost nothing new: it's nearly a rescaled copy, the redundancy lessons 59 and 61 warned about.

In PyTorch. torch.cov and torch.corrcoef take one row per variable, like their NumPy namesakes, so torch.stack stacks the two columns as rows. correction=0 divides by n, like bias=True in np.cov.

import torch

t = torch.tensor([20.0, 25.0, 30.0, 22.0, 28.0])
r = torch.tensor([30.0, 45.0, 60.0, 40.0, 55.0])
X = torch.stack([t, r])
print(torch.cov(X, correction=0))
print(round(torch.corrcoef(X)[0, 1].item(), 3))

The matrix is the one the worked example built by hand, 13.6 and 114 on the diagonal and 39 off it, and entry [0, 1] of the correlations is 0.99, the number the NumPy cell above printed as a cosine.

Quick check
Two pixels in a set of pictures always have the same value. What is their correlation, and what does it mean for a model?
  1. r = 1: one of them is redundant
  2. r can't be computed for pixels
  3. r = 0: they're unrelated
  4. r = −1: they cancel
Show the answer

r = 1: one of them is redundant

Identical columns line up perfectly: r = 1. Keeping both adds no information.

What to do with redundant features. A table of correlations, one entry for every pair of features, is usually one of the first things to look at in a new data set. Pairs near 1 or −1 point to features that say the same thing twice. Keeping both rarely breaks anything, but it can make a linear model's weights unstable: with two nearly identical columns, many ways of splitting the weight between them fit equally well, lesson 61's dependent columns again. The usual fixes are to drop one of the pair, or to combine them, which is what PCA does in a principled way (lesson 63). Pairs near 0 are the opposite case: each feature carries a straight-line signal the other doesn't, so both are worth keeping.

Drill

The most and least correlated features

Four features (temperature, rentals, humidity, wind) are the columns of X. Set R to their correlation table with np.corrcoef, then strongest and weakest to the pairs (i, j), with i < j, whose correlations are biggest and smallest in size.

import numpy as np

X = np.array([[20, 30, 70, 6], [25, 45, 60, 8], [30, 60, 50, 5], [22, 40, 65, 4], [28, 55, 55, 7]], dtype=float)
R = np.zeros((4, 4))
strongest = (0, 0)
weakest = (0, 0)
print(strongest, weakest)
In the lesson, your code is checked as you write it.
In your own words
Temperature and humidity have r ≈ −0.997 in this data. Should a model keep both? What might you check first?

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

Goes deeper in

Practice what you just read

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

What does a correlation of −0.9 between two features say?

  1. As one rises the other falls, almost every time
  2. They're unrelated
  3. One of the two causes the other to fall
  4. They rise together

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