Index Ai Academy
Foundation · Calculus

Derivative rules

Constants, powers, multiples, sums, eˣ and ln x, checked numerically, and a squared error's slope.

About 41 minutes · Free lesson

What it covers6

Why it matters

Lesson 72 found slopes by shrinking secants, one point at a time. That works, but it's slow, and it only gives numbers, never a formula. A handful of rules give the derivative of most everyday functions as a formula, in one line: the derivative of x³ is 3x², of 5 is 0, of eˣ is eˣ. With them you can write down the slope of a loss as an expression and see what drives it. For the squared error of a one-weight model, that slope turns out to contain the error itself, which is why big mistakes push the weights hard and small ones barely move them. This lesson learns the rules, checks each one against a numerical slope, and applies them to that loss.

What you'll be able to do

  • Differentiate constants, powers, constant multiples and sums with four short rules
  • Use the two special derivatives: eˣ is its own derivative, and ln x gives 1/x
  • Check every rule against a numerical slope, and write d_poly for any polynomial
  • Find the slope of a squared-error loss, 2x(wx − y), and see the error inside it
Quick check
Have a guess before you start. f(x) = 7 for every x. What is its slope?
  1. It has no slope
  2. 0: it never changes
  3. 1
  4. 7
Show the answer

0: it never changes

A constant function is a flat line: its rate of change is 0 everywhere.

The math: four rules and two special cases

Purpose. Slopes without the limit every time.

  • Constant: the derivative of a number is 0.
  • Power rule: bring the power down, then lower it by one.
  • Constant multiple: a number in front stays in front: (5x³)′ = 5 × 3x² = 15x².
  • Sum: differentiate each term and add: (x² + x)′ = 2x + 1.
ddx xn=n xn−1\frac{d}{dx}\, x^n = n\,x^{n-1}

In plain words: x⁴ becomes 4x³, x² becomes 2x, and x becomes 1 (since x⁰ = 1).

Lesson 72 found the slope of x² to be 2x by estimating; the power rule gives it at once.

Quick check
From lesson 72: the slope of x² at x = 3 is 6. What does the power rule give for (x²)′ at x = 3?
  1. 3² = 9
  2. 3 − 1 = 2
  3. 2 × 3 = 6
  4. 2 × 3² = 18
Show the answer

2 × 3 = 6

(x²)′ = 2x, and 2 × 3 = 6, matching the shrinking secants.

Step through 1 − 4x + 2x³ term by term: each term follows its own rule, and the results add up.

The picture. The thin curve, f(x), is 1 − 4x + 2x³. Each step adds one term's slope to the thick curve, f′(x), the slope of f so far, and writes the rule it used in the corner. On the last step f′ is whole. Then, at x = 1, look at both: the tangent to f there climbs 2 for each step across, and f′(1) = −4 + 6 × 1² = 2 is the height of the slope curve at the same x.

Try it now

Then set the numbers on 1, x, x², … to 0, 0, 0, 0, 1, which is x⁴, and press Use these numbers: the derivative is 4x³.

Symbols and formula. The rules together, plus the two functions with special derivatives:

(c)′=0(c f)′=c f′(f+g)′=f′+g′(ex)′=ex(ln⁡x)′=1x(c)' = 0 \qquad (c\,f)' = c\,f' \qquad (f + g)' = f' + g' \qquad (e^x)' = e^x \qquad (\ln x)' = \frac{1}{x}

In plain words: eˣ grows exactly as fast as its own value, and ln x grows by 1/x, ever more slowly.

Why eˣ is special. Every exponential bˣ has a slope proportional to itself; e ≈ 2.718 is the one base where the factor is exactly 1. That's why e appears in so many ML formulas: the sigmoid, softmax and the normal distribution all use it, and their slopes come out tidy because (eˣ)′ = eˣ.

Quick check
What is the derivative of 3x⁴ − 2x + 9?
  1. 3x³ − 2
  2. 12x³ − 2
  3. 12x³ − 2 + 9
  4. 12x⁴ − 2
Show the answer

12x³ − 2

3x⁴ → 3 × 4x³ = 12x³; −2x → −2; 9 → 0.

In your own words
In your own words: why does the derivative of a sum split into the derivatives of its terms?

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

In Python: check each rule numerically

