Index Ai Academy
Foundation · Transposition of formulas

Planning a model: rearranging the formulas of a working network

Layer widths from parameter counts, sizes from memory and compute, the attention scale, and a training plan.

About 40 minutes · Free lesson

What it covers6

Why it matters

Building a network runs its formulas forward: widths give parameters, parameters give memory, and the step gives the learning rate. Planning runs them backward. You start from what you have, a GPU's memory, a compute budget or a deadline, and solve for the width, the model size, the batch or the step. This lesson is transposing each formula of the network you just built, checking every plan with a round trip, and saying which way to round.

What you'll be able to do

  • Find a layer's width, or a hidden layer's width, from a parameter count, and round it the safe way
  • Turn memory, compute and data formulas around for the model size or the data a budget allows
  • Combine C ≈ 6ND with the rule of thumb D ≈ 20N to get N = √(C/120), and say that both are approximations
  • Free the head size d from the attention scale, and the bias b that makes a neuron hit a target activation
  • Solve a training plan for its batch size and its learning-rate schedule for a step, checking every plan with a round trip in code
Quick check
Have a guess before you start. A dense layer has 100 inputs and 5,050 parameters: a weight for every input and output pair, plus one bias per output. How many outputs?
  1. 50
  2. 101
  3. 50.5
  4. 5,050
Show the answer

50

Each output costs 100 weights and 1 bias: 101 numbers. 5,050 ÷ 101 = 50. Check: 100 × 50 + 50 = 5,050.

The math: one network, many unknowns

Purpose. Plan a model from its budgets: turn each formula of a working network around for the size you need.

A dense layer gives every output a weight for each input, plus one bias, as in lesson 110. Its parameters, the numbers training sets, number P = n_in·n_out + n_out.

To find n_out, notice it appears twice. Factor it out, as in lesson 32: P = n_out(n_in + 1), so n_out = P/(n_in + 1). To find n_in, take the biases off first: n_in = (P − n_out)/n_out.

A network with d inputs, one hidden layer of width h and k outputs has P = dh + h + hk + k. Collect the h terms: P = h(d + k + 1) + k, so h = (P − k)/(d + k + 1).

Conditions. Widths are whole numbers. If the formula gives 41.5, no width has exactly that many parameters. For a budget, round down: 42 would go over it.

Quick check
From an earlier lesson: a network has 3 inputs, 4 hidden units and 3 outputs. How many parameters?
  1. 28
  2. 31
  3. 24
  4. 10
Show the answer

31

W₁ has 3 × 4 = 12, b₁ has 4, W₂ has 4 × 3 = 12 and b₂ has 3: 31. With the formula, h(d + k + 1) + k = 4 × 7 + 3 = 31.

Memory. Training with an Adam-style optimizer keeps about four numbers per parameter: the weight, its gradient, and the optimizer's two running averages. At b bytes a number, M ≈ 4Pb, so P ≈ M/(4b). At 4 bytes that's 16 bytes a parameter. Mixed precision (2-byte weights and gradients, plus a 4-byte master copy and averages) comes to about the same: 2 + 2 + 4 + 4 + 4 = 16. It's an approximation: the activations a batch makes need memory too.

Compute. Training a model with N parameters on D tokens, the word pieces a language model reads, takes about C ≈ 6ND FLOPs (single multiplies or adds): roughly 2 per parameter per token forward and 4 backward. So D = C/(6N), and N = C/(6D). It's an approximation too: it leaves out the attention scores' own work.

Combining. A rule of thumb from a 2022 study (the Chinchilla rule) says the compute-optimal split, the lowest loss for a fixed C, uses D ≈ 20N: twenty tokens per parameter. It's an approximation, not a law: many teams train smaller models on more tokens, since they're cheaper to run. Substitute it, as in lesson 39: C ≈ 6N·20N = 120N². N is squared, so freeing it takes a square root. Watch it with N in billions, so C comes out in units of 10¹⁸ FLOPs.

Try it now

Change N to 4 and press Use these numbers: twice the model needs 4 times the compute.

Symbols and formula. The two moves you'll use most:

P=nout(nin+1)  ⇒  nout=Pnin+1,C≈120N2  ⇒  N≈C120P = n_{\text{out}}(n_{\text{in}} + 1) \;\Rightarrow\; n_{\text{out}} = \frac{P}{n_{\text{in}} + 1}, \qquad C \approx 120N^2 \;\Rightarrow\; N \approx \sqrt{\frac{C}{120}}

In plain words: a letter that appears twice gets factored out, then divided free. A letter that's squared gets a square root, and only the positive one makes sense for a size.

Named mistakes. Dividing P by n_in, which forgets the biases. Sizing a training run for the weights alone, which forgets the × 4. Halving the bytes for the weights alone, as if mixed precision halved the memory. Mixing units: here 1 GB is 10⁹ bytes, and C in units of 10¹⁸ FLOPs gives N in billions, since √10¹⁸ = 10⁹.

