Index Ai Academy
Foundation · Putting it together

A layer and a small network as matrices

Two layers on a batch, the shape of every matrix, adding a hidden unit, and XOR solved.

About 45 minutes · Free lesson

What it covers6

Why it matters

Lesson 109's single neuron could only draw one straight line, so it failed at XOR. The fix is to put several neurons side by side, a layer, and feed their outputs into another layer. Written one neuron at a time, that's a tangle of sums; written as matrices, it's two matrix products (lesson 56) with a relu and a softmax between them, and a whole batch of examples goes through at once. That is exactly how every network library computes, from this lesson's toy to a language model: a stack of "multiply by a matrix, add a bias, apply an activation", which PyTorch builds with nn.Sequential. The skill that makes it manageable is keeping track of shapes. Every bug in this lesson's code is a shape that doesn't line up, and every shape follows from two rules you already know.

What you'll be able to do

  • Push a whole batch through two layers: Z₁ = XW₁ + b₁, A₁ = relu(Z₁), Z₂ = A₁W₂ + b₂, P = softmax(Z₂)
  • Name the shape of every matrix along the way, and compute single entries by hand
  • Write the forward pass in six lines of NumPy, and add a hidden unit by fixing every shape
  • See hidden units fit a problem one neuron can't, score a small network on a batch of signs, and build the same network from PyTorch's nn.Sequential
Quick check
Have a guess before you start. A batch of 8 signs with 3 features each goes through a layer with 4 hidden units. What shape is X @ W₁?
  1. 3 × 4
  2. 8 × 3
  3. 4 × 8
  4. 8 × 4
Show the answer

8 × 4

X is 8 × 3 and W₁ is 3 × 4; the inner 3s match and the result keeps the outer sizes: one row per sign, one column per hidden unit.

The math: two layers, one batch

Purpose. Compute a small network's predictions for a whole batch, and know every shape on the way.

Stack the batch's examples as the rows of a matrix X, n rows of d features. A layer of h neurons is a weight matrix W₁ of shape d × h, one column per neuron, plus a bias b₁ with h entries. The whole forward pass:

stepformulashape
hidden scoresZ₁ = X W₁ + b₁(n × d)(d × h) → n × h
hidden outputsA₁ = relu(Z₁)n × h
class scoresZ₂ = A₁ W₂ + b₂(n × h)(h × k) → n × k
chancesP = softmax(Z₂), row by rown × k
lossL = mean of −log P[right class]one number

Each row of every matrix belongs to one example, all the way through. The bias b₁ is added to every row: lesson 64's broadcasting.

Quick check
From lesson 56: what is the shape of (8 × 3)(3 × 4)?
  1. It can't be multiplied
  2. 8 × 3
  3. 8 × 4
  4. 3 × 3
Show the answer

8 × 4

The inner sizes, 3 and 3, must match; the result has the outer sizes, 8 × 4.

The picture. Here is the table drawn as boxes, for the batch from the opening question: 8 signs, 3 features, 4 hidden units and 3 classes. Each box is one step, and each arrow carries a matrix, labeled with its shape. Press Next, and say each new shape before it appears.

Try it now

XOR, by hand. The four inputs (0, 0), (0, 1), (1, 0) and (1, 1) are the rows of X. A hidden layer of two relu neurons, both with weights (1, 1), and biases 0 and −1: the first counts how many inputs are on, the second fires only when both are. Step through the first layer. The drawing is the whole network, with the examples passing through one at a time: an example's inputs on the left, the two hidden units in the middle, each starting at its bias, and on the right the two class scores, waiting for the second layer.

The second layer reads the hidden outputs. Its weights W₂ = [[0, 4], [0, −8]] and bias b₂ = (2, 0) give two class scores per example, "no" and "yes": the "yes" score is 4 × (inputs on) − 8 × (both on). Step through it. In the drawing, each example now goes all the way: in on the left, through the hidden units, and out as two scores.

Symbols and formula.

Z1=XW1+b1,A1=relu(Z1),Z2=A1W2+b2,P=softmax(Z2),L=−1n∑ilog⁡Pi,yiZ_1 = XW_1 + b_1,\quad A_1 = \text{relu}(Z_1),\quad Z_2 = A_1W_2 + b_2,\quad P = \text{softmax}(Z_2),\quad L = -\tfrac{1}{n}\textstyle\sum_i \log P_{i,y_i}

In plain words: each layer multiplies by its weights, adds its bias and applies its activation; the last one's scores become chances, and the loss averages −log of the right class's chance over the batch.