Purpose. Trust a rule because you've watched it agree with a measured slope.

A central difference, (f(x + h) − f(x − h)) ÷ 2h, looks both ways and is far more accurate than lesson 72's one-sided secant for the same h:

import math

def slope(f, x):
    h = 0.000001
    return (f(x + h) - f(x - h)) / (2 * h)

def f(x):
    return x ** 4

print(round(slope(f, 2), 4), 4 * 2 ** 3)
print(round(slope(math.exp, 1), 4), round(math.exp(1), 4))
print(round(slope(math.log, 2), 4), 1 / 2)
It runs right here in your browser, with nothing to install.

Each line prints the measured slope next to the rule's answer: 32 and 32 for x⁴, 2.7183 twice for eˣ, and 0.5 twice for ln x.

Code flow. Now put the power rule against the measured slope at three points in a row. Step through: each pass calls slope, which calls f twice, once just right of x and once just left, and then the rule, 4x³, is worked out beside it.

A polynomial's derivative from its coefficients. Store 1 − 4x + 2x³ as its coefficients [1, −4, 0, 2], one per power. The power rule then works on the list: the coefficient of xⁿ, times n, becomes the coefficient of xⁿ⁻¹.

coeffs = [1, -4, 0, 2]
d = []
for n in range(1, len(coeffs)):
    d.append(n * coeffs[n])
print(d)

[−4, 0, 6] is −4 + 0x + 6x². A named mistake: forgetting to lower the power. Writing 2x³ → 6x³ keeps the power; the derivative must lose one, giving 6x². Checking against a numerical slope catches it at once.

Worked example

Worked example: d_poly, verified at three points

Write d_poly(coeffs) for any polynomial and confirm it against the central difference at x = 0, 1 and 2.

def d_poly(coeffs):
    d = []
    for n in range(1, len(coeffs)):
        d.append(n * coeffs[n])
    return d

def value(coeffs, x):
    total = 0
    for n in range(len(coeffs)):
        total = total + coeffs[n] * x ** n
    return total

c = [1, -4, 0, 2]
dc = d_poly(c)
h = 0.000001
for x in [0, 1, 2]:
    measured = (value(c, x + h) - value(c, x - h)) / (2 * h)
    print(x, value(dc, x), round(measured, 4))
In the lesson you can change this and run it.

value evaluates a polynomial from its coefficients, so the same function evaluates both f and its derivative. At x = 0, 1 and 2 the rule gives −4, 2 and 20, and the measured slopes agree. Two independent methods matching is the best evidence that the rule, and the code, are right.

Quick check
What does this print?
coeffs = [3, 0, 5, 1]
d = []
for n in range(1, len(coeffs)):
    d.append(n * coeffs[n])
print(d)
  1. [0, 5, 1]
  2. [10, 3]
  3. [3, 0, 10, 3]
  4. [0, 10, 3]
Show the answer

[0, 10, 3]

3 + 5x² + x³ has derivative 0 + 10x + 3x²: the list [0, 10, 3].

Quick check
What does this print?
import math

h = 0.000001
print(round((math.exp(2 + h) - math.exp(2 - h)) / (2 * h), 3), round(math.exp(2), 3))
  1. 2.0 7.389
  2. 7.389 7.389
  3. 14.778 7.389
  4. 7.389 2.718
Show the answer

7.389 7.389

The slope of eˣ at 2 equals its value there, e² ≈ 7.389: eˣ is its own derivative.

The power rule for any power. The rule works for negative and fractional powers too. 1/x is x⁻¹, so its derivative is −1·x⁻² = −1/x². √x is x^½, so its derivative is ½·x^(−½) = 1/(2√x): at x = 4 that's 0.25, the slope lesson 72 measured. Rewriting a function as powers of x first often turns a hard-looking derivative into a one-line one.

Drill

Differentiate any polynomial

Fix d_poly(coeffs) so it returns the derivative's coefficients. Then set at2 to the derivative of 5 + 2x − x² + x⁴ at x = 2, using value.

def d_poly(coeffs):
    d = []
    for n in range(1, len(coeffs)):
        d.append(coeffs[n])
    return d

def value(coeffs, x):
    total = 0
    for n in range(len(coeffs)):
        total = total + coeffs[n] * x ** n
    return total

