Index Ai Academy
Foundation · Putting it together

One neuron, start to finish

Weighted sum, activation, loss, slopes and update, by hand and in code, and what one straight line can and can't split.

About 45 minutes · Free lesson

What it covers6

Why it matters

This module adds no new math. Every formula in it was taught and practiced in Modules 1 to 7; what's new is running them together, the way a real system does. It starts with the smallest thing that learns: one neuron. Its training step is five familiar pieces, a weighted sum, an activation, a loss, slopes by the chain rule and an update, and once they run as one loop, the neuron learns. You'll take that step by hand, in NumPy and in PyTorch, then see exactly what one neuron can and cannot learn, which explains why networks stack them: the next lesson.

What you'll be able to do

  • Follow one neuron through a full training step by hand: weighted sum, activation, loss, slopes, update
  • Name the earlier lesson behind each of the five steps
  • Write the five steps as five lines of NumPy, then loop them until the loss reaches a target
  • Take the same step in PyTorch with backward() and optim.SGD, and get the hand numbers back
  • See what a single neuron can learn, a split of the plane by a straight line, and what it can't
Quick check
Have a guess before you start. A neuron gets inputs (2, 1), weights (0.5, −1) and bias 0.5. What is its weighted sum z = w·x + b?
  1. 0.5
  2. 2.5
  3. 1.5
  4. −0.5
Show the answer

0.5

0.5 × 2 + (−1) × 1 + 0.5 = 1 − 1 + 0.5 = 0.5: a dot product plus the bias.

The math: five steps, all known

Purpose. Run one complete training step of one neuron by hand.

A neuron with two inputs has two weights w₁ and w₂ and a bias b. Here the inputs are x = (2, 1), the weights (0.5, −1), the bias 0.5, and the target, the answer it should give, is y = 1. One training step:

  1. Weighted sum (lesson 50): z = w₁x₁ + w₂x₂ + b = 1 − 1 + 0.5 = 0.5.
  2. Activation (lesson 71): a = relu(z) = max(0, z) = 0.5.
  3. Loss (lesson 79): L = (a − y)² = (0.5 − 1)² = 0.25.
  4. Slopes (lessons 74 and 81): backward through each step, multiplying local slopes.
  5. Update (lesson 79): every weight moves against its slope, by the learning rate.

Steps 1 to 3 are the forward pass, step 4 the backward pass. Step 4 is the only one with any work in it, and it's lesson 81's graph again: seven small steps, walked backward.

Quick check
From lesson 74: y depends on u, and u on x, with dy/du = −1 and du/dx = 2. What is dy/dx?
  1. −2
  2. 1
  3. 2
  4. −0.5
Show the answer

−2

The chain rule multiplies the links: −1 × 2 = −2.

The picture. The flow draws the neuron as that graph. Six circles start with a number: the inputs and weights on the left, the bias b, which joins at z, and the target y, which joins at e. Each empty circle is one small step: p₁ and p₂ multiply an input by its weight, s adds them, z adds the bias, a is the relu, e is the error a − y, and L squares it. Forward, each value is written in its circle. Backward, the slope of L for each value is written under its circle after a ∂, and the arrow that slope came back along keeps the local slope it was multiplied by, after a ×. On the PyTorch tab, the whole backward pass is one call, L.backward().

Try it now

With b = −1.5 instead, z would be negative, relu would give 0, and every weight's slope would be 0: a "dead" neuron learns nothing from this example.

Symbols and formula. For a relu neuron with squared loss, the backward pass collapses to:

∂L∂z=2(a−y)⋅[z>0]∂L∂wj=∂L∂z xj∂L∂b=∂L∂z\frac{\partial L}{\partial z} = 2(a - y)\cdot[z > 0] \qquad \frac{\partial L}{\partial w_j} = \frac{\partial L}{\partial z}\,x_j \qquad \frac{\partial L}{\partial b} = \frac{\partial L}{\partial z}

In plain words: the loss pushes back by twice the error, relu passes the push only if the neuron was on, and each weight's share is the push times its own input.

