Index Ai Academy
Foundation · Statistics and information

Linear regression: the best line

Residuals, least squares by formula, three roads to one line, the matrix form, and train versus test error.

About 45 minutes · Free lesson

What it covers6

Why it matters

Linear regression is the simplest model that is trained, tested and used exactly the way large models are. It predicts a number from a number, tents from temperature, with a straight line, and "training" means choosing the line's slope and intercept from data. Nearly every idea of the last four modules meets here: the line from lesson 21, covariance and variance from lessons 94 and 97, gradient descent from lesson 79, solving equations from lesson 60, and the matrix product from lesson 56. They all arrive at the same line, which makes this lesson a good place to see that they're one subject. And the most important habit in machine learning starts here too: judging a model on data it has never seen, not on the data it was trained on, because the error on training data is almost always too flattering.

What you'll be able to do

  • Measure how well a line fits with residuals and the sum of their squares
  • Find the least-squares line by formula: w = cov(x, y)/var(x) and b = ȳ − w·x̄
  • Get the same line three ways in Python: the formula, gradient descent, and solving a small system
  • Fit on some days and judge on days held back, in the matrix form ŷ = Xw, and train the same line as a PyTorch layer with nn.Linear and optim.SGD
Quick check
Have a guess before you start. Five points don't lie on one line. What would "the best line" through them make as small as possible?
  1. The distance between the first and last point
  2. The total of the squared vertical misses
  3. The number of points it touches
  4. Its slope
Show the answer

The total of the squared vertical misses

Least squares measures each point's vertical miss, squares it, and adds them up; the best line has the smallest total.

The math: the line that misses the least

Purpose. Choose the slope and intercept that fit the points best.

Residuals. A line ŷ = wx + b predicts ŷ ("y hat") for each x. A point's residual is how far the line misses it: y − ŷ. Five days, with x the day and y the rentals: (1, 3), (2, 5), (3, 4), (4, 7), (5, 8). The line ŷ = 1.2x + 1.8 predicts 3, 4.2, 5.4, 6.6 and 7.8, so the residuals are 0, 0.8, −1.4, 0.4 and 0.2.

Squared residuals. Some residuals are positive and some negative, so, as with variance in lesson 97, they're squared before adding: 0 + 0.64 + 1.96 + 0.16 + 0.04 = 2.8. That total is the sum of squared residuals, and divided by the number of points it's the mean squared error, 0.56, lesson 79's loss. The least-squares line is the one with the smallest total, and 1.2x + 1.8 is it: no other line through these points gets below 2.8.

Quick check
From lesson 94: for x = (1, 2, 3, 4, 5) and y = (3, 5, 4, 7, 8), the covariance is 2.4 and the variance of x is 2. What sign does that say the best line's slope has?
  1. Zero
  2. Negative
  3. Positive: y tends to rise with x
  4. It can't be told without fitting
Show the answer

Positive: y tends to rise with x

The slope is cov(x, y) ÷ var(x), and a variance is never negative, so the slope takes the covariance's sign.

