Index Ai Academy
Foundation · Calculus

Standing in for a curve near a point

Tangent lines, a curvature term, growing error, and why learning rates must be small.

About 37 minutes · Free lesson

What it covers6

Why it matters

Up close, every smooth curve looks like a straight line: its tangent. That simple fact is how calculus turns hard problems into easy ones. Near a point, replace the curve by its tangent line and you can predict values with one multiplication; add a curvature term and the prediction gets better still. The catch is the word "near": the farther you go, the worse the stand-in. Gradient descent relies on exactly this. Each step trusts the tangent's promise that moving downhill lowers the loss, and that promise only holds for small steps. This lesson builds the approximation, measures its error, and works out how long a step can be before the promise breaks.

What you'll be able to do

  • Approximate a curve near a point by its tangent line: f(a) + f′(a)(x − a)
  • Add a curvature term, ½f″(a)(x − a)², for a closer fit
  • Measure how the error grows as you move away from the point
  • See why learning rates must be small: a step only lowers the loss while the tangent is still right
Quick check
Have a guess before you start. √4 = 2. Without a calculator, about what is √4.1?
  1. About 2.025
  2. About 4.1
  3. About 2.1
  4. About 2.05
Show the answer

About 2.025

The slope of √x at 4 is 1/(2√4) = 0.25, so a step of 0.1 raises it by about 0.025. The true value is 2.02485.

The math: the tangent as a stand-in

Purpose. Replace a hard function by an easy one, near a point.

Near x = a, a smooth curve stays close to its tangent line. So for x near a:

f(x)≈f(a)+f′(a) (x−a)f(x) \approx f(a) + f'(a)\,(x - a)

In plain words: start at the known value, and add the slope times how far you've moved.

This is lesson 72's Δy ≈ f′(x)·Δx, written as a function of x. For √x near a = 4: f(4) = 2 and f′(4) = 0.25, so √4.1 ≈ 2 + 0.25 × 0.1 = 2.025. The true value is 2.024846: off by about 0.00015.

Quick check
From lesson 72: f′(4) = 8 for x². About how much does x² change between 4 and 4.05?
  1. About 8
  2. About 16.4
  3. About 0.05
  4. About 0.4
Show the answer

About 0.4

Δy ≈ 8 × 0.05 = 0.4. The tangent-line approximation is the same idea: 4.05² ≈ 16 + 0.4 = 16.4.

Adding curvature. The tangent is straight; the curve bends. The second derivative measures the bend, and one more term accounts for it:

f(x)≈f(a)+f′(a) (x−a)+12 f′′(a) (x−a)2f(x) \approx f(a) + f'(a)\,(x - a) + \tfrac{1}{2}\,f''(a)\,(x - a)^2

In plain words: a parabola that matches the curve's value, slope and bend at a. It hugs the curve much more tightly than the tangent does.

Step through eˣ near 0, stepping 0.5 away: the tangent, then the curvature term, against the true value.

The picture. The curve is eˣ, the big dot is (0, 1), and the dashed line at x = 0.5 is where we want the value. The second step draws the tangent: the hollow dot where it meets the dashed line is its guess, and the filled dot on the curve is the true value. The third step adds the curvature term, a dashed parabola that bends with the curve, and its guess lands much nearer.

Try it now

Then set the step away to 0.1, and then to 2, and press Use these numbers: near the point both are close; far away even the parabola falls behind.

How the error grows. Near a, the tangent's error grows like the square of the distance: twice as far, about four times the error. The parabola's error grows like the cube: twice as far, about eight times, but starting much smaller. For √x around 4: at a distance of 0.1 the tangent is off by 0.00015; at 1, by 0.014; at 2, by 0.05. The approximation is excellent nearby and drifts away from the curve as you go farther.

Quick check
A tangent-line approximation is off by 0.002 at a distance of 0.1. Roughly how far off is it at a distance of 0.2?
  1. About 0.004
  2. About 0.2
  3. About 0.008
  4. About 0.002
Show the answer

About 0.008

The tangent's error grows like the distance squared: twice as far, about 2² = 4 times the error.