Quick check
A dense layer has 32 outputs and 3,232 parameters. How many inputs?
  1. 101
  2. 3,200
  3. 97.9
  4. 100
Show the answer

100

Take the 32 biases off: 3,232 − 32 = 3,200 weights. Each output has one per input: 3,200 ÷ 32 = 100. Check: 100 × 32 + 32 = 3,232.

Quick check
A 24 GB GPU (24 × 10⁹ bytes) trains with an Adam-style optimizer at 4 bytes a number. About how many parameters fit?
  1. 6 billion
  2. 1.5 billion
  3. 0.375 billion
  4. 24 billion
Show the answer

1.5 billion

P ≈ M/(4b) = 24 × 10⁹ ÷ 16 = 1.5 × 10⁹. Check: 1.5 billion × 4 numbers × 4 bytes = 24 GB.

In your own words
Under C ≈ 6ND and D ≈ 20N, why does 100 times the compute buy a model only 10 times bigger?

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

In Python: a planning toolkit with round trips

Purpose. Write each rearrangement as a function, then run its answer forward through the original formula. If the round trip doesn't give the budget back, the rearrangement is wrong.

import math

def layer_params(n_in, n_out):
    return n_in * n_out + n_out

def outputs_for(P, n_in):
    return P / (n_in + 1)

def hidden_for(P, d, k):
    return math.floor((P - k) / (d + k + 1))

n_out = outputs_for(8256, 128)
print(n_out, layer_params(128, n_out))
h = hidden_for(1000, 20, 3)
print(h, 24 * h + 3, 24 * (h + 1) + 3)
It runs right here in your browser, with nothing to install.
  • The first round trip gives 8,256 back, so the rearrangement is right.
  • A budget of 1,000 gives h = 41.54. math.floor rounds down to 41, which uses 987 parameters. The second check shows why: 42 would need 1,011, over budget.
Worked example

Worked example: the bias that hits a target activation

A sigmoid neuron gives a = σ(w·x + b), as in lesson 109. Peel the sigmoid with the logit from lesson 35: ln(a/(1 − a)) = w·x + b. Take w·x away: b = ln(a/(1 − a)) − w·x. The condition: a must be strictly between 0 and 1.

import math
import numpy as np

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

def bias_for(a, w, x):
    if a <= 0 or a >= 1:
        return None
    return math.log(a / (1 - a)) - float(np.dot(w, x))

w = np.array([0.5, -1.0])
x = np.array([3.0, 1.0])
b = bias_for(0.9, w, x)
print(round(b, 4), round(sigmoid(float(np.dot(w, x)) + b), 4), bias_for(1, w, x))
In the lesson you can change this and run it.

w·x = 1.5 − 1 = 0.5, and the logit of 0.9 is ln 9 ≈ 2.1972. So b ≈ 1.6972. The round trip puts it back into the neuron and gets 0.9. A target of exactly 1 has no answer: the sigmoid never reaches 1, however large the bias, so the function returns None.

The attention scale. lesson 113 divides each score by √d, where d is the length of the query and key vectors (the head size): s = q·k/√d. To free d, multiply by √d and divide by s: √d = q·k/s. Then square both sides: d = (q·k/s)². The conditions: s isn't 0, and s has the same sign as q·k, since √d is positive. A head size is a whole number, so a d like 15.7 means the scores were rounded.

Quick check
What does this print?
import math

def head_size(raw, scaled):
    return (raw / scaled) ** 2

d = head_size(8.0, 2.0)
print(d, 8.0 / math.sqrt(d))
  1. 4.0 4.0
  2. 16.0 2.0
  3. 2.0 2.0
  4. 16.0 0.5
Show the answer

16.0 2.0

√d = 8 ÷ 2 = 4, so d = 16.0. The round trip divides 8 by √16 = 4 and gives back the scaled score, 2.0.

Quick check
A run has C = 1.2 × 10²¹ FLOPs and 100 billion tokens of data. With C ≈ 6ND, about how many parameters N?
  1. 2 billion
  2. 3.16 billion
  3. 7.2 × 10³²
  4. 12 billion
Show the answer

2 billion

Here D is known, so one division frees N: N = C/(6D) = 1.2 × 10²¹ ÷ (6 × 10¹¹) = 2 × 10⁹. Check: 6 × 2 × 10⁹ × 10¹¹ = 1.2 × 10²¹.

Drill

Fix the planner

outputs_for forgets the biases and head_size takes a root where it needs a square. Fix both, so each round trip gives back what went in.

import math

def outputs_for(P, n_in):
    return P / n_in

def head_size(raw, scaled):
    return math.sqrt(raw / scaled)

print(outputs_for(8256, 128), head_size(8.0, 2.0))
In the lesson, your code is checked as you write it.
In your own words
Why run every planned number back through the original formula?

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

