Index Ai Academy
Foundation · Statistics and information

Softmax: scores into probabilities

Exponentiate and share out, shifting and temperature, the safe softmax, and a classifier's last step.

About 43 minutes · Free lesson

What it covers6

Why it matters

Lesson 102 turned one score into the chance of a yes. Most questions have more than two answers: which of three sign types is this, which of 50,000 words comes next. A model produces one score per answer, any numbers at all, negative or huge, and needs a fair way to turn them into a distribution: every chance positive, all of them adding up to 1, and a bigger score always getting a bigger share. Softmax is that way, and it sits at the very end of nearly every classifier and every language model. Its two practical details matter as much as the formula: the same scores can be "cooled" or "heated" with a temperature, which is the setting a chatbot exposes to make its replies safer or more varied, and a naive implementation overflows on scores a real model produces every day.

What you'll be able to do

  • Turn any list of scores into chances that add up to 1: exponentiate, then divide by the total
  • See that adding the same number to every score changes nothing, and that temperature sharpens or flattens the result
  • Compute softmax with a loop, then in NumPy, subtracting the largest score first so nothing overflows
  • Read softmax as the last step of every classifier and language model, pick the predicted class with argmax, and run it in PyTorch with F.softmax, torch.logsumexp and F.log_softmax
Quick check
Have a guess before you start. Three scores, 2, 1 and 0.1, must become three chances adding up to 1. Why not just divide each by their total, 3.1?
  1. It would change which score is biggest
  2. Negative scores would give negative chances
  3. Dividing is too slow
  4. The total of scores is always 0
Show the answer

Negative scores would give negative chances

Scores can be negative, and a score of −1 would get a share of −1/3.1. Exponentiating first makes every value positive.

The math: exponentiate, then share

Purpose. A fair way to turn any list of scores into chances that add up to 1.

Two steps. First make every score positive with the exponential: eᶻ is always above 0, and bigger z gives bigger eᶻ (lesson 24). Then divide each by their total, as lesson 88 turned counts into shares. A short table of e-values does the hand work:

z−100.1123
eᶻ0.36811.1052.7187.38920.09

For the scores 2, 1 and 0.1: e² + e¹ + e⁰·¹ = 7.389 + 2.718 + 1.105 = 11.21. The shares are 7.389 ÷ 11.21 = 0.659, 2.718 ÷ 11.21 = 0.242 and 1.105 ÷ 11.21 = 0.099. They're all positive, they add up to 1, and the order of the scores is kept.

Quick check
From lesson 24: what is e^(a + b) in terms of eᵃ and eᵇ?
  1. eᵃ × eᵇ
  2. eᵃ + eᵇ
  3. eᵃ − eᵇ
  4. (eᵃ)ᵇ
Show the answer

eᵃ × eᵇ

Adding in the exponent multiplies the powers. That rule is why adding a constant to every score leaves softmax unchanged.

Shifting changes nothing. Add 10 to every score: each eᶻ becomes eᶻ × e¹⁰, and so does the total, so the e¹⁰ cancels in every share. Only the differences between scores matter. The shares are also the weights of a weighted average, the idea of lesson 27: weights that add to 1.

The picture. Each class is a bar, at first as tall as its score. Step by step, each bar grows into its exponential, and a last bar, the total, rises as tall as all of them stacked. Then each bar is divided by the total. Watch what that does to the bars' heights. Step through the three scores, then try the same scores with 10 added to each.

Try it now

Then set the scores to 12, 11 and 10.1 and press Use these numbers: every exponential is e¹⁰ times bigger, yet the bars keep the same shape and the shares come out exactly the same.

Symbols and formula. For scores z₁ to zₖ and a temperature T (normally 1):

pi=ezi/T∑jezj/Tsoftmax(z+c)=softmax(z)p_i = \frac{e^{z_i / T}}{\sum_j e^{z_j / T}} \qquad \text{softmax}(\mathbf{z} + c) = \text{softmax}(\mathbf{z})

In plain words: exponentiate each score and divide by the total; adding the same number to every score changes nothing; dividing the scores by T first flattens the chances (T above 1) or sharpens them (T below 1).

Temperature. For the scores 2, 1 and 0.1, T = 0.5 gives 0.864, 0.117 and 0.019: the winner takes almost everything. T = 2 gives 0.502, 0.304 and 0.194: much more even. As T approaches 0 softmax becomes argmax, all the chance on the top score; as T grows, the chances approach equal shares.

Quick check
Softmax of the scores 5, 5 and 5?
  1. 1/3 each
  2. It's undefined
  3. e⁵ each
  4. 5/15 for the first, 0 for the others
Show the answer

1/3 each

Equal scores give equal exponentials, so each gets a third. Shifting them all to 0 gives the same answer.

In your own words
In your own words: why does adding the same number to every score leave softmax unchanged?

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

In Python: a loop, then NumPy, then the safe version

