Index Ai Academy
Foundation · Calculus

The derivative: slope at a point

Shrinking secants, f′(x) and dy/dx, Δy ≈ f′Δx, and which way a weight should move.

About 45 minutes · Free lesson

What it covers6

Why it matters

A rate across an interval, from lesson 70, depends on the interval you choose. The derivative removes that choice: shrink the interval toward zero and, for a smooth function, the average rate settles on one number, the slope at that exact point. That number answers the most useful question in all of machine learning. If I nudge this weight up a little, does the loss go up or down, and by how much? Training a model asks it millions of times, once for every weight at every step. This lesson builds the derivative from shrinking secants, by hand and in a few lines of Python, then asks it of a real loss.

What you'll be able to do

  • Find the slope at a single point by shrinking a secant until its slope settles
  • Read the derivative as a new function, f′(x) or dy/dx, and use Δy ≈ f′(x)·Δx
  • Estimate derivatives in Python with slope(f, x, h) and a small h
  • Ask a loss the question training asks: if this weight goes up a little, does the loss go up or down?
Quick check
Have a guess before you start. A car's speedometer reads 50 km/h. Is that an average over the whole trip, or the speed right now?
  1. The top speed so far
  2. The average over the whole trip
  3. The speed right now, at this instant
  4. The average over the last hour
Show the answer

The speed right now, at this instant

A speedometer shows the rate of change of distance at one instant. That's a derivative.

The math: shrink the gap

Purpose. The rate of change at one instant.

Take f(x) = x² and ask for its slope at x = 3. Pick a small step h and compute the secant's slope, (f(3 + h) − f(3)) ÷ h. As h shrinks, the slopes are 7, 6.1, 6.01, 6.001: they settle on 6. That settled value is the derivative of f at 3, the slope of the tangent, the line that just touches the curve there.

f′(x)=lim⁡h→0f(x+h)−f(x)hf'(x) = \lim_{h \to 0} \frac{f(x + h) - f(x)}{h}

In plain words: the slope of a secant, as its two points slide together. Lesson 71's limit is what lets h head to 0 without ever being 0.

Quick check
From lesson 70: what is the average rate of x² from x = 3 to x = 3.1?
  1. 6.1
  2. 6
  3. 0.61
  4. 9.61
Show the answer

6.1

(9.61 − 9) ÷ 0.1 = 6.1. Shrink the step further and these averages close in on 6.

Watch the secant slopes settle as h shrinks from 1 to 0.001.

The picture. The curve is y = x², and the big dot is (3, 9), the point whose slope we want. Each step puts a second point h further along the curve, the hollow dot, and draws the secant through the two. Its slope is written in the top corner, the same number the step writes in its cell. As h shrinks, the hollow dot slides in and the secant swings toward the curve. On the last step it has become the tangent.

Try it now

Then set x to 1, and then to 2, and press Use these numbers: the slopes settle on 2 and 4. Each time the derivative is twice x.

Symbols and formula. The derivative is itself a function: put in any x and it gives the slope there. For x² the slopes at 1, 2 and 3 are 2, 4 and 6, so f′(x) = 2x. Two notations mean the same thing:

f′(x)=dydxΔy≈f′(x) Δxf'(x) = \frac{dy}{dx} \qquad \Delta y \approx f'(x) \, \Delta x

In plain words: dy/dx reads "the rate of y with respect to x". And near a point, a small change in x changes y by about the slope times that change.

At x = 3, nudging x by 0.1 changes x² by about 6 × 0.1 = 0.6. The true change, 9.61 − 9 = 0.61, is close: the smaller the nudge, the closer the estimate.

Quick check
f′(5) = −2. If x goes from 5 to 5.1, about how does f change?
  1. It falls by about 0.2
  2. It rises by about 0.2
  3. It falls by about 2
  4. It doesn't change
Show the answer

It falls by about 0.2

Δy ≈ f′(x)·Δx = −2 × 0.1 = −0.2: a small drop.