The update. With learning rate 0.1, each weight and the bias step against their slopes: w₁ = 0.5 − 0.1 × (−2) = 0.7, w₂ = −1 − 0.1 × (−1) = −0.9, and b = 0.5 − 0.1 × (−1) = 0.6. Here is the whole step on the neuron drawn as one unit of a network, the way the next lessons draw it. Its third input is always 1, so the weight on that arrow is the bias: that's why ∂L/∂b is ∂L/∂z times 1. Press Next for the backward pass, then the update.

Quick check
∂L/∂z = −1 for an example with inputs (3, 0). What are the slopes of w₁ and w₂?
  1. 3 and 0
  2. −1 and −1
  3. −3 and −1
  4. −3 and 0
Show the answer

−3 and 0

Each weight's slope is ∂L/∂z times its input: −1 × 3 and −1 × 0. A zero input means its weight isn't touched.

In your own words
In your own words: why does a neuron with a negative z, under relu, learn nothing from that example?

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

In Python: five lines, then a loop

Purpose. Write the five steps as code, then repeat them until the loss is small.

import numpy as np

x = np.array([2.0, 1.0])
w = np.array([0.5, -1.0])
b = 0.5
y = 1.0
z = float(w @ x + b)
a = max(z, 0.0)
L = (a - y) ** 2
dz = 2 * (a - y) * (z > 0)
w = w - 0.1 * dz * x
b = b - 0.1 * dz
print(L, w.tolist(), round(b, 4))
print(round((max(float(w @ x + b), 0.0) - y) ** 2, 4))

From z on, the lines are the five steps: sum, activation, loss, slope, and the update, which takes two lines, one for w and one for b. float() makes z a plain Python number instead of a NumPy one. (z > 0) is True or False, which counts as 1 or 0: relu's slope. The loss falls from 0.25 to 0.01 after one step, matching the hand calculation.

Code flow. Step through the same lines one at a time and watch the variables. z, a and L appear in the forward pass; dz is the push the backward pass sends back to z; and the last two lines move w and b. w shows as two boxes, the two weights from the math part's pictures.

A named mistake: updating one weight before computing the others' slopes. If w₁ is updated first and the slope of w₂ is then computed from the new w₁, the two slopes come from different points on the loss surface. Compute every slope from the same forward pass, then update all the weights together, as lesson 79's loop did.

On real data the same lines run over a batch: X @ w + b gives every example's z at once, and the slopes are averaged over the batch.

Worked example

Worked example: train until the loss reaches a target

Four examples whose targets follow y = 0.5x₁ + 0.5x₂. Train one relu neuron on all four at every step until the mean squared loss is below 0.001.

import numpy as np

X = np.array([[2.0, 1.0], [1.0, 3.0], [3.0, 2.0], [0.0, 1.0]])
y = np.array([1.5, 2.0, 2.5, 0.5])
w = np.array([0.1, 0.1])
b = 0.0
first = -1
for step in range(200):
    z = X @ w + b
    a = np.maximum(z, 0)
    L = np.mean((a - y) ** 2)
    if step < 3:
        print(step, round(float(L), 3))
    if L < 0.001 and first == -1:
        first = step
    dz = 2 * (a - y) * (z > 0) / 4
    w = w - 0.05 * (X.T @ dz)
    b = b - 0.05 * np.sum(dz)
print(first, w.round(2).tolist(), round(float(b), 2))
In the lesson you can change this and run it.

The loss falls fast at first, from 2.04 to 0.162 to 0.018 in two steps, then slowly, and first drops below 0.001 at step 60. The weights head toward 0.5 and 0.5, the rule the targets were made with. Two details are worth seeing: X.T @ dz sums each weight's slope over the four examples in one product (lesson 56), and the division by 4 averages them, so the learning rate doesn't have to change with the batch size.

Quick check
What does this print?
import numpy as np

x = np.array([3.0, 0.0])
w = np.array([1.0, 1.0])
z = w @ x - 1
dz = 2 * (max(z, 0.0) - 1) * (z > 0)
print(z, dz, (dz * x).tolist())
  1. 3.0 4.0 [12.0, 0.0]
  2. 2.0 0.0 [0.0, 0.0]
  3. 2.0 2.0 [6.0, 0.0]
  4. 2.0 2.0 [6.0, 2.0]
