Index Ai Academy
Foundation · Calculus

Lowest points and curvature

f′ = 0, the second-derivative test, tables, local and global minima, and convex losses.

About 43 minutes · Free lesson

What it covers6

Why it matters

Training a model means finding the weights that make the loss as small as possible. So the question "where is this function lowest?" is the goal of nearly everything in machine learning. Calculus gives a sharp answer for smooth functions: at a lowest point the slope is zero, because the curve has stopped falling and not yet started rising. The second derivative, the slope of the slope, then says whether that flat spot is the bottom of a bowl or the top of a dome. This lesson finds turning points by hand and in Python, and then meets the problem real models face: a bumpy loss with more than one valley, where the bottom you find depends on where you start.

What you'll be able to do

  • Find turning points by setting the slope to zero
  • Use the second derivative to tell a bowl (a lowest point) from a dome (a highest point)
  • Find a minimum in Python by solving f′ = 0, or by searching a table of values, and plot it to check the ends
  • Tell local from global minima, and see why a convex loss is easy and a bumpy one isn't
  • Read PyTorch's x.grad as the slope, 0 at a turning point, and watch optim.SGD end in different valleys from different starts
Quick check
Have a guess before you start. You're walking along a valley floor in fog. How can you tell you're at the very bottom?
  1. It's level, and every step leads up
  2. The ground slopes down steeply ahead
  3. It's darker there
  4. You've walked a long way
Show the answer

It's level, and every step leads up

At the bottom the slope is zero, and every step leads up. That's exactly the test calculus uses.

The math: where the slope is zero

Purpose. Find where a function is smallest, or largest.

At a lowest or highest point of a smooth curve, the tangent is flat: f′(x) = 0. These are turning points. For f(x) = x² − 4x + 5:

f′(x)=2x−4=0⇒x=2,f(2)=1f'(x) = 2x - 4 = 0 \quad\Rightarrow\quad x = 2, \quad f(2) = 1

In plain words: solve "slope = 0" for x, then put that x back in to get the height.

To the left of 2 the slope is negative (falling); to the right, positive (rising). So x = 2 is a lowest point, a minimum, with value 1.

Quick check
From lesson 73: what is the derivative of x² − 4x + 5?
  1. 2x − 4
  2. 2x² − 4
  3. 2x − 4 + 5
  4. x − 4
Show the answer

2x − 4

x² → 2x, −4x → −4, and 5 → 0.

The second derivative. Differentiate twice and you get f″(x), how the slope itself is changing. If f″ > 0 the slope is increasing, so the curve bends up like a bowl: a flat spot there is a minimum. If f″ < 0 it bends down like a dome: a maximum. Step through it for 2x² − 8x + 3.

The picture. The drawing shows the curve. The first step lays a short tangent one unit to each side of the turning point, labeled with its slope: falling on the left, rising on the right. The next lays the flat tangent at the bottom, then marks the point and its value, and the last names the shape. The PyTorch tab finds the flat spot with autograd: at x = 2, x.grad is 0, as the AI part prints.

Try it now

Then set a to −1, b to 6 and c to 0: −x² + 6x has a dome, with its highest point at x = 3.

Symbols and formula. The second-derivative test:

f′(a)=0 and f′′(a)>0⇒minimumf′(a)=0 and f′′(a)<0⇒maximumf'(a) = 0 \text{ and } f''(a) > 0 \Rightarrow \text{minimum} \qquad f'(a) = 0 \text{ and } f''(a) < 0 \Rightarrow \text{maximum}

In plain words: flat and bending up is a bottom; flat and bending down is a top.

For x³ − 3x, f′ = 3x² − 3 is 0 at x = 1 and x = −1, and f″ = 6x. At x = 1, f″ = 6 > 0: a minimum, f(1) = −2. At x = −1, f″ = −6 < 0: a maximum, f(−1) = 2. When f″ = 0 too, the test can't decide and you look at the slope on each side instead.

Quick check
At x = 4, f′(4) = 0 and f″(4) = −3. What is x = 4?
  1. Can't tell without more information
  2. Not a turning point
  3. A maximum: flat and bending down
  4. A minimum, the bottom of a bowl
Show the answer

A maximum: flat and bending down

A negative second derivative means a dome, so the flat spot is its top.

Local and global. A local minimum is lower than everything near it; a global minimum is lower than everything anywhere. A bumpy curve can have several local minima, each the bottom of its own valley, and only one of them is global. A convex function, shaped like a single bowl with no bumps, has only one minimum, so local and global are the same. That makes convex functions easy to minimize: any way downhill leads to the one bottom.

