Index Ai Academy
Foundation · Calculus

Limits: what a value heads toward

Approaching from both sides, holes, corners and jumps, epsilon, and judging activations.

About 37 minutes · Free lesson

What it covers6

Why it matters

Lesson 70 measured change across a gap. The derivative, next lesson, asks for change at a single point, where the gap is zero, and dividing by zero makes no sense. Limits are the way around it: instead of asking what happens at the point, ask what the values head toward as you get closer and closer. That one idea makes the derivative precise. It also gives words for what can go wrong with a function: a hole, a corner, a jump. Those words matter in ML, because activation functions are judged by them, and because code that gets too close to dividing by zero needs a guard.

What you'll be able to do

  • Read a limit from a table, approaching a point from both sides
  • See that a limit can exist where the formula itself breaks, at a hole
  • Tell smooth points, corners and jumps apart, and say which have a limit
  • Judge activation functions by the same test, in plain Python and with PyTorch's F.relu and torch.sigmoid
  • Add a tiny epsilon so code never divides by zero, as real training code does with torch.sqrt(v + eps)
Quick check
Have a guess before you start. What do the numbers 1.9, 1.99, 1.999, 1.9999 head toward?
  1. They never settle
  2. 1.9
  3. 2
  4. 1.99999
Show the answer

2

Each one is closer to 2 than the last, and they never pass it: they head toward 2.

The math: getting closer without arriving

Purpose. Make sense of "as the gap shrinks to nothing".

Take f(x) = (x² − 1)/(x − 1). At x = 1 the formula gives 0 ÷ 0: it breaks. But try values close to 1: f(0.9) = 1.9, f(0.99) = 1.99, f(1.01) = 2.01. From both sides the values close in on 2. We say the limit of f as x approaches 1 is 2:

lim⁡x→1x2−1x−1=2\lim_{x \to 1} \frac{x^2 - 1}{x - 1} = 2

In plain words: as x gets as close to 1 as you like, from either side, f(x) gets as close to 2 as you like.

The point itself doesn't matter, only the approach. Here there's a hole at x = 1: the graph is the line y = x + 1 with one point missing.

Quick check
From lesson 15: what is (x² − 1) factored?
  1. x(x − 1)
  2. (x + 1)²
  3. (x − 1)²
  4. (x − 1)(x + 1)
Show the answer

(x − 1)(x + 1)

A difference of squares. So (x² − 1)/(x − 1) = x + 1 everywhere except x = 1, which is why its limit there is 1 + 1 = 2.

The picture. Step through the table: the same function at 1 − h and 1 + h, for h = 0.1, 0.01 and 0.001. The drawing shows the graph, a straight line with a ring where x = 1 has no value. Each step puts a point on each side of the ring, labeled with its height. From the second step on, the drawing zooms in ten times: the last pair slides out toward the edges, and the new pair lands closer in. However far you zoom, there's a point on each side, and both heights hug 2. The PyTorch tab works out all three h at once.

Try it now

Then set the x it approaches to 3: the formula works there, and the limit is just f(3) = 4.

Symbols and formula. A limit exists when the values from the left and from the right head to the same number:

lim⁡x→a−f(x)=lim⁡x→a+f(x)=L⇒lim⁡x→af(x)=L\lim_{x \to a^-} f(x) = \lim_{x \to a^+} f(x) = L \quad\Rightarrow\quad \lim_{x \to a} f(x) = L

In plain words: a − means approaching from below, a + from above. Both must agree.

Continuous. When the limit also equals f(a), so there's no hole and no jump, the function is continuous at a: you could draw it through that point without lifting your pen. x², eˣ and the sigmoid are continuous everywhere.

Quick check
From the left, f heads to 3; from the right, f heads to 5. What is the limit at that point?
  1. 3, from the left side
  2. 4, the average of the two sides
  3. There is none: the two sides disagree
  4. 5, from the right side
Show the answer

There is none: the two sides disagree

A limit needs both sides to head to the same number. Here they don't: it's a jump.

Three kinds of trouble. Look at a function near a point and one of these usually describes it:

  • Smooth: values close in from both sides and the graph has no sharp point. The sigmoid at 0.
  • Corner: the values close in, so the function is continuous, but the graph turns sharply: relu(x) = max(0, x) at 0, or |x| at 0. The slope jumps from one side to the other.
  • Jump: the two sides head to different values, like a step from 0 to 1. No limit at all.

