Index Ai Academy
Foundation · Putting it together

A transformer block, start to finish

A sentence through embeddings, attention, add and norm, a small network and next-word scores, every shape named.

About 45 minutes · Free lesson

What it covers6

Why it matters

This is where the whole Foundation arrives. The model behind a chat assistant is mostly one block, repeated: the same ten lines, again and again, and every one of them is a lesson you've done. Ids become vectors, the vectors take their places, attention blends them, add and norm steadies them, a small two-layer network reworks each one, add and norm again, and a last product scores every word for the next. This lesson puts the pieces together on one camp-log sentence, names the shape at every line, counts the numbers a block learns, and computes the sentence's loss, first in NumPy and then in PyTorch.

What you'll be able to do

  • Follow a sentence through ids, embeddings and positions, attention, add and norm, a two-layer network, add and norm, and scores for the next word, naming every shape
  • Count a block's parameters as a sum of products, one product per matrix
  • Match each line of the block to the lesson that teaches its math
  • Compute the loss for one sentence in NumPy, then get the same loss from PyTorch's nn.Embedding, nn.Linear and nn.LayerNorm with the same weights
Quick check
Have a guess before you start. A sentence of 5 words goes into a transformer block, each word a vector of 4 numbers. What shape comes out of the block?
  1. 5 × 4, the same as went in
  2. 1 × 4, one vector for the sentence
  3. 5 × 5, one number per pair of words
  4. 4 × 5, turned on its side
Show the answer

5 × 4, the same as went in

A block gives every word a new vector of the same width, so 5 × 4 goes in and 5 × 4 comes out. That's what lets blocks stack: one block's output is the next block's input.

The math: ten lines, one block

Purpose. Write the whole block as ten lines and know the shape at every one.

The sentence is "the tent is on the trail", in the 12-word camp-log vocabulary of lesson 65. The block reads the first five words and, at each place, scores a guess for the word that comes next. One batch of one sentence, 5 words, width 4, vocabulary 12:

  1. ids: each word's place in the vocabulary, 5 numbers (lesson 28).
  2. X = E[ids] + P: each id's row of the 12 × 4 table E, plus each place's row of a 5 × 4 position table P: 5 × 4 (lesson 65).
  3. Q, K, V = XW_Q, XW_K, XW_V: three 4 × 4 layers: 5 × 4 each (lesson 56).
  4. S = QKᵀ/√4, with the causal mask: 5 × 5 (lesson 57).
  5. A = softmax(S) row by row, 5 × 5, then AV: 5 × 4 (lesson 113).
  6. X = LN(X + AV): add and norm, 5 × 4 (lesson 114).
  7. H = relu(XW₁ + b₁): widen each word to 16: 5 × 16 (lesson 110).
  8. X = LN(X + HW₂ + b₂): back to 4, add and norm: 5 × 4.
  9. scores = XEᵀ: one score per vocabulary word at each place: 5 × 12 (lesson 65).
  10. loss: softmax each row, then the mean of −log of each right next word's chance: one number (lesson 105).
Quick check
From lesson 65: a table E is 12 × 4 and a sentence has 5 ids. What shape is E[ids]?
  1. 5 × 4
  2. 12 × 4
  3. 5 × 12
  4. 4 × 5
Show the answer

5 × 4

Each id brings back its row of 4 numbers, so 5 ids give 5 rows: 5 × 4. That's line 2's X before the positions are added, and the positions are 5 × 4 too.

The picture. Here is the block as boxes, with the shape that leaves each one written on its arrow. Press Next to walk the ten lines: each lights the box it works in and writes its shape under it. Two shapes only live inside a box, the 5 × 5 attention table and the 5 × 16 hidden layer, and between boxes it's 5 × 4 all the way.

Try it now

Every arrow between boxes carries 5 × 4: that's why blocks can be stacked.

Counting the parameters. Every number the block learns sits in one of its tables, and a table with r rows and c columns holds r × c numbers. So the count is a sum of products:

parameters=∑tablesrows×columns\text{parameters} = \sum_{\text{tables}} \text{rows} \times \text{columns}

In plain words: size up each table, multiply its sides, add them all.

In block order: E is 12 × 4 = 48 and P is 5 × 4 = 20; W_Q, W_K and W_V are 4 × 4 = 16 each; the first layer norm's γ and β are 2 × 4 = 8; W₁ is 4 × 16 = 64 and b₁ is 1 × 16 = 16; W₂ is 16 × 4 = 64 and b₂ is 1 × 4 = 4; the second norm has 8 more. The scores reuse E, so they add nothing. Step through the total: the bars are the eleven tables, x₁ to x₁₁ in that order.

