Index Ai Academy
Foundation · Calculus

Rates of change

Change over change, secants, rates from readings with np.diff, and reading a loss curve.

About 41 minutes · Free lesson

What it covers6

Why it matters

Calculus is the math of change, and it starts with a question you already answer every day: how fast? A hiker covering 7 km in 2 hours averaged 3.5 km an hour. That number, change in one thing divided by change in another, is a rate, and this whole module is built on it. Shrink the interval and you get the slope at a single point, the derivative; follow the slope downhill and you get gradient descent, which is how every model in this academy is trained. This first lesson stays with the average rate: from tables, from graphs and from formulas, then in a few lines of NumPy, and finally on a real training run, where the rate of the loss says whether learning is still happening or has stalled.

What you'll be able to do

  • Compute an average rate of change, Δy/Δx, from a table, a graph or a formula
  • Read the average rate between two points as the slope of the line joining them
  • Turn a list of readings into a list of rates with np.diff, dividing by the step
  • Read a training run's loss curve: where it falls fastest, and where it has flattened
Quick check
Have a guess before you start. A hiker is 4 km along the trail after 1 hour and 10 km along after 3 hours. How fast did they walk, on average, between those times?
  1. 10 km an hour
  2. 6 km an hour
  3. 3 km an hour
  4. 3.3 km an hour
Show the answer

3 km an hour

They covered 10 − 4 = 6 km in 3 − 1 = 2 hours: 6 ÷ 2 = 3 km an hour.

The math: change over change

Purpose. Turn "how fast" into a number.

A rate of change compares how much an output changed with how much its input changed. Between two points (a, f(a)) and (b, f(b)):

ΔyΔx=f(b)−f(a)b−a\frac{\Delta y}{\Delta x} = \frac{f(b) - f(a)}{b - a}

In plain words: the change in y divided by the change in x. Δ ("delta") means "change in".

For f(x) = x² between x = 1 and x = 3: (9 − 1) ÷ (3 − 1) = 4. Over that stretch, y grows 4 times as fast as x, on average.

Quick check
From lesson 21: what is the slope of the line through (1, 1) and (3, 9)?
  1. 2
  2. 4
  3. 5
  4. 8
Show the answer

4

Rise over run: (9 − 1) ÷ (3 − 1) = 8 ÷ 2 = 4. The average rate of x² from 1 to 3 is exactly this slope.

Rates from a table. Readings taken at equal steps give a whole list of rates: subtract each reading from the next, then divide by the step. Here a hiker's distance is read every half hour: 0, 2.5, 4.5, 6 and 7 km. Watch the neighbors subtract, then divide by 0.5.

The picture. Each reading is a bar, labeled with its time in hours. A step lights two neighbors and shades the band between their tops: the band's height is the difference, written on the later bar. On the last step the bars become the rates themselves, one for each half hour.

Try it now

Then set the time between readings to 1 and press Use these numbers: the same differences, read as if the readings were an hour apart, give speeds half as big.

Symbols and formula. For readings y₀, y₁, … taken a step h apart:

ratei=yi+1−yih\text{rate}_i = \frac{y_{i+1} - y_i}{h}

In plain words: each neighbor minus the one before, divided by the step.

The slope of a secant. On a graph, the average rate between two points is the slope of the straight line, a secant, joining them. A steep secant means fast change; a flat one, slow change; one sloping down, a falling value. The hiker's speeds, 5, 4, 3 and 2 km an hour, say they slowed down steadily, which the curve of distance shows as a line bending flatter.

Quick check
A temperature reads 12, 15, 19, 22 and 23 degrees, every 2 hours. What is the fastest rate of warming?
  1. 1.5 degrees an hour
  2. 2 degrees an hour
  3. 4 degrees an hour
  4. 11 degrees an hour
Show the answer

2 degrees an hour

The differences are 3, 4, 3 and 1; divided by 2 hours, the rates are 1.5, 2, 1.5 and 0.5. The fastest is 2.

Differences of differences. Take the rates of a list of rates and you learn whether the change is speeding up or slowing down. For x² at x = 1, 2, 3, 4, 5 the values are 1, 4, 9, 16 and 25; the differences are 3, 5, 7 and 9, growing; and the differences of those are all 2. A constant second difference is the mark of a quadratic, just as a constant first difference is the mark of a straight line.