Show the answer

2.0 2.0 [6.0, 0.0]

z = 3 − 1 = 2, relu keeps it, so ∂L/∂z = 2(2 − 1) = 2, and the weight slopes are 2 × 3 and 2 × 0.

Drill

Train to a target loss

Fill in the slope dz and the two update lines (learning rate 0.05, slopes averaged over the 4 examples), then set first to the first step whose loss is below 0.001, and w_final to the weights, rounded to 1 place, as a list.

import numpy as np

X = np.array([[2.0, 1.0], [1.0, 3.0], [3.0, 2.0], [0.0, 1.0]])
y = np.array([1.5, 2.0, 2.5, 0.5])
w = np.array([0.1, 0.1])
b = 0.0
first = -1
for step in range(200):
    z = X @ w + b
    a = np.maximum(z, 0)
    L = np.mean((a - y) ** 2)
    if L < 0.001 and first == -1:
        first = step
    dz = 0
w_final = w.round(1).tolist()
print(first, w_final)
In the lesson, your code is checked as you write it.
In your own words
The loss fell from 2.04 to 0.018 in two steps, then took 58 more to get below 0.001. Why does progress slow down?

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

In AI and ML: the same step in PyTorch, and one neuron's limit

Purpose. Take the step with PyTorch's own tools, then find the limit of a single neuron, which is why networks have layers.

In PyTorch. Each node in that row has a PyTorch name, and one training step uses them in order. The weights are tensors made with requires_grad=True, so PyTorch records the forward pass as it runs (lesson 82). torch.optim.SGD is given the list of weights it may move and the learning rate, as in lesson 80. Then zero_grad() clears any old slopes, L.backward() puts each weight's slope in its .grad, and step() moves every weight against its slope:

import torch

x = torch.tensor([2.0, 1.0])
y = 1.0
w = torch.tensor([0.5, -1.0], requires_grad=True)
b = torch.tensor(0.5, requires_grad=True)
opt = torch.optim.SGD([w, b], lr=0.1)
z = w @ x + b
a = torch.relu(z)
L = (a - y) ** 2
opt.zero_grad()
L.backward()
print(L.item(), w.grad, b.grad)
opt.step()
print(w, b)
with torch.no_grad():
    print(round(((torch.relu(w @ x + b) - y) ** 2).item(), 4))

Every number is one you found by hand: the loss 0.25 and the slopes −2, −1 and −1 from the flow, then the new weights 0.7, −0.9 and 0.6 and the new loss 0.01, which the NumPy cell printed too. with torch.no_grad(): keeps that last check from being recorded, since it isn't part of training. A real model hands the optimizer all its weights at once, optim.SGD(model.parameters(), lr=0.1), and repeats the three calls in a loop: lesson 111.

Quick check
What does this print?
import torch

w = torch.tensor([1.0, 2.0], requires_grad=True)
x = torch.tensor([3.0, -1.0])
z = w @ x
z.backward()
print(z.item(), w.grad)
  1. 5.0 tensor([ 3., -1.])
  2. 1.0 tensor([3., 1.])
  3. 1.0 tensor([ 3., -1.])
  4. 1.0 tensor([1., 2.])
Show the answer

1.0 tensor([ 3., -1.])

z = 1 × 3 + 2 × (−1) = 1, and z's slope for each weight is that weight's own input: 3 and −1. It's ∂z/∂wⱼ = xⱼ, the rule behind every weight's slope in this lesson.

What one neuron can learn. A sigmoid neuron with two inputs is lesson 102's logistic regression: its decision boundary is where w₁x₁ + w₂x₂ + b = 0, a straight line across the plane of inputs. Whatever it learns, it can only say "yes on this side, no on that side".

Take the trail club's signs, sorted by two yes-or-no features: pointed and wide. The four kinds sit at the four corners of the plane: a plain blaze (0, 0), a tent (0, 1), an arrow (1, 0) and a summit sign (1, 1). The neuron below has its weights set by hand to spot summit signs.