A fourth kind, blowing up, happens with 1/x near 0: the values grow without bound. At x = −0.1, −0.01 and −0.001, 1/x is −10, −100 and −1000; at 0.1, 0.01 and 0.001 it is 10, 100 and 1000.

In your own words
In your own words: how can a limit exist at a point where the formula gives 0 ÷ 0?

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

In Python: tables from both sides, and epsilon

Purpose. Estimate a limit by computing the approach, and keep code away from dividing by zero.

def f(x):
    return (x ** 2 - 1) / (x - 1)

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

Both columns close in on 2. Calling f(1) itself would stop with "ZeroDivisionError": the formula really does break at the point, and the table is how you see past it. Rounding hides float noise: f(1.001) is really 2.0009999999999177.

Code flow. Here is that loop again, with each side stored and one more column: gap, how far apart the two sides are. Step through it one line at a time. Watch left climb toward 2 and right fall toward it, while gap gets ten times smaller on every pass.

A named mistake: trusting the point. Putting the point into the formula gives the limit only when the function is continuous there. At a hole you get an error; at a jump you get one side's value, which hides the fact that the other side disagrees. Always check both sides.

Epsilon. Real code often computes things like a logarithm of a probability, which breaks at exactly 0. The usual guard adds a tiny number, epsilon, so the input is never exactly 0:

import numpy as np

p = np.array([0.5, 0.0, 0.25])
print(np.log(p + 1e-9).round(3).tolist())

Without + 1e-9, the middle entry would be minus infinity and break everything computed from it. With it, the result is a large but finite −20.723.

Worked example

Worked example: estimate three limits by table

Write approach(f, a) that returns the values at a − 0.001 and a + 0.001, and use it on three functions.

import math

def approach(f, a):
    return round(f(a - 0.001), 4), round(f(a + 0.001), 4)

def hole(x):
    return (x ** 2 - 4) / (x - 2)

def sinc(x):
    return math.sin(x) / x

def step(x):
    if x >= 0:
        return 1
    return 0

print(approach(hole, 2), approach(sinc, 0), approach(step, 0))
In the lesson you can change this and run it.

The first two come back as two nearly equal numbers, about 4 and 1, so those limits exist. The step comes back as (0, 1): the two sides disagree by a whole unit no matter how close you get, so it has no limit at 0. A function can return in more than one place; step returns 1 as soon as x >= 0, and 0 otherwise. And a function can be handed to another function: approach(hole, 2) passes the function hole itself, without brackets, so that approach can call it at two points.

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

print(round(f(2.999), 3), round(f(3.001), 3))
  1. 5.999 6.001
  2. 0 0
  3. An error
  4. 2.999 3.001
Show the answer

5.999 6.001

(x² − 9)/(x − 3) = x + 3 away from 3, so the values are 5.999 and 6.001: the limit is 6.

Quick check
What does this print?
import numpy as np

p = np.array([0.0, 1.0])
print(np.log(p + 1e-9).round(2).tolist())
  1. [-20.72, 0.0]
  2. [-20.72, 1.0]
  3. [-inf, 0.0]
  4. [0.0, 0.0]
Show the answer

[-20.72, 0.0]

log(1e-9) ≈ −20.72, large but finite thanks to epsilon. log(1 + 1e-9) rounds to 0.0.

Drill

Does the limit exist?

Fix has_limit(f, a) so it compares the values at a − 0.0001 and a + 0.0001 and returns True when they're within 0.01 of each other. Then set results for the hole, the step and relu, in that order.

def has_limit(f, a):
    return f(a) == f(a)

def hole(x):
    return (x ** 2 - 1) / (x - 1)

def step(x):
    if x >= 0:
        return 1
    return 0

def relu(x):
    return max(0, x)

results = [has_limit(step, 0)]
print(results)
In the lesson, your code is checked as you write it.
In your own words
Why does has_limit look at a − 0.0001 and a + 0.0001 instead of at a?

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

In AI and ML: judging activation functions

Purpose. An activation function's behavior near 0 decides how training sees it.