In your own words
In your own words: why must a difference be divided by its step to be a rate?

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

In Python: np.diff, then divide by the step

Purpose. Turn a whole list of readings into rates in two lines.

import numpy as np

d = np.array([0, 2.5, 4.5, 6, 7])
h = 0.5
print(np.diff(d).tolist())
print((np.diff(d) / h).tolist())
It runs right here in your browser, with nothing to install.

np.diff subtracts each value from the next, so a list of 5 readings gives 4 differences. Dividing by the step turns them into speeds in km per hour. The average rate across the whole walk is the total change over the total time, (7 − 0) ÷ 2 = 3.5, which is also the average of the four speeds when the steps are equal.

Code flow. Here is what those two lines do, written out as a loop on a plain list, with NumPy's answer at the end to compare. Step through it: i picks each pair of neighbors in turn, and rates grows by one box each pass, the same boxes as the flow's bottom row.

A named mistake: forgetting to divide by the step. The differences alone are only rates when the step is 1. With readings every 0.5 hours they're half the true speeds; with readings every 100 training steps they're 100 times too big. The two lines differ only by / h, which makes this an easy slip, and the result still looks plausible.

Second differences. Apply np.diff twice to see whether the rate itself is changing:

import numpy as np

v = np.array([1, 4, 9, 16, 25])
print(np.diff(v).tolist(), np.diff(np.diff(v)).tolist())
Worked example

Worked example: rates for three tables

Three sets of readings were taken with different steps. Compute each one's rates and its fastest change.

import numpy as np

tables = [(np.array([12, 15, 19, 22, 23]), 2),
          (np.array([3.0, 3.4, 4.0, 4.2]), 0.25),
          (np.array([0, 2.5, 4.5, 6, 7]), 0.5)]
for values, h in tables:
    rates = np.diff(values) / h
    print(np.round(rates, 4).tolist(), round(float(np.max(rates)), 4))
In the lesson you can change this and run it.

Each tuple holds the readings and their step, unpacked by the for line. The temperatures rise fastest, 2 degrees an hour, between readings 2 and 3. The second table rises fastest at 2.4 per second, in its middle step. The hike's fastest speed is its first, 5 km an hour. np.max picks the biggest rate; round and float tidy it for printing.

Quick check
What does this print?
import numpy as np

v = np.array([2, 5, 11, 20])
print(np.diff(v).tolist(), (np.diff(v) / 3).tolist())
  1. [3, 6, 9] [1.0, 2.0, 3.0]
  2. [5, 11, 20] [1.0, 2.0, 3.0]
  3. [3, 6, 9, 20] [1.0, 2.0, 3.0, 6.67]
  4. [3, 6, 9] [3, 6, 9]
Show the answer

[3, 6, 9] [1.0, 2.0, 3.0]

np.diff gives 5 − 2, 11 − 5 and 20 − 11. Dividing by the step of 3 gives the rates 1, 2 and 3.

Quick check
Readings are taken every 10 minutes and you want a rate per minute. Which line is right?
  1. np.diff(v)
  2. np.diff(v) / 10
  3. v / 10
  4. np.diff(v) * 10
Show the answer

np.diff(v) / 10

Each difference covers 10 minutes, so dividing by 10 gives the change per minute.

Drill

Rates from readings

Fix rates(values, h) so it returns the list of rates for readings taken a step h apart. Then set fast to the position of the fastest rate for the temperatures below.

import numpy as np

def rates(values, h):
    return np.diff(values)

temps = np.array([12, 15, 19, 22, 23])
fast = 0
print(rates(temps, 2), fast)
In the lesson, your code is checked as you write it.
In your own words
Why does a list of n readings give only n − 1 rates?

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

In AI and ML: is training still improving?

Purpose. Read a training run by the rate of its loss.

While a model trains, its loss, how wrong it is, is recorded every so often. The loss itself says how good the model is; its rate of change says whether training is still helping:

rate of loss=Llater−Learliersteps between\text{rate of loss} = \frac{L_{\text{later}} - L_{\text{earlier}}}{\text{steps between}}

In plain words: a big negative rate means the loss is falling fast; a rate near 0 means it has flattened.

import numpy as np