AND fits. "Summit sign?" is AND: yes only when both features are 1. Training finds weights for it by itself. Below is the worked example's loop with a sigmoid in place of relu; with the log loss, the slope of the loss for z is simply p − y (lesson 102). The rows of X are the blaze, the tent, the arrow and the summit sign.

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([0.0, 0.0, 0.0, 1.0])
w = np.zeros(2)
b = 0.0
for step in range(5000):
    p = 1 / (1 + np.exp(-(X @ w + b)))
    w = w - 1.0 * (X.T @ (p - y)) / 4
    b = b - 1.0 * np.mean(p - y)
p = 1 / (1 + np.exp(-(X @ w + b)))
loss = np.mean(-(y * np.log(p) + (1 - y) * np.log(1 - p)))
print(w.round(1).tolist(), round(b, 1), round(float(loss), 3))
print(p.round(3).tolist())

Training finds weights near (10.7, 10.7) and bias −16.2: only the summit sign scores above 0, so only it gets a high chance, 0.994. All four come out right, with a loss of 0.003. It's the same kind of line as the hand-set neuron's; the bigger weights just make its answers surer.

Quick check
What does this print? The AND weights from above, on two new signs: a pointed one only half as wide as a summit sign, and a summit sign.
import numpy as np

X = np.array([[1.0, 0.5], [1.0, 1.0]])
w = np.array([10.7, 10.7])
b = -16.2
print((1 / (1 + np.exp(-(X @ w + b)))).round(2).tolist())
  1. [0.0, 0.99]
  2. [0.5, 0.99]
  3. [0.99, 0.46]
  4. [0.46, 0.99]
Show the answer

[0.46, 0.99]

(1, 0.5) scores 10.7 + 5.35 − 16.2 = −0.15, just below 0, so its chance is just under 0.5; (1, 1) scores 5.2 and gets 0.99. Close to the line, the neuron is unsure.

XOR doesn't. Now ask "arrow or tent?", one feature but not both: yes for (1, 0) and (0, 1), no for (0, 0) and (1, 1). That's XOR, and no straight line puts the two yeses on one side and the two noes on the other. Training does the best it can, and the best is no line at all: the weights stay at 0, every prediction is 0.5, the loss is stuck at 0.693 (log 2), and accuracy at threshold 0.5 is 50%, a coin toss. This is not a training failure; it's a limit of what one line can draw.

Quick check
Why can no single neuron learn XOR?
  1. One neuron draws one line, and no line splits XOR
  2. XOR needs negative inputs
  3. The learning rate is always too small for XOR
  4. XOR has too few examples
Show the answer

One neuron draws one line, and no line splits XOR

The yeses sit at opposite corners, (0, 1) and (1, 0); any line with both on one side also has a no there.

Two lines make XOR. Two neurons in a hidden layer can each draw their own line. In the network below, OR says yes when at least one feature is 1 and NAND says yes unless both are; the output neuron says yes only when both of them do. Here a is pointed and b is wide. The weights are set by hand, and lesson 110 builds networks like it.

Drill

A data set it fits, and one it can't

Train the sigmoid neuron on AND, the summit-sign question, and on XOR, arrow or tent (5,000 steps, learning rate 1). Set acc_and and acc_xor to the accuracy at threshold 0.5, and loss_xor to XOR's final log loss, rounded to 3.

import numpy as np

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

def train(X, y):
    w = np.zeros(2)
    b = 0.0
    for step in range(5000):
        p = sigmoid(X @ w + b)
        w = w - 1.0 * (X.T @ (p - y)) / 4
        b = b - 1.0 * np.mean(p - y)
    return w, b

X = np.array([[0.0, 0.0], [0.0, 1.0], [1.0, 0.0], [1.0, 1.0]])
y_and = np.array([0.0, 0.0, 0.0, 1.0])
y_xor = np.array([0.0, 1.0, 1.0, 0.0])
acc_and = 0
acc_xor = 0
loss_xor = 0
print(acc_and, acc_xor, loss_xor)
In the lesson, your code is checked as you write it.
In your own words
XOR's loss stopped at 0.693 with every prediction 0.5. Why is that the best a single line can do with log loss?

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 one training step, which comes right after the loss?

  1. The backward pass
  2. The weighted sum
  3. The activation
  4. A new example

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