Neural networks pass each sum through an activation function. Training needs to know which way to nudge the weights, which means slopes, and slopes need the function to behave near every point:

step:jumprelu:cornerσ(x)=11+e−x:smooth\text{step}: \text{jump} \qquad \text{relu}: \text{corner} \qquad \sigma(x) = \frac{1}{1 + e^{-x}}: \text{smooth}

In plain words: a jump has no slope at all at the jump, and slope 0 everywhere else; a corner has a slope everywhere but at the corner; a smooth function has one everywhere.

import math

def sigmoid(x):
    return 1 / (1 + math.exp(-x))

for h in [0.1, 0.01, 0.001]:
    print(h, round(sigmoid(-h), 6), round(sigmoid(h), 6))

The sigmoid closes in on 0.5 from both sides, smoothly. That's why it replaced the step function in early neural networks: a step's slope is 0 everywhere it exists, so training gets no signal about which way to move.

Quick check
relu is continuous at 0 but has a corner there. What does that mean for its slope?
  1. Its slope is 0.5 everywhere
  2. 0 on the left, 1 on the right: it jumps at 0
  3. It has the same slope on both sides
  4. It has no slope anywhere
Show the answer

0 on the left, 1 on the right: it jumps at 0

relu is flat (slope 0) for negative x and rises at slope 1 for positive x; at the corner the slope switches.

The picture. Here are relu, the bent line, and the sigmoid, the S-shaped curve, drawn together near 0. Drag the point along relu: the line through it is its tangent, and the readout gives relu's slope there.

Why corners are fine and jumps aren't. A corner affects only one exact point, and code simply picks a slope there, usually 0. Everywhere else relu has a clear slope, 0 or 1, which is cheap to compute, so it's the most common activation today. A jump gives no useful slope at all, so nothing tells training which way to move.

In PyTorch. The activations come ready-made, and they work on a whole tensor at once: F.relu and torch.sigmoid. Here they are at the closest pair from the tables, −0.001 and 0.001. dtype=torch.float64 keeps plain Python's precision, and .round(decimals=6) rounds every entry, like round:

import torch
import torch.nn.functional as F

x = torch.tensor([-0.001, 0.001], dtype=torch.float64)
print(F.relu(x).tolist())
print(torch.sigmoid(x).round(decimals=6).tolist())

v = torch.tensor([4.0, 0.0])
g = torch.tensor([2.0, 0.0])
print((g / torch.sqrt(v)).tolist())
print((g / torch.sqrt(v + 1e-8)).tolist())

The sigmoid gives 0.49975 and 0.50025, the same pair the cell above printed for h = 0.001, and relu gives 0.0 and 0.001. The last two lines are epsilon in real training code. Layer norm, a step inside every transformer, divides by torch.sqrt(v + eps), where v is an average of squares that can be exactly 0. Without eps, the second entry is 0 ÷ 0, which PyTorch writes as nan, "not a number": the hole again, and a nan spreads to everything computed from it. With eps = 1e-8 it comes out 0.0. Adam, a way of training (lesson 80), guards the same division with its eps just outside the root, torch.sqrt(v) + eps.

Drill

Smooth, corner or jump?

For each activation, set its label in kinds to "smooth", "corner" or "jump", judged at 0: step, relu, sigmoid, and leaky (x for x ≥ 0, 0.1x below). Use approach to check the values, and the slopes on each side for corners.

import math

def approach(f, a):
    return round(f(a - 0.001), 4), round(f(a + 0.001), 4)

def step(x):
    if x >= 0:
        return 1
    return 0

def relu(x):
    return max(0, x)

def sigmoid(x):
    return 1 / (1 + math.exp(-x))

def leaky(x):
    if x >= 0:
        return x
    return 0.1 * x

kinds = ["smooth", "smooth", "smooth", "smooth"]
print(approach(step, 0), approach(relu, 0), approach(sigmoid, 0), approach(leaky, 0), kinds)
In the lesson, your code is checked as you write it.
In your own words
Why would a network built from step functions be hard to train by following slopes?

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 is the limit of (x² − 1)/(x − 1) as x approaches 1?

  1. 2
  2. 0
  3. 1
  4. It doesn't exist

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