loss = np.array([2.0, 1.2, 0.8, 0.6, 0.55, 0.53, 0.52])
r = np.diff(loss) / 100
print(np.round(r, 6).tolist())
print(np.argmin(r), round(float(r[-1]), 6))

The loss was recorded every 100 steps. Its rate starts at −0.008 per step and shrinks to −0.0001: training improved fast at first and has nearly stopped. np.argmin gives the position of the most negative rate, the fastest fall: position 0, the first 100 steps.

Quick check
The loss rate over the last 1,000 steps is −0.00001 per step. What does that suggest?
  1. The model is getting worse
  2. Training is improving fast
  3. Training has flattened
  4. The learning rate must be 0
Show the answer

Training has flattened

A rate that close to 0 means the loss has almost stopped falling.

Reading the rate, not just the loss. Two runs can end at the same loss and still differ: one may have flattened long ago, the other still falling steadily. The rate tells them apart, which is why training dashboards plot both. Draw them yourself, the loss and its change over each 100 steps, on one set of axes:

import numpy as np
import matplotlib.pyplot as plt

steps = np.array([0, 100, 200, 300, 400, 500, 600])
loss = np.array([2.0, 1.2, 0.8, 0.6, 0.55, 0.53, 0.52])
plt.plot(steps, loss)
plt.plot(steps[1:], np.diff(loss))
plt.xlabel("training step")
plt.ylabel("loss (top), change per 100 steps (bottom)")
plt.show()

The lower line is np.diff(loss), each change drawn at the end of its 100 steps, so it starts at step 100. Divided by 100 it would be the rate per step: the same shape, squeezed toward 0.

Quick check
Read the plot. Where does the lower line, the change, come closest to 0?
  1. Nowhere: it stays the same height throughout
  2. In the middle, at step 300
  3. At the left end, where the loss is highest
  4. At the right end, where the loss has flattened
Show the answer

At the right end, where the loss has flattened

The change rises toward 0 as the loss curve flattens: by step 600 each 100 steps barely lower the loss. The steepest stretch of the loss, at the start, is where the change is most negative.

What people do with it. A flattened loss is the usual signal to stop training, or to lower the learning rate and squeeze out a little more. A loss whose rate turns positive, rising, is a warning: the steps may be too big (lesson 79). And a rate that bounces between negative and positive usually means the loss readings are noisy, so people smooth them first, with a moving average (lesson 27), before reading rates off them.

In PyTorch. A training run keeps its losses as it goes, often in a tensor, and torch.diff is np.diff for tensors:

import torch

loss = torch.tensor([2.0, 1.2, 0.8, 0.6, 0.55, 0.53, 0.52])
r = torch.diff(loss) / 100
print([round(v, 6) for v in r.tolist()])
print(torch.argmin(r).item(), round(r[-1].item(), 6))

The same rates as the NumPy cell, −0.008 down to −0.0001, and the same fastest fall, at position 0. .tolist() and .item() take plain Python numbers out of the tensor, and each is rounded to 6 places before printing, as in the NumPy cell.

Quick check
A loss is recorded every 50 steps. What does this print?
import numpy as np

loss = np.array([0.9, 0.7, 0.6, 0.58])
print(np.round(np.diff(loss) / 50, 4).tolist())
  1. [-0.2, -0.1, -0.02]
  2. [-0.004, -0.002, -0.0004]
  3. [0.004, 0.002, 0.0004]
  4. [-0.004, -0.002]
Show the answer

[-0.004, -0.002, -0.0004]

The differences −0.2, −0.1 and −0.02, divided by 50 steps: the fall slows as training goes on.

Drill

Where the loss falls fastest

The loss was recorded every 50 steps. Set r to its rates per step, fastest to the position of the fastest fall (the most negative rate), and flat to True if the last rate is closer to 0 than −0.001.

import numpy as np

loss = np.array([1.5, 1.1, 0.95, 0.9, 0.88, 0.875])
r = np.diff(loss)
fastest = 0
flat = False
print(r, fastest, flat)
In the lesson, your code is checked as you write it.
In your own words
A loss curve's rate is still clearly negative when training stops. What might you do, and why?

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 is the average rate of change of f(x) = 3x + 2 from x = 1 to x = 4?

  1. 3
  2. 9
  3. 14
  4. 4

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