Index Ai Academy
Foundation · Calculus

Integrals: adding up thin slices

Strip and trapezoid sums, summing undoes differencing, probability as area, and AUC.

About 43 minutes · Free lesson

What it covers6

Why it matters

The derivative asked how fast something changes. The integral asks the reverse: given a rate, what's the total? A car's speed over an hour adds up to the distance it covered; a curve's heights, added over a stretch, give the area underneath. The method is the same idea as everything else in this module: cut the problem into thin slices, each easy, and add them up, with thinner slices giving a better answer. In ML, area turns up in two important places: the probability of a continuous value landing in a range is an area under a curve, and one of the most common scores for a classifier, the AUC, is literally an area under a curve.

What you'll be able to do

  • Estimate the area under a curve by cutting it into thin strips and adding them up
  • Use trapezoids for a better estimate, and watch the answer settle as the strips get thinner
  • Write a trapezoid sum in Python, plot the trapezoids' tops against the curve, and see that adding up differences undoes taking them
  • Find a probability as an area under a bell curve, and an AUC score as an area under a ROC curve, in NumPy and with torch.trapezoid
Quick check
Have a guess before you start. A cyclist rides at 12 km/h for half an hour, then 20 km/h for half an hour. How far did they go?
  1. 20 km
  2. 16 km
  3. 8 km
  4. 32 km
Show the answer

16 km

12 × 0.5 + 20 × 0.5 = 6 + 10 = 16 km: each speed times its time, added up. That's an integral in miniature.

The math: strips, added up

Purpose. A total from a rate, an area from a curve.

To find the area under f between x = a and x = b, cut the stretch into n strips of width Δx = (b − a)/n. Each strip is close to a rectangle, height f(x) and width Δx. Add them up:

area≈∑if(xi) Δx\text{area} \approx \sum_{i} f(x_i)\,\Delta x

In plain words: height times width for each thin strip, all added. It's lesson 26's Σ again.

For x² from 0 to 2 with 4 strips, using each strip's left edge for the height: 0.5 × (0 + 0.25 + 1 + 2.25) = 1.75. The true area is 8/3 ≈ 2.667, so left edges underestimate a rising curve.

Quick check
From lesson 26: what is Σ i for i = 1 to 4?
  1. 10
  2. 4
  3. 24
  4. 16
Show the answer

10

1 + 2 + 3 + 4 = 10. An integral's strip sum is the same kind of Σ, adding heights times widths.

Trapezoids. Using the average of each strip's two edges as its height turns each rectangle into a trapezoid, which follows the curve much better. Step through x² from 0 to 2 with 4 trapezoids.

The picture. The drawing starts with the 4 strips as plain rectangles, each as tall as its left edge: the 1.75 from above. Each step lays a trapezoid over one strip, its slanted top joining the curve at both edges, and writes its area. Watch how much closer a slanted top follows the curve than a flat one. The PyTorch tab adds every strip at once.

Try it now

Then set the strips to 8: the total moves from 2.75 toward the true 2.667, and with 12 it moves closer still.

Symbols and formula. As the strips get thinner, the sum settles on one number, the integral:

∫abf(x) dx=lim⁡n→∞∑if(xi) Δx\int_a^b f(x)\,dx = \lim_{n \to \infty} \sum_{i} f(x_i)\,\Delta x

In plain words: the ∫ is a stretched S for "sum", and dx is a strip's width shrunk toward zero.

For x² from 0 to 2: 4 strips give 2.75, 8 give 2.6875, and the limit is 8/3. Summing undoes differencing: if you take a list's differences (lesson 70) and add them back up, you recover how far the list has come from its start. That's the deep link between the two halves of calculus: a rate, summed, gives back the total change.

Quick check
A speed is 0, 2, 4, 4 and 3 km/h, read every half hour. Using trapezoids, about how far was traveled?
  1. 6.5 km
  2. 4 km
  3. 5.75 km
  4. 13 km
Show the answer

5.75 km

0.5 × (0/2 + 2 + 4 + 4 + 3/2) = 0.5 × 11.5 = 5.75. Each end counts half, since it borders only one strip.

In your own words
In your own words: why do thinner strips give a better estimate of the area?

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

In Python: a trapezoid sum

Purpose. Add up strips in a line or two, for any curve you can evaluate.

Every interior point is the edge of two strips and counts fully; the two ends count half:

import numpy as np