In your own words
In your own words: why is the curvature-term version exact for x², but not for eˣ?

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

In Python: the stand-ins as functions

Purpose. Build the approximations once, and tabulate their errors.

import math

def tangent(f, df, a, x):
    return f(a) + df(a) * (x - a)

def quadratic(f, df, d2f, a, x):
    return tangent(f, df, a, x) + 0.5 * d2f(a) * (x - a) ** 2

for d in [0.1, 0.5, 1, 2]:
    x = 0 + d
    print(d, round(tangent(math.exp, math.exp, 0, x), 4), round(quadratic(math.exp, math.exp, math.exp, 0, x), 4), round(math.exp(x), 4))
It runs right here in your browser, with nothing to install.

For eˣ the slope and curvature functions are eˣ itself, so math.exp is passed three times. At 0.1 all three columns nearly agree; at 2 the tangent says 3, the parabola 5, and the truth is 7.389.

Code flow. How fast does the tangent's error grow? Step through the tangent for eˣ at 0, doubling the step each pass, and watch the errors list fill one box at a time.

A named mistake: forgetting the ½. The curvature term is ½f″(a)(x − a)², not f″(a)(x − a)². Without the ½, the parabola bends twice as much as the curve and overshoots: for x² near 3 it would give 9.62 instead of the exact 9.61. Comparing with a true value at one small step catches it.

Why bother approximating at all? Many functions are slow or impossible to compute exactly, but their values, slopes and curvatures at one point are known. Physics, engineering and optimization all lean on these stand-ins, and the tangent version is the one gradient descent uses at every step.

Worked example

Worked example: the error growing with the step

Tabulate √x near 4: the true value, the tangent's and the parabola's, and their errors, at four distances.

import math

def f(x):
    return math.sqrt(x)

def df(x):
    return 1 / (2 * math.sqrt(x))

def d2f(x):
    return -1 / (4 * x ** 1.5)

a = 4
for d in [0.1, 0.5, 1, 2]:
    true = f(a + d)
    first = f(a) + df(a) * d
    second = first + 0.5 * d2f(a) * d ** 2
    print(d, round(true, 4), round(abs(first - true), 6), round(abs(second - true), 6))
In the lesson you can change this and run it.

The tangent's error grows from 0.00015 to 0.0505 as the step goes from 0.1 to 2, faster than the step itself. The parabola's error starts at 0.000002 and is always much smaller. √x bends down (f″ < 0), so here the tangent overshoots and the curvature term pulls the estimate back down. Both are best near 4 and worse far away.

Quick check
What does this print?
def f(x):
    return x ** 2

a = 5
d = 0.2
print(round(f(a) + 2 * a * d, 6), round(f(a + d), 6))
  1. 27.0 27.0
  2. 27.04 27.0
  3. 27.0 27.04
  4. 25.0 27.04
Show the answer

27.0 27.04

The tangent gives 25 + 10 × 0.2 = 27. The truth is 5.2² = 27.04: the curvature adds the last 0.04.

Drill

Tangent and parabola

Fix quadratic so it adds the curvature term with its ½. Then set errs to the absolute errors of the tangent and of the parabola for eˣ at a = 0, x = 1, each rounded to 4 places.

import math

def tangent(f, df, a, x):
    return f(a) + df(a) * (x - a)

def quadratic(f, df, d2f, a, x):
    return tangent(f, df, a, x) + d2f(a) * (x - a) ** 2

errs = []
print(quadratic(math.exp, math.exp, math.exp, 0, 1), errs)
In the lesson, your code is checked as you write it.
In your own words
Why do both approximations get worse the farther x is from a?

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

In AI and ML: why learning rates must be small

Purpose. A gradient step trusts the tangent; curvature decides how far that trust goes.

Gradient descent (lesson 79) moves a weight against the slope: w ← w − η·L′(w). The tangent promises that this lowers the loss by about η·L′(w)². That promise only holds while the tangent is still a good stand-in, and the curvature decides for how long. For a bowl with curvature L″, steps are safe while

η<2L′′\eta < \frac{2}{L''}

In plain words: the more sharply the loss bends, the shorter a step must be to stay downhill.