In AI and ML: sizing a training run

Purpose. Before a run starts, engineers fix its budgets: GPU memory, total compute and a deadline. Then they turn the formulas around for the model size, the data, the batch and the learning-rate schedule. Every training config and every scaling study is built this way.

A deadline. steps = epochs·n/batch for n examples, and the run takes T = steps × t at t seconds a step. Substitute: T = epochs·n·t/batch, so batch = epochs·n·t/T. This assumes a step takes the same time whatever the batch, which holds only while the GPU has room to spare, so measure t at the batch you pick. Round the batch up: a smaller batch means more steps, and the deadline is missed.

import math

def batch_for_deadline(n, epochs, sec_per_step, T):
    return math.ceil(epochs * n * sec_per_step / T)

def run_time(n, epochs, batch, sec_per_step):
    return math.ceil(epochs * n / batch) * sec_per_step

b = batch_for_deadline(100000, 3, 0.25, 3600)
print(b, run_time(100000, 3, b, 0.25), run_time(100000, 3, b - 1, 0.25))

The trail club's notes model has 100,000 examples, 3 epochs, 0.25 s a step and one hour. The formula gives 20.83, so the batch is 21: 3,571.5 s, inside 3,600. A batch of 20 would take 3,750 s.

Schedules. A learning-rate schedule sets the step size for each training step. Warmup grows the rate in a straight line, lr = lr_max·step/W, so step = lr·W/lr_max. Linear decay from step W to 0 at step S gives lr = lr_max·(S − step)/(S − W), so step = S − (lr/lr_max)(S − W). Exponential decay, lr = lr_max·γ^(step − W) with 0 < γ < 1, peels with a log: step = W + ln(lr/lr_max)/ln γ. Both logs are negative, so the step comes out after W. Cosine decay over T steps, with t counted from the start of the decay, gives lr = lr_max·(1 + cos(πt/T))/2. Peel it: t = T·arccos(2·lr/lr_max − 1)/π. Arccos returns the principal value, from 0 to π, which is exactly the range πt/T covers. Watch it with T = 1,000, showing lr as a share of lr_max.

Quick check
A rate warms up to lr_max by step W = 500, then decays linearly to 0 at step S = 5,500. At which step after warmup is it half of lr_max?
  1. 250
  2. 2,750
  3. 3,000
  4. 2,500
Show the answer

3,000

step = S − (lr/lr_max)(S − W) = 5,500 − 0.5 × 5,000 = 3,000. Check: lr_max × (5,500 − 3,000)/5,000 = half of lr_max.

Quick check
What does this print?
import math

def warm_step(lr, lr_max, W):
    return lr * W / lr_max

def decay_step(lr, lr_max, W, gamma):
    return W + math.log(lr / lr_max) / math.log(gamma)

print(warm_step(5e-4, 1e-3, 2000), math.ceil(decay_step(5e-4, 1e-3, 2000, 0.999)))
  1. 2000.0 2693
  2. 1000.0 693
  3. 1000.0 2693
  4. 1000 2692
Show the answer

1000.0 2693

Warmup reaches half the top rate at 0.5 × 2,000 = 1,000.0. The decay, lr_max·0.999^(step − 2000), halves after ln 0.5 ÷ ln 0.999 ≈ 692.8 more steps: 2,692.8, rounded up to 2693. A rate that rises and then falls hits most values twice.

Drill

Plan the run

Write batch_for_deadline(n, epochs, sec_per_step, T), the smallest whole batch that finishes in T seconds, and step_for_cosine(lr, lr_max, T), the first whole step at which cosine decay has fallen to lr.

import math

def batch_for_deadline(n, epochs, sec_per_step, T):
    return round(epochs * n * sec_per_step / T)

def step_for_cosine(lr, lr_max, T):
    return T * math.acos(lr / lr_max) / math.pi

print(batch_for_deadline(100000, 3, 0.25, 3600), step_for_cosine(2.5e-4, 1e-3, 1000))
In the lesson, your code is checked as you write it.
In your own words
A warmup-then-decay schedule reaches half its top rate twice. Why, and how do you pick the step you need?

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

Goes deeper in

Practice what you just read

  • 3 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

Make n_in the subject of P = n_in·n_out + n_out.

  1. n_in = (P − n_out)/n_out
  2. n_in = P/(n_out + 1)
  3. n_in = P/n_out − n_out
  4. n_in = P − 1/n_out

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.

Part of a free course 19 lessons

Transposition of Formulas: algebraic manipulation in every topic

Learn to make any letter of any formula the subject: layers undone in reverse order, fractions, a letter that appears twice, powers, roots, quadratics, logs, inequalities, trigonometry, vectors, matrices, calculus, probability, statistics and the formulas inside AI models, each checked in Python.

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