def trapezoid(y, dx):
    return dx * (np.sum(y) - (y[0] + y[-1]) / 2)

for n in [2, 4, 8]:
    xs = np.linspace(0, 2, n + 1)
    print(n, trapezoid(xs ** 2, 2 / n))
It runs right here in your browser, with nothing to install.

y[-1] is the last value, counting from the end. The estimates, 3, 2.75 and 2.6875, close in on 8/3. NumPy has a built-in version, np.trapezoid (formerly np.trapz), that does the same.

Code flow. trapezoid adds every strip in one line. Here is the same sum one strip at a time, as the math part's flow did it. Step through it and watch strip take each trapezoid's area, and total grow by it: the flow's running totals.

Summing undoes differencing. np.cumsum gives a running total, so it reverses np.diff:

import numpy as np

v = np.array([2, 5, 9, 10])
d = np.diff(v)
print(d.tolist(), np.cumsum(d).tolist(), (v[0] + np.cumsum(d)).tolist())

Add the start back on and the original values return (all but the first, which the differences never knew). A named mistake: forgetting the width. Adding heights without multiplying by Δx gives a number that grows with the number of strips, instead of settling. If doubling n roughly doubles your "area", the width is missing.

Worked example

Worked example: three areas to two decimals

Estimate three areas by trapezoids, raising n until the answer stops changing in the second decimal.

import math
import numpy as np

def trapezoid(y, dx):
    return dx * (np.sum(y) - (y[0] + y[-1]) / 2)

def area(f, a, b, n):
    xs = np.linspace(a, b, n + 1)
    return trapezoid(f(xs), (b - a) / n)

for n in [4, 16, 64]:
    print(n, round(area(np.exp, 0, 1, n), 4), round(area(np.sqrt, 0, 4, n), 4), round(area(np.sin, 0, math.pi, n), 4))
In the lesson you can change this and run it.

eˣ from 0 to 1 settles near 1.7183 (e − 1); √x from 0 to 4 near 5.33 (16/3), slowest because √x is steep at 0; sin x from 0 to π near 2. Each column moves less as n grows, which is how you know the strips are thin enough: the answer has stopped changing at the precision you need.

Quick check
What does this print?
import numpy as np

y = np.array([1.0, 3.0, 5.0])
print(0.5 * (np.sum(y) - (y[0] + y[-1]) / 2))
  1. 3.0
  2. 6.0
  3. 2.5
  4. 4.5
Show the answer

3.0

0.5 × (9 − 3) = 3.0: two trapezoids of width 0.5 under a straight line, which is exact.

Why not just use rectangles? Left-edge rectangles miss a rising curve on every strip, always on the same side, so their errors pile up. Trapezoids follow the curve's slope across each strip, so most of that error disappears: for x² from 0 to 2 with 4 strips, rectangles are off by 0.92 and trapezoids by only 0.08. Better methods exist, but trapezoids are the everyday choice because they're simple and good.

Plot it. Draw the curve and the trapezoids' tops together. The second plt.plot joins the 5 edge points with straight lines, and "o-" marks each point with a dot:

import numpy as np
import matplotlib.pyplot as plt

xs = np.linspace(0, 2, 41)
edges = np.linspace(0, 2, 5)
plt.plot(xs, xs ** 2)
plt.plot(edges, edges ** 2, "o-")
plt.xlabel("x")
plt.ylabel("height")
plt.show()
Quick check
Read the plot. Between two dots, where does a trapezoid's straight top sit compared with the curve?
  1. A little above it, so the total comes out too big
  2. Far above it, by about 1 at every point
  3. Exactly on it, so the total is exact
  4. A little below it, so the total comes out too small
Show the answer

A little above it, so the total comes out too big

x² bends upward, so the straight line joining two of its points runs just above it. Every trapezoid is a little too tall, which is why 4 of them give 2.75 instead of 2.667.

Drill

A trapezoid area

Fix trapezoid so it counts the ends half and multiplies by the width. Then set a1 to the area under 3x² from 0 to 1 with 4 strips, rounded to 4 places.

import numpy as np

def trapezoid(y, dx):
    return np.sum(y)

xs = np.linspace(0, 1, 5)
a1 = round(trapezoid(3 * xs ** 2, 0.25), 4)
print(a1)
In the lesson, your code is checked as you write it.
In your own words
Why do the two end values count half in a trapezoid sum?

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