For XOR every right answer gets 0.881, so the loss is −log 0.881 = 0.127, against lesson 109's stuck 0.693. One entry by hand checks the shapes: Z₁ for example 3, unit 1, is row 3 of X dotted with column 1 of W₁ plus b₁'s first entry, 1 × 1 + 0 × 1 + 0 = 1. Count the parameters: W₁ has d × h, b₁ has h, W₂ has h × k and b₂ has k. With 3 features, 4 hidden units and 3 classes that's 12 + 4 + 12 + 3 = 31 numbers to learn.

Quick check
A network has 4 hidden units and 3 classes. What shape is W₂?
  1. 4 × 3
  2. n × 3
  3. 4 × 4
  4. 3 × 4
Show the answer

4 × 3

W₂ takes each example's 4 hidden outputs to 3 class scores: (n × 4)(4 × 3) → n × 3.

In your own words
In your own words: how did the hidden layer make XOR solvable when one neuron couldn't do it?

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

In Python: the forward pass in six lines

Purpose. Run a batch through the network with matrix products, and keep every shape straight.

import numpy as np

X = np.array([[0.0, 0.0], [0.0, 1.0], [1.0, 0.0], [1.0, 1.0]])
Y = np.array([[1.0, 0.0], [0.0, 1.0], [0.0, 1.0], [1.0, 0.0]])
W1 = np.array([[1.0, 1.0], [1.0, 1.0]])
b1 = np.array([0.0, -1.0])
W2 = np.array([[0.0, 4.0], [0.0, -8.0]])
b2 = np.array([2.0, 0.0])

Z1 = X @ W1 + b1
A1 = np.maximum(Z1, 0)
Z2 = A1 @ W2 + b2
E = np.exp(Z2 - Z2.max(axis=1, keepdims=True))
P = E / E.sum(axis=1, keepdims=True)
loss = -np.mean(np.sum(Y * np.log(P), axis=1))
print(P.round(3).tolist(), round(float(loss), 3))
It runs right here in your browser, with nothing to install.

Y holds the right answers one-hot, one row per example, so np.sum(Y * np.log(P), axis=1) picks out the log of each right class's chance. Six lines of arithmetic, the whole forward pass, for any batch size.

Code flow. Step through the same lines one at a time. Each array shows as a grid of boxes, like the boxes in the math part's flows, and X, Z1, A1, Z2 and P keep one row per example: Z1 and A1 are the first flow's numbers before and after relu, and Z2 is the second flow's answer. Watch every line keep the batch's four rows until the last one, the loss.

A named mistake: a bias of the wrong length. b₁ must have one entry per hidden unit, h of them, so that broadcasting adds it to every row. A bias with one entry per example, n of them, is wrong, but when n happens to equal h NumPy adds it without complaint, across the wrong axis. Print the shapes after every line the first time: Z₁ should be n × h, and b₁ should have shape (h,).

Worked example

Worked example: shapes at every step

Send a batch of 8 signs with 3 features through 4 hidden units to 3 classes, and print each shape.

import numpy as np

X = np.ones((8, 3))
W1 = np.ones((3, 4))
b1 = np.zeros(4)
W2 = np.ones((4, 3))
b2 = np.zeros(3)
Z1 = X @ W1 + b1
A1 = np.maximum(Z1, 0)
Z2 = A1 @ W2 + b2
print(X.shape, W1.shape, Z1.shape, A1.shape, W2.shape, Z2.shape)
print(W1.size + b1.size + W2.size + b2.size)
In the lesson you can change this and run it.

The numbers are placeholders; only the shapes matter here. X (8, 3) times W₁ (3, 4) gives Z₁ (8, 4); relu keeps the shape; A₁ (8, 4) times W₂ (4, 3) gives Z₂ (8, 3), one score per sign per class. The last line counts the parameters, 31, all of which training will set. A shape printout like this is the first thing to write when a network's code fails.

Quick check
What does this print?
import numpy as np

X = np.ones((8, 3))
W1 = np.ones((3, 4))
W2 = np.ones((4, 3))
Z1 = X @ W1
Z2 = Z1 @ W2
print(Z1.shape, Z2.shape)
  1. (3, 4) (4, 3)
  2. (8, 4) (4, 3)
  3. (8, 3) (8, 4)
  4. (8, 4) (8, 3)
Show the answer

(8, 4) (8, 3)

(8 × 3)(3 × 4) → (8, 4), and (8 × 4)(4 × 3) → (8, 3): one row per sign throughout.

Drill

Add a hidden unit