In your own words
In your own words: why can't f′ = 0 alone tell a minimum from a maximum?

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

In Python: solve, or search a table

Purpose. Find a minimum both ways, and know when each works.

When the slope is a simple formula, solve f′ = 0 by hand and let Python evaluate. When it isn't, compute the function at many points and pick the smallest:

import numpy as np

def f(x):
    return x ** 2 - 4 * x + 5

xs = np.linspace(0, 4, 9)
ys = f(xs)
print(xs.tolist())
print(ys.tolist())
print(xs[np.argmin(ys)], ys.min())
It runs right here in your browser, with nothing to install.

np.linspace(0, 4, 9) makes 9 evenly spaced points from 0 to 4. np.argmin gives the position of the smallest value and .min() the value itself: x = 2, f = 1, matching f′ = 0.

Code flow. Under np.argmin is a plain search: keep the best x so far, and replace it whenever a new x gives a lower value. Step through it on seven points from 0 to 3. Watch best walk down the valley and stop at the bottom.

Finding local minima in a table. A value lower than both its neighbors is a local minimum of the table:

L = [5.0, 3.2, 2.1, 2.6, 3.0, 1.4, 0.9, 1.3, 2.2]
for i in range(1, len(L) - 1):
    if L[i] < L[i - 1] and L[i] < L[i + 1]:
        print(i, L[i])

A named mistake: a table that's too coarse. A table only sees the points it computes. With points far apart, a narrow valley can fall between them and be missed, or a minimum can be reported a whole step away from where it really is. Use a finer table near anything interesting, or solve f′ = 0 where you can.

Worked example

Worked example: minima of three functions, both ways

Find each function's minimum on [−3, 3] by a fine table, and compare with solving f′ = 0.

import numpy as np

xs = np.linspace(-3, 3, 601)

def f1(x):
    return x ** 2 - 4 * x + 5

def f2(x):
    return 2 * x ** 2 + 3 * x

def f3(x):
    return x ** 3 - 3 * x

for f in [f1, f2, f3]:
    ys = f(xs)
    print(round(float(xs[np.argmin(ys)]), 3), round(float(ys.min()), 3))
print(4 / 2, -3 / 4)
In the lesson you can change this and run it.

The table's 601 points are 0.01 apart. f1's minimum is at 2 and f2's at −0.75, matching f′ = 0 (the last line). f3 is the warning: its table minimum is at x = −3, the edge of the range, with value −18, not the local minimum at x = 1. Cubics fall forever to the left, so on a range the lowest point can be at an end, where the slope isn't 0. Checking the ends is part of finding a minimum on a range.

Plot it. A graph shows the ends at a glance. This draws x³ − 3x on the same range:

import numpy as np
import matplotlib.pyplot as plt

xs = np.linspace(-3, 3, 61)
plt.plot(xs, xs ** 3 - 3 * xs)
plt.xlabel("x")
plt.ylabel("x³ − 3x")
plt.show()
Quick check
Read the plot. Where on the range −3 to 3 is x³ − 3x lowest?
  1. At x = 1, its local minimum
  2. At x = −3, the left end
  3. At x = −1, where it turns
  4. At x = 0, the middle
Show the answer

At x = −3, the left end

The curve dips to −2 at x = 1, but at the left end it falls all the way to −18: the table's answer in the worked example. A valley's bottom is only the lowest point nearby.

Quick check
What does this print?
import numpy as np

xs = np.linspace(0, 2, 5)
print(xs.tolist(), (xs ** 2 - 2 * xs).min())
  1. [0.0, 0.5, 1.0, 1.5, 2.0] -1.0
  2. [0.0, 0.4, 0.8, 1.2, 1.6] -1.0
  3. [0, 1, 2] -1.0
  4. [0.0, 0.5, 1.0, 1.5, 2.0] 0.0
Show the answer

[0.0, 0.5, 1.0, 1.5, 2.0] -1.0

5 points from 0 to 2 are 0.5 apart. x² − 2x is smallest at x = 1, where it's −1.

Drill

Minimum by solving, and by table

For f(x) = 3x² − 12x + 7, set x_solve from f′ = 0, x_table from a table of 401 points on [0, 4], and kind to "min" or "max" from f″.

import numpy as np

def f(x):
    return 3 * x ** 2 - 12 * x + 7

x_solve = 0
xs = np.linspace(0, 4, 5)
x_table = xs[0]
kind = "max"
print(x_solve, x_table, kind)
In the lesson, your code is checked as you write it.
In your own words
When would you search a table instead of solving f′ = 0?

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

In AI and ML: one valley or many