In AI and ML: probability and AUC are areas

Purpose. Two of ML's everyday numbers are areas under curves.

Probability as area. For a value that can be any number, like a height or a measurement error, chances come from a curve, a density: the probability of landing between a and b is the area under it there. For the standard bell curve (lesson 93), the share between −1 and 1 is about 0.683.

P(a≤X≤b)=∫abp(x) dxP(a \le X \le b) = \int_a^b p(x)\,dx

In plain words: probability is area under the density curve.

import math
import numpy as np

def bell(x):
    return np.exp(-x ** 2 / 2) / math.sqrt(2 * math.pi)

def trapezoid(y, dx):
    return dx * (np.sum(y) - (y[0] + y[-1]) / 2)

for n in [4, 20]:
    xs = np.linspace(-1, 1, n + 1)
    print(n, round(trapezoid(bell(xs), 2 / n), 4))

With 20 strips the estimate is 0.6823, close to the true 0.6827.

Quick check
A classifier's ROC curve passes through (0, 0), (0.1, 0.6), (0.3, 0.9) and (1, 1). What is its area by trapezoids?
  1. 0.5
  2. 2.5
  3. 0.845
  4. 1.0
Show the answer

0.845

0.1 × 0.3 + 0.2 × 0.75 + 0.7 × 0.95 = 0.03 + 0.15 + 0.665 = 0.845.

AUC. A classifier's ROC curve plots the share of true cases it catches against the share of false alarms, as its threshold slides. The area under that curve, the AUC, is one number for how well it separates the classes: 1.0 is perfect, 0.5 is guessing. Its points come at uneven spacing, so each strip has its own width: np.diff of the x-values gives them.

Try it on a model that scores 200 customers for whether they'll churn, that is, leave. The table counts what it gets right and wrong at your threshold, and the ROC curve beside it is every threshold at once, with its AUC.

Reading an AUC. An AUC of 0.9 means that if you pick one positive and one negative example at random, the classifier ranks the positive one higher 90% of the time. That's why it's popular: it doesn't depend on any one threshold, only on how well the scores separate the classes, which is exactly what a ranking asks for.

Quick check
A ROC curve passes through (0, 0), (0.25, 0.8) and (1, 1). What does this print?
import numpy as np

fpr = np.array([0.0, 0.25, 1.0])
tpr = np.array([0.0, 0.8, 1.0])
print(round(float(np.sum(np.diff(fpr) * (tpr[1:] + tpr[:-1]) / 2)), 4))
  1. 0.9
  2. 0.5
  3. 0.775
  4. 1.8
Show the answer

0.775

0.25 × 0.4 + 0.75 × 0.9 = 0.1 + 0.675 = 0.775.

In PyTorch. torch.trapezoid(y, x) takes the heights first and their x-values second, so it finds every strip's width itself, even and uneven alike:

import math
import torch

fpr = torch.tensor([0.0, 0.25, 1.0])
tpr = torch.tensor([0.0, 0.8, 1.0])
print(round(torch.trapezoid(tpr, fpr).item(), 4))

xs = torch.linspace(-1, 1, 21, dtype=torch.float64)
bell = torch.exp(-xs ** 2 / 2) / math.sqrt(2 * math.pi)
print(round(torch.trapezoid(bell, xs).item(), 4))

Both match the NumPy cells: 0.775 for the ROC curve in the check above, and 0.6823 for the bell curve with 20 strips. torch.linspace(-1, 1, 21) gives the same 21 edges as np.linspace, and dtype=torch.float64 keeps NumPy's precision. Handing over the x-values, never one width, is what lets the same call do both.

Drill

The area under a ROC curve

Set widths to the strip widths of the false-alarm rates, heights to the average catch rate of each strip, and auc to their sum of products, rounded to 4 places. tpr[1:] drops the first value and tpr[:-1] the last.

import numpy as np

fpr = np.array([0.0, 0.2, 0.5, 1.0])
tpr = np.array([0.0, 0.7, 0.9, 1.0])
widths = fpr
heights = tpr
auc = 0
print(widths, heights, auc)
In the lesson, your code is checked as you write it.
In your own words
Why does the AUC calculation need np.diff for the widths, when the earlier areas used one fixed Δx?

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 ∫ f(x) dx from a to b mean?

  1. The area under f from a to b
  2. The slope of f at a
  3. f(b) − f(a)
  4. The average of f(a) and f(b)

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