c = [5, 2, -1, 0, 1]
at2 = 0
print(d_poly(c), at2)
In the lesson, your code is checked as you write it.
In your own words
Why check a rule against a numerical slope if the rule is already known to be true?

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

In AI and ML: the slope of a squared error

Purpose. See what drives a weight's update.

A one-weight model predicts ŷ = w·x, and its squared error on one example is L = (w·x − y)². Expand it and apply the rules (lesson 74 shows a faster way):

L=w2x2−2wxy+y2⇒dLdw=2wx2−2xy=2x(wx−y)L = w^2x^2 - 2wxy + y^2 \quad\Rightarrow\quad \frac{dL}{dw} = 2wx^2 - 2xy = 2x(w x - y)

In plain words: the slope is 2 times the input times the error, (ŷ − y). No error, no slope.

w = 1.5
for x, y in [(2, 5), (1, 1), (3, 4)]:
    error = w * x - y
    print(x, y, error, 2 * x * error)

The first example's prediction, 3, misses 5 by −2, giving a slope of −8: raise w. The others overshoot, giving positive slopes: lower w. Bigger errors and bigger inputs give bigger slopes.

Quick check
For L = (w·x − y)², the prediction is exactly right on one example. What is dL/dw for it?
  1. 0: the error is 0
  2. y, the target
  3. 1, the slope of a line
  4. 2x, the input doubled
Show the answer

0: the error is 0

dL/dw = 2x(wx − y), and a perfect prediction makes wx − y = 0.

What the formula says about training. Because the error sits inside the slope, a weight is pushed hardest by the examples it gets most wrong, and not at all by the ones it already gets right. The input x scales the push too: an example with a big input has more leverage over w. Averaging these slopes over all the examples gives the slope of the mean squared error, the number lesson 79's gradient descent follows downhill.

In PyTorch. PyTorch never writes out 2x(wx − y). It records how L was computed from w and, when you call L.backward(), applies these same rules step by step to put dL/dw into w.grad (lesson 72 showed it first). First the rules on their own: the power, constant multiple, sum and constant rules in one polynomial, then eˣ and ln x:

import math
import torch

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

x = torch.tensor(1.0, requires_grad=True)
torch.exp(x).backward()
print(round(x.grad.item(), 4), round(math.exp(1), 4))

x = torch.tensor(2.0, requires_grad=True)
torch.log(x).backward()
print(x.grad.item(), 1 / 2)

Each .grad matches its rule: 91.0 and 91 for 12x³ − 5 at x = 2, 2.7183 twice for eˣ at 1, and 0.5 twice for 1/x at 2.

Now the slope of the squared error itself, for the three examples at the start of this part, with w = 1.5. A fresh w for each example keeps their slopes apart, because backward() adds to whatever w.grad already holds:

import torch

for x, y in [(2, 5), (1, 1), (3, 4)]:
    w = torch.tensor(1.5, requires_grad=True)
    L = (w * x - y) ** 2
    L.backward()
    print(x, y, w.grad.item(), 2 * x * (1.5 * x - y))

w.grad is −8.0, 1.0 and 3.0, the same slopes 2x(wx − y) gave at the start of this part, printed beside them again.

Summing over examples. A real loss averages the squared error over many examples, and the sum rule says its slope is the average of their slopes. So each example adds its own push, 2x(wx − y), and the weight moves by the combined push. Examples the model gets badly wrong, with big inputs, dominate that sum; examples it gets right contribute nothing at all. That's also why noisy, mislabeled examples can do harm: the model sees a big error and pushes hard to fix it, even though the label was the mistake. Cleaning labels often helps more than any change to the model.

Drill

Slopes of a squared error

Write dL_dw(w, x, y) returning 2x(wx − y). Then set slopes to its values for the pairs below at w = 2, and avg to their mean.

def dL_dw(w, x, y):
    return w * x - y

pairs = [(1, 3), (2, 3), (4, 7)]
slopes = []
avg = 0
print(slopes, avg)
In the lesson, your code is checked as you write it.
In your own words
Why does an example the model already predicts perfectly not change the weight at all?

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

Goes deeper in

Practice what you just read

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

Try a quiz question

What is the derivative of 6x³?

  1. 18x²
  2. 6x²
  3. 18x³
  4. 3x²

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