Purpose. Compute softmax by hand, in one line, and in the form real libraries use.

import math
import numpy as np

scores = [2.0, 1.0, 0.1]
total = 0
for s in scores:
    total = total + math.exp(s)
shares = []
for s in scores:
    shares.append(round(math.exp(s) / total, 4))
print(shares)

z = np.array(scores)
e = np.exp(z - z.max())
p = e / e.sum()
print(p.round(4).tolist(), int(np.argmax(p)))
It runs right here in your browser, with nothing to install.

The loop and the array version agree: 0.659, 0.2424 and 0.0986. np.argmax(p) gives the position of the largest chance, the predicted class: here 0, the first. Softmax never changes which score wins; argmax of the chances is argmax of the scores.

Code flow. Here is the loop once more, written the way libraries write it: the largest score is taken away from every score before anything is exponentiated. That's the z - z.max() of the array version. Step through it and watch the boxes of exps and shares fill one class at a time, as the flow's cells did. Look closely at the numbers that land in exps.

A named mistake: exponentiating raw scores. A language model's scores can reach the hundreds. e¹⁰⁰⁰ is far above the largest float, so np.exp(1000) returns inf, and inf ÷ inf is nan: softmax of 1000 and 999 comes out [nan, nan]. Subtracting the largest score first turns them into 0 and −1, whose exponentials are 1 and 0.368, and the answer, 0.731 and 0.269, is exact, because shifting changes nothing. Every library does this; your own code should too.

Worked example

Worked example: three temperatures

Compute the softmax of the same scores at temperatures 0.5, 1 and 2.

import numpy as np

def softmax(z, t):
    z = z / t
    e = np.exp(z - z.max())
    return e / e.sum()

z = np.array([2.0, 1.0, 0.1])
for t in [0.5, 1.0, 2.0]:
    print(t, softmax(z, t).round(3).tolist())
In the lesson you can change this and run it.

At 0.5 the top class takes 86% of the chance; at 1 it takes 66%; at 2 only 50%, with the others catching up. The ranking never changes. That's the dial a chat model's "temperature" setting turns: low values make it pick the likeliest word almost every time, safe and repetitive; high values spread the chances, varied and more error-prone. Dividing the scores by T before the safe softmax is all it takes.

Quick check
What does this print?
import numpy as np

z = np.array([1000.0, 999.0])
e = np.exp(z - z.max())
print((e / e.sum()).round(3).tolist())
  1. [nan, nan]
  2. [1.0, 0.0]
  3. [0.5, 0.5]
  4. [0.731, 0.269]
Show the answer

[0.731, 0.269]

Shifted, the scores are 0 and −1: e⁰ = 1 and e⁻¹ = 0.368, so the shares are 0.731 and 0.269, exactly as for the scores 1 and 0.

Drill

A safe softmax

Fix softmax(z, t) so it divides the scores by t, subtracts the largest, exponentiates and shares out. Then set cool, warm and hot to the softmax of z at t = 0.5, 1 and 2, each rounded to 3 places as a list, and big to the softmax of [1000, 999] at t = 1, rounded to 3.

import numpy as np

def softmax(z, t):
    e = np.exp(z)
    return e / e.sum()

z = np.array([2.0, 1.0, 0.1])
cool = softmax(z, 0.5).round(3).tolist()
warm = softmax(z, 1.0).round(3).tolist()
hot = softmax(z, 2.0).round(3).tolist()
big = softmax(np.array([1000.0, 999.0]), 1.0).round(3).tolist()
print(cool, warm, hot, big)
In the lesson, your code is checked as you write it.
In your own words
A chat app offers a temperature setting from 0 to 2. What would you expect its replies to look like at 0.2 and at 1.8?

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

In AI and ML: the last step of every classifier

Purpose. See softmax turn a model's final scores into its answer.

Classifiers. A sign classifier's last layer (lesson 56) produces one score per class: arrow, tent and trail. Softmax turns the three scores into three chances, the predicted class is the argmax, and its chance is how sure the model is. For four pictures with scores (3, 1, 0.2), (0.5, 2.5, 1), (1, 1.2, 0.9) and (0.1, 0.3, 4), the predictions are arrow with 0.84, tent with 0.74, tent with only 0.39, and trail with 0.96. The third picture is a near tie: worth a second look, or a human check.

Language models. The same step, wider: a language model scores every word in its vocabulary, tens of thousands of them, and softmax turns those scores into the next-word distribution of lesson 91, which is then sampled with a temperature. Here are the twelve scores the camp-log model of lesson 65 gave the words of its vocabulary after "the fire is", shared out at temperatures 1 and 0.5. Each line prints the temperature, the likeliest word and its chance, the chance of "fire", and the total:

import numpy as np