Purpose. Training looks for a low point of the loss, and the loss's shape decides how hard that is.

For the straight-line model of lesson 72, the mean squared error is a bowl in w: convex, with one minimum, where its slope is 0. Any walk downhill finds it. A neural network's loss is different: a landscape with many valleys, and the walk finds whichever one it starts in.

convex: one minimumbumpy: many local minima, one global\text{convex: one minimum} \qquad \text{bumpy: many local minima, one global}

In plain words: in a single bowl every path downhill ends at the same bottom; in a bumpy landscape, where you start decides where you end.

def slope(x):
    return x ** 3 - 4 * x + 0.8

for start in [-3.0, 3.0]:
    x = start
    for step in range(60):
        x = x - 0.05 * slope(x)
    print(start, round(x, 3), round(0.25 * x ** 4 - 2 * x ** 2 + 0.8 * x + 5, 3))

Started on the left, the walk ends at x ≈ −2.09, value −0.64: the global minimum. Started on the right, it stops at x ≈ 1.89, value 2.56: a local minimum. Same rule, same rate, different answers.

The picture. Both shapes, drawn. Press Next to go from one valley to two. The rings are the starts and the dots are where the walks stop.

Quick check
Why is fitting a straight line with mean squared error easier than training a deep network?
  1. Networks have no minima
  2. The line's loss is convex: one bowl, one bottom
  3. Lines have fewer numbers to print
  4. Mean squared error can't be used for networks
Show the answer

The line's loss is convex: one bowl, one bottom

A convex loss has a single minimum, so downhill steps always find it. A network's loss is bumpy.

Why deep learning works anyway. It turns out that in very high dimensions most local minima of a large network's loss are nearly as good as the global one, and the real obstacles are flat regions and saddle points (lesson 83), where the slope is near 0 but the point isn't a bottom at all. Practical training adds tricks, like momentum and random restarts, to keep moving through them.

In PyTorch. The same two walks, with PyTorch finding the slopes. First, the math part's turning point: at x = 2, y.backward() fills x.grad with the slope there. Then torch.optim.SGD([x], lr=0.05) makes an optimizer, the update on the map: opt.step() moves x by −0.05 × x.grad, the same step as the loop above, and opt.zero_grad() clears the old slope first, because backward() adds to .grad instead of replacing it.

import torch

x = torch.tensor(2.0, requires_grad=True)
y = 2 * x ** 2 - 8 * x + 3
y.backward()
print(y.item(), x.grad.item())

for start in [-3.0, 3.0]:
    x = torch.tensor(start, requires_grad=True)
    opt = torch.optim.SGD([x], lr=0.05)
    for step in range(60):
        loss = 0.25 * x ** 4 - 2 * x ** 2 + 0.8 * x + 5
        opt.zero_grad()
        loss.backward()
        opt.step()
    print(start, round(x.item(), 3), round(loss.item(), 3))

The first line is the flow's height at x = 2, −5.0, and a slope of 0.0 there: a flat tangent. Then the two walks print exactly what the plain loop printed: −2.093 and −0.638 from the left, 1.891 and 2.558 from the right (each loss is the last pass's, worked out just before its step). Lesson 79 writes this loop out for a whole model.

Quick check
A loss was recorded at six points. What does this print?
L = [3.0, 2.2, 2.5, 1.9, 1.2, 1.6]
found = []
for i in range(1, len(L) - 1):
    if L[i] < L[i - 1] and L[i] < L[i + 1]:
        found.append(i)
print(found)
  1. [4]
  2. [1, 4]
  3. [0, 5]
  4. [1, 3, 4]
Show the answer

[1, 4]

2.2 (position 1) and 1.2 (position 4) are each lower than both neighbors. 1.9 isn't: the next value, 1.2, is lower.

Drill

Minima in a loss table

Set mins to the positions of every local minimum in the loss table (values lower than both neighbors), and best to the position of the global minimum. Then set left_finds to the position a walk from the left end reaches: keep moving right while the next value is lower.

L = [4.0, 2.5, 1.8, 2.2, 2.9, 1.1, 0.6, 0.8, 1.9]
mins = []
best = 0
left_finds = 0
print(mins, best, left_finds)
In the lesson, your code is checked as you write it.
In your own words
A walk downhill from the left stopped at a value of 1.8, but the table's lowest value is 0.6. What happened, and what could help?

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

Goes deeper in

  • Curvature: second derivatives and the shape of a loss.

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

f′(a) = 0 and f″(a) = 5. What is at x = a?

  1. A minimum
  2. A maximum
  3. No turning point
  4. A jump

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