Quick check
The block's width grows from 4 to 8, with everything else the same. How many numbers does W_Q hold now?
  1. 16
  2. 64
  3. 32
  4. 8
Show the answer

64

W_Q is width × width, so 8 × 8 = 64: doubling the width multiplies it by four. That's why wide models get big fast.

In your own words
In your own words: why does every arrow between the block's boxes carry the same shape, 5 × 4?

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

In Python: the whole forward pass

Purpose. Run the block on the camp-log sentence in NumPy, from ids to loss, reusing each lesson's function.

import numpy as np

vocab = ["by", "fire", "is", "lake", "lit", "on", "rain", "the", "tent", "trail", "up", "wet"]
E = np.array([[0.0, 0.1, 0.0, 0.9], [0.8, -0.7, 0.9, 0.0], [0.0, 0.0, 0.1, 0.8],
              [0.7, 0.9, -0.3, 0.0], [0.1, -0.5, 0.8, 0.2], [0.0, 0.0, 0.0, 0.9],
              [0.5, 0.9, -0.4, 0.1], [0.0, 0.0, 0.0, 1.0], [0.9, 0.2, 0.1, 0.0],
              [0.9, -0.1, 0.0, 0.1], [0.1, 0.0, 0.2, 0.6], [0.2, 0.8, -0.6, 0.3]])
rng = np.random.default_rng(0)
P = rng.normal(0, 0.1, (5, 4))
W_Q, W_K, W_V = rng.normal(0, 0.5, (3, 4, 4))
W1, b1 = rng.normal(0, 0.5, (4, 16)), np.zeros(16)
W2, b2 = rng.normal(0, 0.25, (16, 4)), np.zeros(4)

def softmax(S):
    e = np.exp(S - S.max(axis=1, keepdims=True))
    return e / e.sum(axis=1, keepdims=True)

def attention(X):
    Q, K, V = X @ W_Q, X @ W_K, X @ W_V
    S = np.where(np.tril(np.ones((5, 5))) == 1, Q @ K.T / np.sqrt(4), -np.inf)
    return softmax(S) @ V

def layer_norm(X):
    mu = X.mean(axis=1, keepdims=True)
    return (X - mu) / np.sqrt(((X - mu) ** 2).mean(axis=1, keepdims=True) + 1e-5)

ids = []
for w in ["the", "tent", "is", "on", "the", "trail"]:
    ids.append(vocab.index(w))
X = E[ids[:5]] + P
X = layer_norm(X + attention(X))
X = layer_norm(X + np.maximum(X @ W1 + b1, 0) @ W2 + b2)
probs = softmax(X @ E.T)
right = probs[np.arange(5), ids[1:]]
print(ids, X.shape, probs.shape)
print(right.round(4).tolist())
print(round(-np.mean(np.log(right)), 4), round(np.log(12), 4))

E is the table from lesson 65; P and the W's come from a seeded random generator (lesson 88), as an untrained model's would, and the biases and the norms' γ and β start at 0 and 1, so the code leaves the norms' out. The block reads ids[:5] and is judged on ids[1:], the next word at every place. probs[np.arange(5), ids[1:]] picks, in each of the 5 rows, the chance of that row's right next word.

Reading the output. The ids are 7, 8, 2, 5, 7 and 9; X comes out 5 × 4 and the chances 5 × 12. The block gives the right next words chances of 0.0225, 0.0228, 0.1711, 0.1944 and 0.0349, and the loss is 2.8665. Guessing all 12 words evenly would give each a chance of 1/12 and a loss of ln 12 = 2.4849, so this block, with random weights, does worse than guessing. Training is what pulls 2.8665 down.

Code flow. Step through the attention half of the block, lines 3 to 6, on five words already embedded (random numbers, to keep the code short). The mask goes straight into the exponential, so hidden places come out as exactly 0, and these scores are small enough to skip subtracting the largest. Watch every matrix keep 5 rows.

Worked example

Worked example: positions go in before attention

A named mistake is adding the positions after attention instead of before. Compare the last word's attention output for "the tent is on the" and "the is tent on the", both ways.

import numpy as np