Grow the sign network from 4 hidden units to 5 without changing its predictions: give W1b a fifth column of zeros, b1b a fifth bias of 0, and W2b a fifth row of zeros. Then set same to whether the new network's chances match the old ones.

import numpy as np

def forward(X, W1, b1, W2, b2):
    A1 = np.maximum(X @ W1 + b1, 0)
    Z2 = A1 @ W2 + b2
    E = np.exp(Z2 - Z2.max(axis=1, keepdims=True))
    return E / E.sum(axis=1, keepdims=True)

W1 = np.array([[0.0, 3.1, -0.3, -0.9], [-0.9, 0.2, -0.2, 3.6], [-0.2, -2.3, -0.4, -2.3]])
b1 = np.array([0.0, 1.1, 0.0, 0.3])
W2 = np.array([[0.1, -0.2, 0.1], [3.2, -0.3, -2.5], [0.9, 0.2, -0.5], [-1.0, 3.5, -2.3]])
b2 = np.array([-2.9, -2.0, 4.9])
X = np.array([[0.9, 0.1, 0.2], [0.1, 0.8, 0.2], [0.2, 0.2, 0.9]])
W1b = W1
b1b = b1
W2b = W2
same = False
print(W1b.shape, b1b.shape, W2b.shape, same)
In the lesson, your code is checked as you write it.
In your own words
Adding a hidden unit changed three arrays. Why did W₁ gain a column but W₂ gain a row?

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

In AI and ML: what hidden units are for

Purpose. See a small network classify a batch, and read its mistakes.

Each hidden unit draws its own line through the input space and reports which side an example is on. The next layer combines those reports, so the network can carve out regions no single line could: XOR above, or three kinds of trail sign below. More hidden units mean more lines and more complicated regions; more layers let features be built from features.

Quick check
What does a hidden layer give a network that a single neuron lacks?
  1. Several lines, combined into one decision
  2. Fewer parameters to learn overall
  3. A different loss
  4. Faster training, since layers share work
Show the answer

Several lines, combined into one decision

Each hidden unit draws a line; the next layer combines them, which is what XOR needed.