Reading the sign. A positive derivative means the function rises as x grows; negative means it falls; zero means it's flat right there, which happens at the bottom of a valley or the top of a hill (lesson 75). The size says how steeply. For x², the slope at −2 is −4 (falling steeply), at 0 it's 0 (flat), and at 2 it's 4 (rising steeply).

In your own words
In your own words: why does the slope of a secant settle on one number as h shrinks, for a smooth curve?

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

In Python: a slope function

Purpose. Estimate the derivative of any function at any point.

def slope(f, x, h):
    return (f(x + h) - f(x)) / h

def f(x):
    return x ** 2

for h in [1, 0.1, 0.01, 0.001]:
    print(h, round(slope(f, 3, h), 6))
It runs right here in your browser, with nothing to install.

slope takes the function itself as its first input (lesson 71 passed functions the same way) and returns the secant slope for a step h. With h = 0.00001 the estimate is good to several decimals.

Code flow. Step through the same estimator, this time keeping each estimate in a list. Watch the jump into slope on every pass: f is called twice, at x + h and at x, and the list grows one box at a time to the numbers the flow's cells filled in.

The derivative of x², found numerically. Estimate the slope at several points and the pattern appears:

def slope(f, x, h):
    return (f(x + h) - f(x)) / h

def f(x):
    return x ** 2

for x in [1, 2, 3]:
    print(x, round(slope(f, x, 0.00001), 4))

The slopes are 2, 4 and 6: twice x each time. A named mistake: h too big, or too small. A big h gives a long secant, not a tangent: h = 1 gives 7 instead of 6. A tiny h, like 1e-15, runs into float noise and gives garbage. Steps around 1e-5 or 1e-6 are a good middle for most functions.

Worked example

Worked example: numerical derivatives of three functions

Estimate the slope of x³, eˣ and √x at a few points, and compare with what you'd expect.

import math

def slope(f, x, h):
    return (f(x + h) - f(x)) / h

def cube(x):
    return x ** 3

print(round(slope(cube, 1, 0.00001), 3), round(slope(cube, 2, 0.00001), 3))
print(round(slope(math.exp, 0, 0.000001), 4))
print(round(slope(math.sqrt, 4, 0.000001), 4))
In the lesson you can change this and run it.

x³ has slope 3 at x = 1 and 12 at x = 2: it steepens fast, as 3x² would predict (lesson 73). eˣ has slope 1 at 0, the same as its value there, a special property of e. √x has slope 0.25 at 4, gentle, since square roots grow ever more slowly. math.exp and math.sqrt are passed to slope just like a function you wrote.

Quick check
What does this print?
def slope(f, x, h):
    return (f(x + h) - f(x)) / h

def g(x):
    return 3 * x + 1

print(round(slope(g, 2, 0.5), 6), round(slope(g, 10, 0.001), 6))
  1. 7.0 31.0
  2. 3.5 3.0
  3. 3.0 30.0
  4. 3.0 3.0
Show the answer

3.0 3.0

A straight line has the same slope everywhere, 3, and every secant gives exactly that.

Drill

A slope estimator

Fix slope(f, x, h) so it returns the secant slope. Then set s1 to the slope of x² at 5 with h = 0.0001, rounded to 2 places, and change to the estimated change in x² when x goes from 5 to 5.2, using Δy ≈ f′(x)·Δx.

def slope(f, x, h):
    return f(x + h) - f(x)

def f(x):
    return x ** 2

s1 = round(slope(f, 5, 0.0001), 2)
change = 0
print(s1, change)
In the lesson, your code is checked as you write it.
In your own words
Why not just use h = 0 in slope(f, x, h)?

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

In AI and ML: which way should a weight move?

Purpose. The question training asks millions of times.

A model ŷ = w·x predicts tent rentals from temperature. Its loss, the mean squared error over three days, is a function of the weight w alone. The derivative of the loss says what a small increase in w would do:

dLdw<0⇒raise wdLdw>0⇒lower w\frac{dL}{dw} < 0 \Rightarrow \text{raise } w \qquad \frac{dL}{dw} > 0 \Rightarrow \text{lower } w

In plain words: if the loss falls as w rises, raise w; if it rises, lower w. The size says how urgently.