vocab = ["by", "fire", "is", "lake", "lit", "on", "rain", "the", "tent", "trail", "up", "wet"]
scores = np.array([0.31, 1.01, 0.42, -0.96, 1.1, 0.36, -0.96, 0.4, -0.27, -0.18, 0.41, -0.94])
for t in [1.0, 0.5]:
    z = scores / t
    e = np.exp(z - z.max())
    p = e / e.sum()
    best = int(np.argmax(p))
    print(t, vocab[best], round(float(p[best]), 3), round(float(p[1]), 3), round(float(p.sum()), 3))

At temperature 1, "lit" is the likeliest next word, yet it gets only 0.19, with "fire" close behind at 0.174: twelve words share the chance, and a sampled reply could easily say either. At 0.5 the gaps between scores double, and "lit" climbs to 0.311. Twelve scores or fifty thousand, the code is identical. For a whole batch at once, the softmax runs along each row: subtract each row's largest score, exponentiate, and divide by each row's total, with axis=1 and keepdims=True so every row is shared out on its own.

Quick check
A classifier's softmax gives 0.39, 0.32 and 0.29 for one picture. What should you take from it?
  1. It's 39% sure, so the answer is definitely wrong
  2. It barely prefers the first class: a near tie worth checking
  3. The scores must have been negative
  4. The model is broken
Show the answer

It barely prefers the first class: a near tie worth checking

The argmax is the first class, but the chances are close: the model is unsure about this picture.

Quick check
What does this print?
import numpy as np

S = np.array([[1.0, 0.0], [0.0, 0.0]])
E = np.exp(S - S.max(axis=1, keepdims=True))
print((E / E.sum(axis=1, keepdims=True)).round(3).tolist())
  1. [[0.576, 0.212], [0.212, 0.212]]
  2. [[0.731, 0.269], [0.5, 0.5]]
  3. [[0.731, 0.269], [0.731, 0.269]]
  4. [[1.0, 0.0], [0.5, 0.5]]
Show the answer

[[0.731, 0.269], [0.5, 0.5]]

Each row is shared out on its own: scores 1 and 0 give 0.731 and 0.269, and the tie gives 0.5 each.

In PyTorch. The real tool has softmax built in. F.softmax(z, dim=-1) shares out along the last axis, which for a batch means each row on its own, as axis=1 did. Two relatives come with it. torch.logsumexp(z, dim=-1) is the natural log of the total, ln Σ eᶻ, worked out the safe way: the largest score plus the log of the shifted total, so nothing overflows. And F.log_softmax gives the log of every share, as each score minus that log-total:

import torch
import torch.nn.functional as F

z = torch.tensor([2.0, 1.0, 0.1])
print(F.softmax(z, dim=-1))
print(torch.logsumexp(z, dim=-1), torch.log(torch.exp(z).sum()))
print(F.log_softmax(z, dim=-1))
print(z - torch.logsumexp(z, dim=-1))

The first line is the NumPy cell's 0.659, 0.2424 and 0.0986, written to 4 places as tensors print. The log of the total is 2.417 both ways: e to the 2.417 is the flow's total, 11.21, and 2.417 is also 2 plus ln 1.5174, the stepper's shifted total. The log-shares, −0.417, −1.417 and −2.317, are each score minus 2.417. The next lesson builds its loss from exactly these: −log of the right answer's chance. Why not just take the log of the softmax? Predict what each line gives for scores 1000 apart.

Quick check
What does this print?
import torch
import torch.nn.functional as F

z = torch.tensor([1000.0, 0.0])
print(F.log_softmax(z, dim=-1).tolist(), torch.log(F.softmax(z, dim=-1)).tolist())
  1. [0.0, -inf] [0.0, -inf]
  2. [nan, nan] [nan, nan]
  3. [0.0, -1000.0] [0.0, -1000.0]
  4. [0.0, -1000.0] [0.0, -inf]
Show the answer

[0.0, -1000.0] [0.0, -inf]

F.log_softmax works out each log-share as score minus log-total: 0 − 1000 = −1000, a perfectly good number. The second line first makes the share e⁻¹⁰⁰⁰, far too small for a float, so it becomes 0, and the log of 0 is −inf. A loss built on that would be infinite, which is why losses start from log_softmax.

Drill

Predictions for four pictures

Each row of S holds one picture's scores for arrow, tent and trail. Set P to the row-by-row softmax (subtract each row's max, use axis=1, keepdims=True), pred to the predicted class of each picture as a list, and sure to each prediction's chance, rounded to 3, as a list.

import numpy as np

S = np.array([[3.0, 1.0, 0.2], [0.5, 2.5, 1.0], [1.0, 1.2, 0.9], [0.1, 0.3, 4.0]])
P = S
pred = []
sure = []
print(pred, sure)
In the lesson, your code is checked as you write it.
In your own words
Softmax always gives every class some chance, even a class the model has no reason to think likely. Why is that useful for a language model?

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

Goes deeper in

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 does softmax guarantee about its output?

  1. Every value is positive and they add up to 1
  2. The largest value is exactly 1
  3. The values are the scores, sorted
  4. The values add up to the scores' total

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