E = np.array([[0.0, 0.1, 0.0, 0.9], [0.8, -0.7, 0.9, 0.0], [0.0, 0.0, 0.1, 0.8],
              [0.7, 0.9, -0.3, 0.0], [0.1, -0.5, 0.8, 0.2], [0.0, 0.0, 0.0, 0.9],
              [0.5, 0.9, -0.4, 0.1], [0.0, 0.0, 0.0, 1.0], [0.9, 0.2, 0.1, 0.0],
              [0.9, -0.1, 0.0, 0.1], [0.1, 0.0, 0.2, 0.6], [0.2, 0.8, -0.6, 0.3]])
rng = np.random.default_rng(0)
P = rng.normal(0, 0.1, (5, 4))
W_Q, W_K, W_V = rng.normal(0, 0.5, (3, 4, 4))

def attention(X):
    S = (X @ W_Q) @ (X @ W_K).T / np.sqrt(4)
    S = np.where(np.tril(np.ones((5, 5))) == 1, S, -np.inf)
    A = np.exp(S - S.max(axis=1, keepdims=True))
    return (A / A.sum(axis=1, keepdims=True)) @ (X @ W_V)

a = E[[7, 8, 2, 5, 7]]
b = E[[7, 2, 8, 5, 7]]
print(np.allclose(attention(a)[4], attention(b)[4]))
print(np.allclose(attention(a + P)[4], attention(b + P)[4]))
In the lesson you can change this and run it.

Without positions, the last word gets exactly the same output for both orders: True. Attention blends a set of vectors, and swapping "tent" and "is" doesn't change the set the last word sees. With P added first, the vectors know their places, and the two orders differ: False. Adding P after attention would be too late: attention has already blended the words without knowing their order.

Quick check
What does this print?
import numpy as np

X = np.zeros((5, 4))
W1 = np.zeros((4, 16))
E = np.zeros((12, 4))
print((X @ W1).shape, (X @ E.T).shape, (X @ X.T).shape)
  1. (5, 16) (5, 12) (5, 5)
  2. (5, 16) (5, 4) (4, 4)
  3. (4, 16) (12, 5) (5, 5)
  4. (5, 4) (5, 12) (5, 5)
Show the answer

(5, 16) (5, 12) (5, 5)

The inner sizes meet and drop out: (5 × 4)(4 × 16) is 5 × 16, (5 × 4)(4 × 12) is 5 × 12, and (5 × 4)(4 × 5) is 5 × 5. These are lines 7, 9 and 4's shapes.

Drill

Count any block

Write block_params(V, n, d, h): the parameters of this lesson's block for a vocabulary of V words, n places, width d and a hidden width h. Count E, P, W_Q, W_K, W_V, both layer norms, W₁, b₁, W₂ and b₂. The starter leaves some out.

def block_params(V, n, d, h):
    embed = V * d
    attention = d * d
    network = d * h + h * d
    return embed + attention + network

print(block_params(12, 5, 4, 16))
In the lesson, your code is checked as you write it.
In your own words
Why must the positions be added before attention, not after?

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

In AI and ML: the same block in PyTorch, and a real one

Purpose. Build the block from PyTorch's parts, get the same loss, and see a trained model run the same steps.

In PyTorch. The same block, from PyTorch's parts. nn.Embedding(12, 4) holds E and nn.Embedding(5, 4) holds P (torch.arange(5) is the places 0 to 4). Three nn.Linear(4, 4, bias=False) layers are W_Q, W_K and W_V, nn.LayerNorm(4) is each norm, and nn.Sequential stacks the network's two layers with nn.ReLU() between. The NumPy weights are loaded with copy_, each W turned around with .T, since a layer stores (out, in) (lesson 55). F.cross_entropy(scores, ids[1:]) does line 10 in one call: softmax, pick the right words, mean of −log. Last, a loop adds up numel(), the entries in each parameter.

import numpy as np
import torch
import torch.nn as nn
import torch.nn.functional as F

E = torch.tensor([[0.0, 0.1, 0.0, 0.9], [0.8, -0.7, 0.9, 0.0], [0.0, 0.0, 0.1, 0.8],
                  [0.7, 0.9, -0.3, 0.0], [0.1, -0.5, 0.8, 0.2], [0.0, 0.0, 0.0, 0.9],
                  [0.5, 0.9, -0.4, 0.1], [0.0, 0.0, 0.0, 1.0], [0.9, 0.2, 0.1, 0.0],
                  [0.9, -0.1, 0.0, 0.1], [0.1, 0.0, 0.2, 0.6], [0.2, 0.8, -0.6, 0.3]])