The formula. Setting the slopes of the squared-error loss to zero (lesson 77's partial derivatives, one for w and one for b) gives two short rules. Step through them for the five days.

The picture. The drawing builds the line the way the rules do. First the middle point, (x̄, ȳ), where dashed lines at the two means cross. Then a rectangle from the middle point out to each point: its area is that point's (x − x̄)(y − ȳ), the product the slope rule adds up. Then the line through the middle point, then where it crosses x = 0. Last, each miss grows into a square, and the squares' areas are what least squares makes as small as it can.

Try it now

Then set the y values to 3, 5, 4, 7, 12 and press Use these numbers: that one far point tilts the whole line toward it, because a miss counts by its square.

Symbols and formula. The same rules in lesson 94's words:

w=cov(x,y)var(x)b=yˉ−w xˉR2=1−∑(yi−y^i)2∑(yi−yˉ)2w = \frac{\text{cov}(x, y)}{\text{var}(x)} \qquad b = \bar{y} - w\,\bar{x} \qquad R^2 = 1 - \frac{\sum (y_i - \hat{y}_i)^2}{\sum (y_i - \bar{y})^2}

In plain words: the slope is how much x and y move together, per unit of x's own spread; the line passes through the middle point; and R² is the share of y's spread the line explains.

For the five days, cov = 2.4 and var = 2, so w = 1.2, and b = 5.4 − 1.2 × 3 = 1.8. How good is the fit? The spread of y around its own mean adds to 17.2; the line leaves 2.8 of it, so R² = 1 − 2.8/17.2 = 0.84: the line explains 84% of the ups and downs. R² = 1 is a perfect fit; R² = 0 is no better than always guessing the mean.

Try to beat it. The chart below has points of its own, with each miss drawn from the point to the line. Move the slope and the intercept to make the mean squared error as small as you can, then press Best fit and compare.

Quick check
A line's predictions for three points miss by 1, −2 and 1. What is the sum of squared residuals?
  1. 2
  2. 6
  3. 4
  4. 0
Show the answer

6

1 + 4 + 1 = 6. The plain residuals add to 0, which is exactly why they're squared first.

In your own words
In your own words: why are residuals squared before adding, rather than just added?

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

In Python: three roads to one line

Purpose. Get the same line by formula, by gradient descent and by solving a system, so each checks the others.

import numpy as np

x = np.array([1.0, 2.0, 3.0, 4.0, 5.0])
y = np.array([3.0, 5.0, 4.0, 7.0, 8.0])

dx = x - x.mean()
w = np.sum(dx * (y - y.mean())) / np.sum(dx ** 2)
b = y.mean() - w * x.mean()
print("formula:", round(w, 4), round(b, 4))

wg, bg = 0.0, 0.0
for step in range(2000):
    e = wg * x + bg - y
    wg = wg - 0.05 * 2 * np.mean(e * x)
    bg = bg - 0.05 * 2 * np.mean(e)
print("descent:", round(wg, 4), round(bg, 4))

A = np.array([[np.sum(x ** 2), np.sum(x)], [np.sum(x), 5.0]])
r = np.array([np.sum(x * y), np.sum(y)])
print("solve:", np.linalg.solve(A, r).round(4).tolist())
It runs right here in your browser, with nothing to install.

All three print 1.2 and 1.8. The formula is quickest; descent is lesson 79's loop and works for any loss; the system is the two equations "both slopes are 0" written out, which lesson 60 solved by elimination.

Code flow. Step through two of the roads one line at a time: the formula, then the system. dx and dy are the math part's centered columns, the same rows of boxes as its flow. A and r hold the system's two equations as a grid and a column, and np.linalg.solve gives back w and b in one call. The third road, descent, is the loop in the cell above: 2,000 passes, too many to step through.

The line in a plot. Draw the five days and the line the roads found. plt.plot(x, y, "o") draws each point as a dot without joining them, and the second plt.plot draws the line through the five predictions.

import numpy as np
import matplotlib.pyplot as plt

x = np.array([1.0, 2.0, 3.0, 4.0, 5.0])
y = np.array([3.0, 5.0, 4.0, 7.0, 8.0])
plt.plot(x, y, "o")
plt.plot(x, 1.2 * x + 1.8)
plt.xlabel("day")
plt.ylabel("rentals")
plt.show()
Quick check
Read the plot. Which day's dot sits furthest from the line?
  1. Day 1: it's the lowest dot
  2. Day 5: it's the highest dot
  3. Day 3: 4 rented, and the line says 5.4
  4. Day 2: 5 rented, and the line says 4.2
Show the answer

Day 3: 4 rented, and the line says 5.4

Day 3's dot is 1.4 below the line, the biggest miss of the five. Squared, that's 1.96 of the 2.8 total: more than the other four days together.

A named mistake: judging a model on its own training data. A line fitted to some points always looks good on those points: it was chosen to. With enough freedom, say a wiggly curve with as many settings as points, the training error can reach 0 while predictions for new x's are wild. The honest test is on points the fit never saw. Keep some data back before fitting, fit on the rest, and report the error on the held-back part.

Worked example

Worked example: the matrix form ŷ = Xw

Put a column of ones next to x, so one matrix product makes every prediction, and let NumPy find the best w and b.

import numpy as np

x = np.array([1.0, 2.0, 3.0, 4.0, 5.0])
y = np.array([3.0, 5.0, 4.0, 7.0, 8.0])
X = np.column_stack([x, np.ones(5)])
wb = np.linalg.lstsq(X, y, rcond=None)[0]
pred = X @ wb
print(wb.round(4).tolist())
print(pred.round(2).tolist(), round(float(np.sum((y - pred) ** 2)), 2))
In the lesson you can change this and run it.

Each row of X is one day: [x, 1]. The product X @ [w, b] gives w·x + b for every row at once, lesson 55's matrix times a vector. The column of ones is what carries the intercept: it multiplies b by 1 in every row. np.linalg.lstsq finds the w and b with the smallest sum of squared residuals, 1.2 and 1.8 again, with residual total 2.8. With more features, X just gets more columns, and the same line of code fits a plane or more.

Quick check
What does this print?
import numpy as np

x = np.array([1.0, 2.0, 3.0, 4.0, 5.0])
y = np.array([3.0, 5.0, 4.0, 7.0, 8.0])
pred = 1.2 * x + 1.8
print((y - pred).round(2).tolist(), round(float(np.sum((y - pred) ** 2)), 2))
  1. [0.0, 0.8, -1.4, 0.4, 0.2] 2.8
  2. [0.0, -0.8, 1.4, -0.4, -0.2] 2.8
  3. [3.0, 4.2, 5.4, 6.6, 7.8] 2.8
  4. [0.0, 0.8, -1.4, 0.4, 0.2] 0.0
Show the answer

[0.0, 0.8, -1.4, 0.4, 0.2] 2.8

The residuals are y − ŷ; they add to 0, but their squares add to 2.8.

Drill

Fit, predict, report

Write fit(x, y) that returns the least-squares w and b by the formula. Then set w and b for the five days, pred6 to the prediction for day 6, and mse to the mean squared error on the five days, each rounded to 4 places.

import numpy as np

def fit(x, y):
    w = 0.0
    b = y.mean()
    return w, b

x = np.array([1.0, 2.0, 3.0, 4.0, 5.0])
y = np.array([3.0, 5.0, 4.0, 7.0, 8.0])
w, b = fit(x, y)
pred6 = 0
mse = 0
print(w, b, pred6, mse)
In the lesson, your code is checked as you write it.
In your own words
Gradient descent needed 2,000 steps to reach a line the formula gives in one line. Why learn descent at all?

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

In AI and ML: train, then test on days held back

Purpose. Use the line the way every model is used: fit on some data, judge on other data.

Twelve days of temperature and rentals. Eight are used for fitting: temperatures 14, 16, 18, 20, 22, 24, 26 and 28 with rentals 15, 19, 26, 30, 33, 41, 44 and 51. Four are held back: 17, 21, 25 and 29 degrees, with 24, 30, 41 and 50 rentals. Fit the line on the eight training days by the formula, then measure its mean squared error on each set:

import numpy as np

t_train = np.array([14.0, 16.0, 18.0, 20.0, 22.0, 24.0, 26.0, 28.0])
r_train = np.array([15.0, 19.0, 26.0, 30.0, 33.0, 41.0, 44.0, 51.0])
t_test = np.array([17.0, 21.0, 25.0, 29.0])
r_test = np.array([24.0, 30.0, 41.0, 50.0])
dt = t_train - t_train.mean()
w = np.sum(dt * (r_train - r_train.mean())) / np.sum(dt ** 2)
b = r_train.mean() - w * t_train.mean()
print(round(w, 2), round(b, 2))
print(round(np.mean((w * t_train + b - r_train) ** 2), 2), round(np.mean((w * t_test + b - r_test) ** 2), 2))

The line is ŷ = 2.53t − 20.75: each extra degree brings about two and a half more tents. On the eight training days its mean squared error is 1.09; on the four held-back days it's 4.44. A higher error on new days is normal: the line was chosen to fit the training days, so it partly fits their noise, and the test days have noise of their own. With only four of them the number is rough, but it is the honest estimate of how the model will do tomorrow. A line has just two settings, so it can't chase the noise far. A model with many settings can push its training error toward 0 while its test error climbs: it has learned the particular days, not the pattern. That is overfitting, and the fix is a simpler model or more data.

Quick check
A model has training error 0.1 and test error 9.5. What does that suggest?
  1. The test data must be wrong
  2. It needs more training steps to bring the test error down
  3. It overfits: it learned the noise, not the pattern
  4. It's an excellent model
Show the answer

It overfits: it learned the noise, not the pattern

A test error far above the training error means the fit doesn't carry over to new data.

In PyTorch. In the real tool, a line is a layer with one input and one output, nn.Linear(1, 1): its weight is w and its bias is b. torch.optim.SGD is the descent loop from the Python part, written once for any model. Each pass computes the loss, clears the old slopes with zero_grad(), finds new ones with backward() and steps downhill with step() (lesson 79). Trained on the five days from the math part, the layer starts from random numbers:

import torch
import torch.nn as nn

x = torch.tensor([[1.0], [2.0], [3.0], [4.0], [5.0]])
y = torch.tensor([[3.0], [5.0], [4.0], [7.0], [8.0]])
model = nn.Linear(1, 1)
opt = torch.optim.SGD(model.parameters(), lr=0.05)
for step in range(1000):
    loss = ((model(x) - y) ** 2).mean()
    opt.zero_grad()
    loss.backward()
    opt.step()
print(round(model.weight.item(), 4), round(model.bias.item(), 4), round(loss.item(), 4))

It ends on 1.2 and 1.8, the w and b the formula printed in the Python part's first cell, with a loss of 0.56, the math part's mean squared error. Every model PyTorch trains goes through this same loop. A classic model like this one doesn't need it: scikit-learn, the library for classic models, fits the line in one call.

Quick check
What does this print?
import numpy as np

w, b = 2.53, -20.75
t = np.array([17.0, 29.0])
print((w * t + b).round(2).tolist())
  1. [43.01, 73.37]
  2. [22.26, 73.37]
  3. [22.26, 52.62]
  4. [24.0, 50.0]
Show the answer

[22.26, 52.62]

The trained line predicts 2.53 × 17 − 20.75 = 22.26 tents at 17 degrees and 52.62 at 29. The days held back had 24 and 50.

The same judgment in matrix form. The Python part's worked example wrote the line as ŷ = Xw, with a column of ones in X to carry b. That product, inputs times weights plus a bias, is what every layer of a network computes, up to a transformer's last one. So judge the line that way too: one X for the training days, one for the held-back days, and one w for both.

Drill

Train error and test error, in matrix form

The starter fits wb on the training days in matrix form, but its X_test has the wrong second column: fix it. Then set train_mse and test_mse to the mean squared error of X @ wb on each set, and gap to test_mse − train_mse, each rounded to 2 places.

import numpy as np

t_train = np.array([14.0, 16.0, 18.0, 20.0, 22.0, 24.0, 26.0, 28.0])
r_train = np.array([15.0, 19.0, 26.0, 30.0, 33.0, 41.0, 44.0, 51.0])
t_test = np.array([17.0, 21.0, 25.0, 29.0])
r_test = np.array([24.0, 30.0, 41.0, 50.0])
X_train = np.column_stack([t_train, np.ones(8)])
X_test = np.column_stack([t_test, np.zeros(4)])
wb = np.linalg.lstsq(X_train, r_train, rcond=None)[0]
train_mse = 0
test_mse = 0
gap = 0
print(wb.round(2).tolist(), train_mse, test_mse, gap)
In the lesson, your code is checked as you write it.
In your own words
Why must the test days be kept out of the fitting, even though using them would give the line more data?

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

Goes deeper in

Practice what you just read

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

Try a quiz question

What does least squares minimize?

  1. The sum of squared vertical misses
  2. The sum of the plain residuals
  3. The largest single miss
  4. The slope

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