Quick check
What does this print? (XOR's first layer, then its yes-score weights.)
import numpy as np

x = np.array([1.0, 1.0])
W1 = np.array([[1.0, 1.0], [1.0, 1.0]])
b1 = np.array([0.0, -1.0])
h = np.maximum(x @ W1 + b1, 0)
print(h.tolist(), float(h @ np.array([4.0, -8.0])))
  1. [2.0, 1.0] 16.0
  2. [2.0, 2.0] -8.0
  3. [1.0, 1.0] -4.0
  4. [2.0, 1.0] 0.0
Show the answer

[2.0, 1.0] 0.0

Both inputs on: the first unit counts 2, the second fires with 1, and 4 × 2 − 8 × 1 = 0: no reason to say yes.

In PyTorch. Real code builds this network from ready-made layers. nn.Sequential, the chain you met in lesson 20, feeds each layer's output into the next: nn.Linear(2, 2) is a layer with 2 inputs and 2 outputs that computes XW + b; nn.ReLU() is relu as a layer; and a second nn.Linear(2, 2) makes the two class scores. net[0] and net[2] are the two layers. New layers start with random weights, so the cell loads XOR's hand weights under torch.no_grad(), as in lesson 55. A layer stores its weights as (out, in), the transpose of this lesson's W (lesson 56), so each W goes in as .T.

import torch
import torch.nn as nn
import torch.nn.functional as F

X = torch.tensor([[0.0, 0.0], [0.0, 1.0], [1.0, 0.0], [1.0, 1.0]])
y = torch.tensor([0, 1, 1, 0])
net = nn.Sequential(nn.Linear(2, 2), nn.ReLU(), nn.Linear(2, 2))
with torch.no_grad():
    net[0].weight.copy_(torch.tensor([[1.0, 1.0], [1.0, 1.0]]).T)
    net[0].bias.copy_(torch.tensor([0.0, -1.0]))
    net[2].weight.copy_(torch.tensor([[0.0, 4.0], [0.0, -8.0]]).T)
    net[2].bias.copy_(torch.tensor([2.0, 0.0]))
Z2 = net(X)
print(Z2.tolist())
print(Z2.argmax(dim=1).tolist(), round(F.cross_entropy(Z2, y).item(), 3))

The first line is the second flow's Z₂, number for number. F.cross_entropy takes the scores and the right classes, 0 for no and 1 for yes, and does the softmax and the average −log itself: 0.127, the loss the NumPy cell printed. The predictions, 0, 1, 1, 0, are XOR. Mind the .T. W₂ is square, so it also loads without .T, with no error, and the scores come out wrong. Check one row against your hand numbers whenever you load weights.

Quick check
The sign network has 3 features, 4 hidden units and 3 classes. What does this print?
import torch
import torch.nn as nn

net = nn.Sequential(nn.Linear(3, 4), nn.ReLU(), nn.Linear(4, 3))
print(net[0].weight.shape, net[2].weight.shape)
  1. torch.Size([3, 4]) torch.Size([3, 4])
  2. torch.Size([4, 3]) torch.Size([3, 4])
  3. torch.Size([3, 4]) torch.Size([4, 3])
  4. torch.Size([4, 3]) torch.Size([4, 3])
Show the answer

torch.Size([4, 3]) torch.Size([3, 4])

nn.Linear(3, 4) stores (out, in), 4 × 3: one row of 3 weights per hidden unit. nn.Linear(4, 3) stores 3 × 4. Each is the transpose of this lesson's W, which is why the cell above loads W.T.

Eight signs. A sign is described by three features, how pointed it is, how wide and how tall, and a network with 4 hidden units and 3 classes (arrow, tent, trail) has already been trained; its weights, rounded to one decimal, are in the cell below. Run on eight new signs, it gets seven right, an accuracy of 0.875, with an average loss of 0.258. The miss is instructive: sign 7, features (0.5, 0.5, 0.2), is really a tent, and the network says arrow. Here is that one sign going through, with the hidden outputs, the scores and the chances printed:

import numpy as np

W1 = np.array([[0.0, 3.1, -0.3, -0.9], [-0.9, 0.2, -0.2, 3.6], [-0.2, -2.3, -0.4, -2.3]])
b1 = np.array([0.0, 1.1, 0.0, 0.3])
W2 = np.array([[0.1, -0.2, 0.1], [3.2, -0.3, -2.5], [0.9, 0.2, -0.5], [-1.0, 3.5, -2.3]])
b2 = np.array([-2.9, -2.0, 4.9])
x = np.array([0.5, 0.5, 0.2])
a1 = np.maximum(x @ W1 + b1, 0)
z2 = a1 @ W2 + b2
e = np.exp(z2 - z2.max())
print(a1.round(2).tolist(), z2.round(2).tolist(), (e / e.sum()).round(2).tolist())

Two hidden units fire. The second, at 2.29, rises with pointed and falls with tall (its weights are 3.1 and −2.3); the fourth, at 1.19, rises with wide (3.6) and also falls with tall. The arrow score leans on the second unit (weight 3.2), the tent score on the fourth (weight 3.5), and the second unit's bigger value wins: arrow 3.24, tent 1.48, which softmax turns into 0.85 for arrow. Half pointed and half wide, the sign sets off both detectors, and the network is confidently wrong there, a hint that it saw few examples like it. That's what a held-back batch is for.

Drill

Score the network on eight signs

Run the trained network on the eight signs. Set pred to the predicted class of each (0 arrow, 1 tent, 2 trail) as a list, acc to the accuracy, and loss to the average cross-entropy (natural log) with the one-hot Y, rounded to 3.

import numpy as np

W1 = np.array([[0.0, 3.1, -0.3, -0.9], [-0.9, 0.2, -0.2, 3.6], [-0.2, -2.3, -0.4, -2.3]])
b1 = np.array([0.0, 1.1, 0.0, 0.3])
W2 = np.array([[0.1, -0.2, 0.1], [3.2, -0.3, -2.5], [0.9, 0.2, -0.5], [-1.0, 3.5, -2.3]])
b2 = np.array([-2.9, -2.0, 4.9])
X = np.array([[0.9, 0.1, 0.2], [0.8, 0.3, 0.1], [0.1, 0.8, 0.2], [0.3, 0.9, 0.4], [0.2, 0.2, 0.9], [0.1, 0.4, 0.8], [0.5, 0.5, 0.2], [0.4, 0.3, 0.6]])
y = np.array([0, 0, 1, 1, 2, 2, 1, 2])
Y = np.zeros((8, 3))
for i in range(8):
    Y[i, y[i]] = 1.0
pred = []
acc = 0
loss = 0
print(pred, acc, loss)
In the lesson, your code is checked as you write it.
In your own words
The network called sign 7 an arrow with 0.85 confidence, but it was a tent. What would you look at, and what might fix it?

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

In Z₁ = X W₁ + b₁, what does each row of Z₁ hold?

  1. One example's scores for every hidden unit
  2. One hidden unit's scores for every example
  3. The weights of one unit
  4. The whole batch's average

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