rng = np.random.default_rng(0)
P = torch.tensor(rng.normal(0, 0.1, (5, 4))).float()
W_Q, W_K, W_V = torch.tensor(rng.normal(0, 0.5, (3, 4, 4))).float()
W1 = torch.tensor(rng.normal(0, 0.5, (4, 16))).float()
W2 = torch.tensor(rng.normal(0, 0.25, (16, 4))).float()

emb, pos = nn.Embedding(12, 4), nn.Embedding(5, 4)
to_q, to_k, to_v = nn.Linear(4, 4, bias=False), nn.Linear(4, 4, bias=False), nn.Linear(4, 4, bias=False)
norm1, norm2 = nn.LayerNorm(4), nn.LayerNorm(4)
net = nn.Sequential(nn.Linear(4, 16), nn.ReLU(), nn.Linear(16, 4))
with torch.no_grad():
    emb.weight.copy_(E)
    pos.weight.copy_(P)
    to_q.weight.copy_(W_Q.T)
    to_k.weight.copy_(W_K.T)
    to_v.weight.copy_(W_V.T)
    net[0].weight.copy_(W1.T)
    net[0].bias.zero_()
    net[2].weight.copy_(W2.T)
    net[2].bias.zero_()

ids = torch.tensor([7, 8, 2, 5, 7, 9])
X = emb(ids[:5]) + pos(torch.arange(5))
Q, K, V = to_q(X), to_k(X), to_v(X)
hide = torch.triu(torch.ones(5, 5), diagonal=1) == 1
A = F.softmax((Q @ K.T / 4 ** 0.5).masked_fill(hide, float("-inf")), dim=-1)
X = norm1(X + A @ V)
X = norm2(X + net(X))
scores = X @ emb.weight.T
loss = F.cross_entropy(scores, ids[1:])
print(scores.shape, round(loss.item(), 4))

count = 0
for p in nn.ModuleList([emb, pos, to_q, to_k, to_v, norm1, net, norm2]).parameters():
    count = count + p.numel()
print(count)

The same loss as NumPy, 2.8665, from the same weights, and 280 parameters, the count the flow added up. The scores are 5 × 12, and scores = X @ emb.weight.T reuses the embedding table at the end, as lesson 65 called tying.

Quick check
The NumPy block multiplies X @ W_Q. Why does the PyTorch cell load W_Q.T into to_q.weight?
  1. W_Q.T is a copy of W_Q, and copy_ only takes copies
  2. Turning the weight around makes the layer run faster
  3. nn.Linear stores its weight as (out, in), turned around
  4. PyTorch reads every matrix product from right to left
Show the answer

nn.Linear stores its weight as (out, in), turned around

nn.Linear computes x @ weight.T with weight stored as (out, in). Loading W_Q.T makes weight.T equal W_Q, so to_q(X) is X @ W_Q, the NumPy line exactly.

A real one. A trained model runs these same lines, with three changes you'll meet again. It has several attention heads side by side, each with its own W_Q, W_K and W_V. It puts each norm before its part instead of after, X + attention(LN(X)), which trains more steadily in deep stacks. And its network bends with GELU, a smooth relu. Below is the academy's small trained model, a few such blocks deep, running on this page. Type a start and watch what it predicts next, then look at where its words attend.

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

scores = torch.zeros(5, 12)
print(round(F.cross_entropy(scores, torch.tensor([8, 2, 5, 7, 9])).item(), 4))
  1. 2.4849
  2. 12.0
  3. 0.0
  4. 0.0833
Show the answer

2.4849

Equal scores give every word a chance of 1/12, so each −log is ln 12 = 2.4849, and so is their mean: the loss of guessing evenly, the line the block above failed to beat.

Drill

Does the block beat guessing?

right holds the chances the block gave the five right next words, as the NumPy cell printed them. Set loss to the sentence's loss, guess to the loss of guessing all 12 words evenly, better to whether the block beats guessing, and perplexity to e to the loss: how many words, evenly, the block is as unsure as. The starter has three slips.

import numpy as np

right = np.array([0.0225, 0.0228, 0.1711, 0.1944, 0.0349])
loss = np.mean(np.log10(right))
guess = np.log(12)
better = loss > guess
perplexity = np.exp(guess)
print(round(loss, 3), round(guess, 4), better, round(perplexity, 1))
In the lesson, your code is checked as you write it.
In your own words
You now know every line of a transformer block. What does training change, and what stays the same?

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

In a block reading 5 words of width 4, what shape is the attention table A?

  1. 5 × 5
  2. 5 × 4
  3. 4 × 4
  4. 5 × 12

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