import numpy as np

x = np.array([1, 2, 3])
y = np.array([2, 4, 7])

def loss(w):
    return np.mean((w * x - y) ** 2)

def slope(f, w, h):
    return (f(w + h) - f(w)) / h

for w in [1, 2, 3]:
    print(w, round(loss(w), 4), round(slope(loss, w, 0.000001), 3))

At w = 1 the slope is −11.333: raising w helps a lot. At w = 2 it's −2: raise it a little. At w = 3 it's +7.333: w has gone too far, so lower it. The best w is between 2 and 3.

The picture. Here is that loss drawn as a curve of w, with the tangent at w = 1 and at w = 3, and an arrow for the move: against the slope, and longer when the slope is steeper.

Quick check
At some w, the loss's slope is 0. What does that suggest?
  1. w is at a flat spot, likely the bottom
  2. The loss is at its highest point
  3. The model is broken
  4. w should be raised a lot
Show the answer

w is at a flat spot, likely the bottom

A slope of 0 means small changes in w don't change the loss: for a bowl-shaped loss, that's the bottom.

Many weights, one question each. A real network has millions of weights, and training asks this question for each one: the slope of the loss with respect to that weight, holding the others still. Lesson 77 calls these partial derivatives, and lesson 78 gathers them into the gradient. Computing each one by nudging, as here, would take one extra loss evaluation per weight, far too slow; lesson 81's backpropagation gets them all at once.

In PyTorch. Here is a first taste of PyTorch's autograd, the machine that does that, which lesson 82 opens up. Make w a tensor with requires_grad=True and PyTorch records every calculation w goes into. Compute the loss L from w, call L.backward(), and PyTorch works the slope of L with respect to w back through that record into w.grad. No nudge, no h:

import torch

x = torch.tensor([1.0, 2.0, 3.0])
y = torch.tensor([2.0, 4.0, 7.0])
for v in [1, 2, 3]:
    w = torch.tensor(float(v), requires_grad=True)
    L = torch.mean((w * x - y) ** 2)
    L.backward()
    print(v, round(L.item(), 4), round(w.grad.item(), 3))

The same three rows as the NumPy cell: losses 7.0, 0.3333 and 3.0, and slopes −11.333, −2.0 and 7.333. The nudge only estimated each slope; w.grad is the exact one. Each pass makes a fresh w, because backward() adds to whatever w.grad already holds.

Overshooting the best value. The slope also says when a weight has gone too far. Past the bottom of the loss, the slope turns positive, so the same rule, "move against the slope", now says to bring w back down. The rule never needs to know where the bottom is; it only reads the slope where it stands, then takes another reading after every step.

Quick check
At w = 2.5 the tent loss's slope is measured. What does this print, and which way should w move?
import numpy as np

x = np.array([1, 2, 3])
y = np.array([2, 4, 7])

def loss(w):
    return np.mean((w * x - y) ** 2)

h = 0.000001
print(round((loss(2.5 + h) - loss(2.5 - h)) / (2 * h), 3))
  1. 0.0
  2. -2.667
  3. 2.667
  4. 2.5
Show the answer

2.667

The slope at 2.5 is positive, 2.667: w is past the best value of about 2.21, so lower it.

Drill

Which way to move w

For the loss below, set slopes to its slope at w = 0, 1 and 2 (h = 0.000001, each rounded to 2 places), and moves to "up" or "down" for each: the way w should move to lower the loss.

import numpy as np

x = np.array([1, 2])
y = np.array([3, 5])

def loss(w):
    return np.mean((w * x - y) ** 2)

def slope(f, w, h):
    return (f(w + h) - f(w)) / h

slopes = []
moves = []
print(slopes, moves)
In the lesson, your code is checked as you write it.
In your own words
Why does the size of the loss's slope matter, not just its sign?

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

Goes deeper in

Practice what you just read

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

Try a quiz question

What does f′(x) = 0 at a point tell you?

  1. The function is flat there
  2. The function is 0 there
  3. The function has no value there
  4. The function is at its biggest everywhere

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