def loss(w):
    return (w - 2) ** 2 + 1

w = 0
slope = 2 * (w - 2)
for lr in [0.25, 0.5, 0.75, 1.0, 1.1]:
    new_w = w - lr * slope
    print(lr, new_w, round(loss(new_w), 4))

The loss starts at 5 with slope −4 and curvature 2. Steps with η = 0.25, 0.5 and 0.75 all lower it. At η = 1 the step jumps clean over the bottom to a point just as high, 5; at 1.1 the loss gets worse. The limit is 2 ÷ 2 = 1, exactly as the formula says.

The picture. Four of those steps, drawn. The arrow is the step, at the starting height; the dashed line is the starting loss, 5. Where the step lands on the curve says whether it helped: below the dashed line is better, above it is worse.

Quick check
A loss bowl has curvature L″ = 8. What is the largest safe learning rate?
  1. 2
  2. 0.25
  3. 4
  4. 8
Show the answer

0.25

η < 2 ÷ L″ = 2 ÷ 8 = 0.25. A sharply bent loss needs short steps.

Why one learning rate is hard to choose. A real loss bends differently in different directions and at different places: steep in some weights, gentle in others. A learning rate small enough for the steepest direction is painfully slow in the gentle ones. That tension is why optimizers like Adam adapt the step for each weight, and why lesson 83's Hessian, the table of all the curvatures, matters.

The promise, in numbers. At w = 0 the loss is 5 and its slope −4, so the tangent promises that a step of η lowers the loss by about 16η. For η = 0.25 it promises 4 and delivers 3; for η = 1 it promises 16 and delivers 0. The promise is good for small steps and grows ever more wrong as the step lengthens.

In PyTorch. The same loss, with the step done by PyTorch: backward() finds the slope, −4, and the update moves w against it. torch.no_grad() (lesson 50) lets the update change w in place without being recorded, exactly what an optimizer's step() does inside. A safe learning rate, then one too large:

import torch

for lr in [0.25, 1.1]:
    w = torch.tensor(0.0, requires_grad=True)
    loss = (w - 2) ** 2 + 1
    loss.backward()
    with torch.no_grad():
        w -= lr * w.grad
    print(lr, round(w.item(), 4), round(((w - 2) ** 2 + 1).item(), 4))

The same two rows as the Python cell: η = 0.25 lands at w = 1.0 with the loss down to 2.0, and η = 1.1 at 4.4 with the loss up to 6.76. PyTorch follows the slope it's given; only a smaller learning rate stops the overshoot.

Quick check
One step from w = 0 on (w − 2)² + 1, at two learning rates. What does this print?
def loss(w):
    return (w - 2) ** 2 + 1

small = 0 - 0.4 * 2 * (0 - 2)
big = 0 - 1.2 * 2 * (0 - 2)
print(small, round(loss(small), 4), big, round(loss(big), 4))
  1. 1.6 1.16 4.8 1.16
  2. 1.6 1.16 4.8 8.84
  3. 1.6 5.0 4.8 5.0
  4. -1.6 1.16 -4.8 8.84
Show the answer

1.6 1.16 4.8 8.84

η = 0.4 is under the limit of 1 and lowers the loss from 5 to 1.16; η = 1.2 overshoots to 4.8, where the loss is 8.84.

Drill

The largest safe step

For the loss 4(w − 1)² starting at w = 0, set limit to 2 ÷ L″, and ok to a list of True/False for whether one step with each learning rate in rates lowers the loss.

def loss(w):
    return 4 * (w - 1) ** 2

w = 0
slope = 8 * (w - 1)
rates = [0.1, 0.2, 0.25, 0.3]
limit = 0
ok = []
print(limit, ok)
In the lesson, your code is checked as you write it.
In your own words
A training run's loss suddenly starts rising. What does this lesson suggest you try, and why?

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

Goes deeper in

  • Curvature: second derivatives, curvature and step sizes.

Practice what you just read

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

Try a quiz question

What is the tangent-line approximation of f near a?

  1. f(a) + f′(a)(x − a)
  2. f(a) × f′(a)
  3. f′(a)(x − a)
  4. f(x) − f(a)

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