Index Ai Academy
Foundation · Transposition of formulas

Vector equations: rearranging with arrows

Solving for a vector or a scale, recovering a gradient from two weight snapshots, and an angle from a dot product.

About 40 minutes · Free lesson

What it covers6

Why it matters

Adding, taking away and scaling work on vectors the same way they work on numbers, so most vector formulas turn around one component at a time. Two things are new. You can't divide by a vector, so a scale is found by comparing components. And an angle hides inside the dot product, freed by arccos. These moves recover the gradient a training step used, the mix of two embeddings, and the angle behind a similarity cutoff.

What you'll be able to do

  • Solve a + x = b for the unknown vector, one component at a time, and check by adding back
  • Find the scale k in k·v = w by comparing components, and say when no k exists because w isn't a multiple of v
  • Turn the update rule, the unit vector and the mix of two vectors around for any letter, without dividing by a vector
  • Free the angle, a length or the projection from a·b = ‖a‖‖b‖cos θ, with arccos clipped to [−1, 1] in code
  • Recover a gradient from two weight snapshots, a mix of two embeddings, a similarity cutoff's angle and momentum's steady state
Quick check
Have a guess before you start. a + x = b, with a = (2, 5) and b = (7, 3). What is x?
  1. (3.5, 0.6)
  2. (−5, 2)
  3. (9, 8)
  4. (5, −2)
Show the answer

(5, −2)

Take a away from both sides: x = b − a = (7 − 2, 3 − 5) = (5, −2). Check: (2, 5) + (5, −2) = (7, 3).

The math: undo each move, one component at a time

Purpose. Make a vector, a scale or an angle the subject of a vector formula. This is transposing, with arrows.

A quick recap of the notation. A bold letter like v is a vector, a list of numbers called its components, so v = (v₁, v₂). The length of v is ‖v‖ (lesson 49), and a·b is the dot product (lesson 50).

Adding and taking away. A vector equation is one equation per component. a + x = b says a₁ + x₁ = b₁ and a₂ + x₂ = b₂. Undo each one: x = b − a. Nothing new is needed.

Scaling. k·v = w, where k is a plain number, also says two things: k·v₁ = w₁ and k·v₂ = w₂. Each gives its own answer, k = w₁/v₁ and k = w₂/v₂. A k exists only if every component gives the same one. Take v = (2, 6). For w = (5, 15), both give 2.5, so k = 2.5. For w = (5, 14), one gives 2.5 and the other about 2.33. No single k works: w isn't a multiple of v, so it points along a different line. We say w isn't parallel to v.

Quick check
From an earlier lesson: what is (6, 2) − (1, 4)?
  1. (6, 8)
  2. (7, 6)
  3. (−5, 2)
  4. (5, −2)
Show the answer

(5, −2)

Take away matching components: 6 − 1 = 5 and 2 − 4 = −2. So (5, −2).

Each component is an ordinary number, so the machine from lesson 30 works on one at a time. Here is the first weight of a training step, w_new = w − ηg, with w = 0.5 and a learning rate η = 0.1. The gradient g goes in, and the way back recovers it from the new weight.

Try it now

Try a negative gradient, like −3: the weight goes up, and the way back still finds −3.

Symbols and formula. The three moves so far:

x=b−ak=w1v1=w2v2=⋯g=w−wnewη\mathbf{x} = \mathbf{b} - \mathbf{a} \qquad k = \frac{w_1}{v_1} = \frac{w_2}{v_2} = \cdots \qquad \mathbf{g} = \frac{\mathbf{w} - \mathbf{w}_{new}}{\eta}

In plain words: take away a vector by taking away each part. Find a scale from any part, then check that every part agrees. To get the gradient back, take the new weights from the old ones and divide by the learning rate.

Named mistake: dividing by a vector. From k·v = w it's tempting to write k = w/v. There is no such division: w/v isn't one number. NumPy will happily divide part by part and hand you a list, and if the parts differ, no k exists. The same goes for η. From w − w_new = ηg, the answer isn't (w − w_new)/g. Use one component with g₁ ≠ 0, η = (w₁ − w_new,₁)/g₁, then check the other components give the same η. Dividing by η or by k is fine: they're numbers, as long as they aren't 0.

Quick check
Find k with k·(4, −2) = (−6, 3).
  1. −0.67
  2. −1.5
  3. 1.5
  4. No k exists
Show the answer

−1.5

First part: −6 ÷ 4 = −1.5. Second part: 3 ÷ (−2) = −1.5. They agree, so k = −1.5. Check: −1.5 × (4, −2) = (−6, 3).

The unit vector. v̂ = v/‖v‖ divides v by its length, which is a number, so it's allowed when v isn't the zero vector. Undo it by multiplying: v = ‖v‖·v̂. A direction and a length rebuild the arrow: 5 × (0.6, 0.8) = (3, 4).

Mixing. m = (1 − t)a + t·b is the point a fraction t of the way from a to b. At t = 0 it's a, and at t = 1 it's b. To free t, expand: m = a + t(b − a). Take a away: m − a = t(b − a). That's a scale problem: t is the number that turns b − a into m − a. So t = (m₁ − a₁)/(b₁ − a₁), and every component must agree, which says m lies on the line through a and b.

To free a instead, take t·b away: m − t·b = (1 − t)a. Divide by the number 1 − t: a = (m − t·b)/(1 − t).

Conditions. t needs a ≠ b, or there's no line to measure along. a needs t ≠ 1: at t = 1 the mix is just b and holds no trace of a.

Quick check
m = (1 − t)a + t·b with t = 0.25, b = (20, 0) and m = (5, 7.5). What is a?
  1. (0, 7.5)
  2. (0, 30)
  3. (0, 10)
  4. (−20, 10)
Show the answer

(0, 10)

m − t·b = (5 − 5, 7.5 − 0) = (0, 7.5). Divide by 1 − t = 0.75: a = (0, 10). Check: 0.75 × (0, 10) + 0.25 × (20, 0) = (5, 7.5).

The angle in a dot product. From lesson 51, a·b = ‖a‖‖b‖cos θ. The angle θ sits inside a cos, which is multiplied by both lengths. Peel in reverse: divide by the lengths, then take arccos. So θ = arccos(a·b/(‖a‖‖b‖)).

arccos gives an angle from 0 to π, that is 0° to 180°: the principal angle. The angle between two arrows is always in that range, so no ± is needed. The same formula gives a length too: ‖b‖ = a·b/(‖a‖cos θ). That fails at 90°, where a·b = 0 whatever ‖b‖ is.

The projection length, how far a reaches along b, is a·b/‖b‖, which is ‖a‖cos θ. Turned around, a·b = (projection) × ‖b‖, and θ = arccos(projection/‖a‖).

Conditions. A zero vector has no direction: no angle, no unit vector. Watch θ = 4 radians go through below.

In your own words
A square root needs a ± when you undo a square. Why does arccos not need one when you free the angle between two arrows?

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

In Python: each rearrangement in one line

Purpose. NumPy does each part-by-part move in one line, and a dot product turns a vector equation into a number equation you can divide.

import numpy as np

a = np.array([2.0, 5.0])
b = np.array([7.0, 3.0])
x = b - a
print(x, a + x)

v = np.array([2.0, 6.0])
w = np.array([5.0, 15.0])
print(w / v)
k = (v @ w) / (v @ v)
print(k, np.allclose(k * v, w))
It runs right here in your browser, with nothing to install.
  • b - a takes away part by part, and adding a back gives b.
  • w / v divides part by part. That's a list of answers for k, one per part, not a k. Here they agree.
  • The dot trick. Dot both sides of k·v = w with v: k(v·v) = v·w. That's an equation in numbers, so divide by v·v, which is 0 only for the zero vector. Then np.allclose checks that k·v really is w. If w isn't parallel to v, the trick still gives a number, the scale of w's projection onto v, but the check says False.
Worked example

Worked example: an angle that rounding breaks

θ = arccos(a·b/(‖a‖‖b‖)) with its two conditions in code: no zero vectors, and a cosine clipped to [−1, 1]. np.clip(c, -1, 1) clamps a number into the range from −1 to 1: anything above 1 becomes 1, anything below −1 becomes −1, and anything in between is left alone.

import numpy as np

def angle(a, b):
    na = np.linalg.norm(a)
    nb = np.linalg.norm(b)
    if na == 0 or nb == 0:
        return None
    c = (a @ b) / (na * nb)
    return np.arccos(np.clip(c, -1, 1))

c = 1.0000000000000002
print(c, np.clip(c, -1, 1), np.clip(-3.5, -1, 1), np.clip(0.25, -1, 1))

a = np.array([2.0, 3.0])
print(round(angle(a, 2 * a), 6), round(np.degrees(angle(a, np.array([3.0, -2.0]))), 1), angle(a, np.zeros(2)))
In the lesson you can change this and run it.

Two arrows that point the same way, like a and 2a, should have a cosine of exactly 1. Rounding in the lengths can leave it a hair either side, and a value like 1.0000000000000002 is past 1. arccos of anything past 1 doesn't exist: NumPy would return nan, "not a number". np.clip pulls it back to 1.0, and it leaves 0.25 alone. So the angle between a and 2a comes out as 0.0, rounded to 6 places because a cosine a hair under 1 gives a tiny angle, not exactly 0. (3, −2) is at a right angle to (2, 3), and the function gives 90.0 degrees. The zero vector has no direction, so the answer is None.

Quick check
What does this print?
import numpy as np

v = np.array([2.0, 4.0])
w = np.array([5.0, 12.0])
print((w / v).tolist(), np.allclose(2.5 * v, w))
  1. An error
  2. [2.5, 3.0] True
  3. 2.5 True
  4. [2.5, 3.0] False
Show the answer

[2.5, 3.0] False

w / v divides part by part: 5 ÷ 2 = 2.5 and 12 ÷ 4 = 3.0. The parts disagree, so no k works, and 2.5 × (2, 4) = (5, 10) isn't w.

Quick check
a's projection onto b is 3 long, and ‖a‖ = 6. What is the angle between them?
  1. 60°
  2. 0.5°
  3. 120°
  4. 30°
Show the answer

60°

The projection is ‖a‖cos θ, so cos θ = 3 ÷ 6 = 0.5 and θ = arccos 0.5 = 60°.

Drill

Fix the scale and the angle

scale_between(v, w) should return the k with k·v = w, or None when there's no such k. angle(a, b) should give the angle in radians, even when rounding pushes the cosine past 1. Fix both.

import numpy as np

def scale_between(v, w):
    return w / v

def angle(a, b):
    c = (a @ b) / (np.linalg.norm(a) * np.linalg.norm(b))
    return np.arccos(c)

print(scale_between(np.array([2.0, 6.0]), np.array([5.0, 15.0])), angle(np.array([1.0, 0.0]), np.array([0.0, 2.0])))
In the lesson, your code is checked as you write it.
In your own words
The dot trick always gives a number. Why check np.allclose(k * v, w) afterward?

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

In AI and ML: reading training and search backward

Purpose. Training logs and embedding searches give you the result of a vector formula. Rearranging gets back what went in.

The gradient from two snapshots. A training step is w_new = w − ηg (lesson 48). Save the weights before and after a step, and with the learning rate you get the gradient back: g = (w − w_new)/η. That's how you check an optimizer did what you think.

The mix of two embeddings. An embedding is a word as a vector. Blend "tent" and "stove" as m = (1 − t)·tent + t·stove. With a = tent and b = stove, the dot trick recovers t from m: t = (m − a)·(b − a)/((b − a)·(b − a)).

import numpy as np

w_before = np.array([0.50, -1.20, 0.05])
w_after = np.array([0.47, -1.16, 0.05])
lr = 0.1
g = (w_before - w_after) / lr
print(np.round(g, 4), np.allclose(w_before - lr * g, w_after))

tent = np.array([0.9, 0.1, 0.0])
stove = np.array([0.1, 0.9, 0.0])
m = np.array([0.34, 0.66, 0.0])
d = stove - tent
t = ((m - tent) @ d) / (d @ d)
print(round(t, 4), np.allclose((1 - t) * tent + t * stove, m))

The third weight didn't move, so its gradient was 0. The mix sits 70% of the way from tent to stove.

Quick check
Two snapshots: w = (1.0, 2.0), w_new = (0.9, 2.2), and η = 0.5. What was g?
  1. (0.2, −0.4)
  2. (0.05, −0.1)
  3. (−0.2, 0.4)
  4. (0.1, −0.2)
Show the answer

(0.2, −0.4)

w − w_new = (0.1, −0.2). Divide by 0.5: (0.2, −0.4). The second weight went up, so its gradient was negative.

The angle behind a similarity cutoff. A search keeps documents whose cosine similarity to the query is at least 0.8. As an angle, that's θ = arccos 0.8 ≈ 36.87°: anything within about 37° of the query passes. Going the other way, "within 30°" is a cutoff of cos 30° ≈ 0.866. cos falls as θ grows, so a higher cutoff is a narrower cone. In NumPy, np.arccos answers in radians and np.degrees turns radians into degrees. np.radians goes the other way, degrees into radians, which np.cos needs.

Momentum at its steady state. Momentum keeps a running velocity, v = βv + g, with β around 0.9. If g stays the same, v settles. v appears twice, so gather it (lesson 32): v − βv = g, so v(1 − β) = g, and v = g/(1 − β). With β = 0.9 that's 10 times the gradient: momentum takes steps up to 10 times bigger. Turned around, g = (1 − β)v. The condition: β ≠ 1. At β = 1 nothing is ever forgotten and v grows without end.

Quick check
What does this print?
import numpy as np

print(round(np.degrees(np.arccos(0.8)), 2), round(np.cos(np.radians(30)), 3))
  1. 0.64 0.154
  2. 53.13 0.866
  3. 36.87 0.5
  4. 36.87 0.866
Show the answer

36.87 0.866

arccos 0.8 is 0.6435 radians, which is 36.87°. cos 30° ≈ 0.866. A cutoff of 0.8 and a cone of 37° say the same thing.

Drill

Read the optimizer backward

Write grad_from(w, w_new, lr), the gradient a step used, and steady_v(g, beta), where v = βv + g settles, returning None when beta is 1.

import numpy as np

def grad_from(w, w_new, lr):
    return (w_new - w) * lr

def steady_v(g, beta):
    return g * (1 - beta)

print(grad_from(np.array([1.0, 2.0]), np.array([0.9, 2.2]), 0.5), steady_v(0.2, 0.9))
In the lesson, your code is checked as you write it.
In your own words
Why does momentum's velocity settle at 10 times the gradient when β = 0.9, and what goes wrong at β = 1?

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

Goes deeper in

Practice what you just read

  • 3 code examples you can edit and run
  • a practice exercise that checks your code
  • a 5-question quiz
  • 9 review cards for spaced repetition

Try a quiz question

Make ‖b‖ the subject of a·b = ‖a‖‖b‖cos θ.

  1. ‖b‖ = a·b/(‖a‖cos θ)
  2. ‖b‖ = a·b − ‖a‖cos θ
  3. ‖b‖ = (a·b)/a × cos θ
  4. ‖b‖ = arccos(a·b/‖a‖)

Answer it at the end of the lesson to see if you're right, and why.

Before this lesson

Keep learning

Where this lesson leads.

575 lessons in thirteen phases. 176 are free without an account, and a free account opens the rest. See every lesson.

Foundation · about 96 hours of study

Foundation math

From whole numbers to the math inside a neural network: each idea by hand, in Python, and in AI 118 lessons All free
  1. Numbers and place value FreeWhat a digit's place is worth, the number line, and Python as a calculator that never tires.36 min
  2. Multiplying and dividing: groups FreeEqual groups, quotient and remainder, and cutting training data into batches.35 min
  3. Order of operations, and names for numbers FreeBrackets, powers, then multiply and divide, then add and subtract; variables hold numbers.36 min
  4. Numbers below zero FreeThe number line through zero, sign rules, distance from zero, and an error's direction and size.37 min
  5. Fractions: equal parts, equal fractions, adding FreePieces of a whole, equal fractions, and re-cutting to add; accuracy as a fraction.45 min
  6. Multiplying and dividing fractions FreeA share of a share, dividing by flipping, and why chances in a row get small.35 min
  7. Decimals and rounding FreeFractions in place value, rounding, and why 0.1 + 0.2 isn't exactly 0.3.36 min
  8. Percentages FreePer hundred, percent change, percentage points, and the accuracy and error rates of models.35 min
  9. Ratios, rates and proportion FreeSharing in a ratio, rates per unit, scaling, and splitting data 80/10/10.35 min
  10. Powers and roots FreeRepeated multiplying, the laws of exponents, square roots, and squared error.43 min
  11. Very big and very small numbers FreePowers of ten, e-notation like 3e-4, orders of magnitude, and a model's size in memory.36 min
  12. Bits, bytes and floats: how numbers are stored FreeBase 2, what n bits can hold, a float as sign, power and digits, and a tensor's memory.35 min
  13. Review: find the slip (numbers) FreeBroken calculations to fix, mixed practice from the whole module, and its formula sheet.34 min
  14. Letters for numbers FreeVariables, terms and like terms, substitution, and a model's formula as a Python function.41 min
  15. Expanding and factoring FreeBrackets as areas, pulling out common factors, and a squared error expanded into a bowl.41 min
  16. Solving equations: keep the balance FreeThe same move on both sides, undoing steps in reverse, and running a model's formula backward.41 min
  17. Rearranging a formula FreeMaking any letter the subject, round-trip checks, and planning a training run.36 min
  18. Inequalities and true-or-false FreeRanges, flipping the sign, if and elif, and the thresholds, clips and ReLU inside a model.42 min
  19. Functions: a rule from input to output Freef(x) notation, tables and graphs, domain and range, loops over lists, and loss as a function.42 min
  20. Chaining and undoing functions Freeg(f(x)), inverses that undo, scaling and unscaling, and a network as a chain.42 min
  21. Straight lines: slope and intercept FreeRise over run, the line through two points, and a model's weight and bias as slope and intercept.42 min
  22. Two equations, two unknowns FreeSubstitution and elimination, where lines cross, and why models are fitted, not solved.42 min
  23. Quadratics: bowls and their lowest point FreeRoots by factoring and by formula, the discriminant, the vertex, and the best weight of a model.42 min
  24. Exponentials: growth and decay FreeThe same factor each step, the number e, and decaying learning rates.43 min
  25. Logarithms: the power question FreeTo what power?, the laws of logs, and adding log-probabilities instead of multiplying.45 min
  26. Sequences and Σ FreeArithmetic and geometric sequences, Σ as a loop that adds, and mean squared error.40 min
  27. Weighted and moving averages FreeWeights that add to 1, a window average, the exponential moving average, and smoothing a loss curve.35 min
  28. Sets, and reading the symbols FreeSets, union and intersection, ℝⁿ and f : ℝⁿ → ℝᵐ, and reading a paper's first equation.41 min
  29. Review: find the slip (algebra) FreeBroken algebra and code to fix, mixed practice from the whole module, and its formula sheet.34 min
  30. Transposing step by step: undo in reverse order FreeA formula's layers, the opposite of each, peeling from the outside in, conditions, and round-trip checks.35 min
  31. Formulas with fractions: clear them first FreeClearing denominators, cross-multiplying, a letter in the bottom, and reciprocal formulas like 1/R = 1/R₁ + 1/R₂.35 min
  32. When the letter appears twice: collect and factor FreeGathering the letter on one side, factoring it out, dividing by the bracket, and rearranging precision and F1.35 min
  33. Squares, roots and powers FreeSquare roots with ±, squaring to undo a root, cube and nth roots, and the √d inside attention.40 min
  34. When the letter is squared and plain: quadratics FreeRearranging into ax² + bx + c = 0, the formula, completing the square, and choosing the root that fits.35 min
  35. Letters in the power: exponentials and logarithms FreeTaking logs to bring a power down, exponentiating to free a letter, and the logit that undoes the sigmoid.40 min
  36. Rearranging inequalities: when the sign flips FreeThe four moves on an inequality, negatives and reciprocals that flip it, logs below 1, and sample sizes.35 min
  37. Inverse functions, lines and scaling FreeUndoing a function by making x the subject, domains that allow it, line forms, and unscaling predictions.40 min
  38. Sequences and sums: find n, a, d and r FreeEvery letter of the arithmetic and geometric formulas as the subject, and an average's window from its decay.40 min
  39. Combining formulas: substitute and eliminate FreePutting one formula inside another to remove a letter, and sizing a training run from a time or money budget.35 min
  40. Review: rearrange anything (algebra) FreeBroken rearrangements to fix, mixed practice from the whole algebra block, a strategy chart, and its formula sheet.35 min
  41. Coordinates and distance FreePoints as (x, y), Pythagoras, distance in any number of coordinates, and nearest neighbors.42 min
  42. Angles, degrees and radians FreeMeasuring a turn, converting units, arcs, and the angle between two arrows.36 min
  43. Sine and cosine FreeAcross and up: right triangles, the unit circle, and directions and rotations.42 min
  44. Waves: height, speed and shift FreeAmplitude, period and phase, sampling a wave, and position codes in transformers.37 min
  45. Review: find the slip (shapes and waves) FreeBroken geometry and code to fix, mixed practice from the module, and its formula sheet.29 min
  46. Angles, triangles and waves: rearranging with sin, cos and tan FreeSides and angles from SOH CAH TOA, principal values, arcs, polar coordinates, and a wave's time and period.45 min
  47. Vectors: lists of numbers that point FreeA list, a point and an arrow; components, dimension, NumPy arrays, and data as vectors.42 min
  48. Adding and scaling vectors FreeComponent-wise sums, scalar multiples, mixes, and the weight update w − ηg.43 min
  49. Length and distance: norms FreeL2, L1 and max norms, unit vectors, distance, and the norms inside losses and clipping.42 min
  50. The dot product FreeMultiply in pairs and add; a·a as squared length; a @ b; one neuron as a dot product.43 min
  51. Angle, cosine similarity and projection FreeDirection without length, perpendicular vectors, shadows, and search by meaning.45 min
  52. Perpendicular directions: bases and coordinates FreeOrthonormal directions, coordinates as dot products, rebuilding a vector, and taking a direction out.35 min
  53. Matrices: tables of numbers FreeRows, columns and entries; two-dimensional arrays and slices; a data set as a matrix.41 min
  54. Adding, scaling and transposing matrices FreeEntry-by-entry sums and scalings, the transpose, mean images, and tables turned around.36 min
  55. A matrix times a vector FreeEach row dotted with the vector, the size rule, A @ x, and a layer acting on one example.42 min
  56. Matrix multiplication FreeRow meets column, the size rule, order matters, and a batch through a layer: X W + b.45 min
  57. Identity, diagonal, triangular and symmetric FreeFour patterns and their jobs: rescaling, distance tables, and the causal mask.37 min
  58. Matrices as movements of space FreeStretches, flips, shears and rotations; columns as landing spots; chaining; a layer moving data.42 min
  59. Determinant and inverse FreeThe area factor ad − bc, singular matrices, undoing a matrix, and redundant features.42 min
  60. Solving systems by elimination FreeAugmented matrices, row moves, back-substitution, the three outcomes, and fitting weights.45 min
  61. Independence, span and rank FreeRedundant vectors, span, rank, outer products, and low-rank updates like LoRA.42 min
  62. Eigenvectors: directions that only stretch FreeAv = λv, checking candidates, np.linalg.eig, and the main direction of a data cloud.41 min
  63. SVD and PCA: the important directions first FreeA matrix as pieces by size, the best rank-k copy, compression, and PCA maps of data.45 min
  64. Tensors, shapes and broadcasting FreeAxes and shapes, reshape, axis=, broadcasting, and shapes through a small model.43 min
  65. One-hot vectors and lookup tables: embeddings FreeA one-hot row picks a table's row, a sentence looked up as vectors, and a score for every word.35 min
  66. Sliding dot products: convolution FreeA small pattern slid along a list and over a grid, output sizes, stride and padding, and shared weights.40 min
  67. Review: find the slip (vectors and matrices) FreeShape slips to fix, mixed practice from the module, and its formula sheet with shapes.36 min
  68. Vector equations: rearranging with arrows FreeSolving for a vector or a scale, recovering a gradient from two weight snapshots, and an angle from a dot product.40 min
  69. Matrix equations: multiply by the inverse, on the correct side FreeNo dividing by a matrix: inverses from the left or right, order, transposes, and the normal equations.40 min
  70. Rates of change FreeChange over change, secants, rates from readings with np.diff, and reading a loss curve.41 min
  71. Limits: what a value heads toward FreeApproaching from both sides, holes, corners and jumps, epsilon, and judging activations.37 min
  72. The derivative: slope at a point FreeShrinking secants, f′(x) and dy/dx, Δy ≈ f′Δx, and which way a weight should move.45 min
  73. Derivative rules FreeConstants, powers, multiples, sums, eˣ and ln x, checked numerically, and a squared error's slope.41 min
  74. The product rule and the chain rule FreeProducts and chains of functions, forward then backward, and one neuron's dL/dw.45 min
  75. Lowest points and curvature Freef′ = 0, the second-derivative test, tables, local and global minima, and convex losses.43 min
  76. Standing in for a curve near a point FreeTangent lines, a curvature term, growing error, and why learning rates must be small.37 min
  77. Partial derivatives FreeOne input at a time, ∂, nudging in Python, and the two slopes of a line's loss.41 min
  78. The gradient FreeAll the slopes as a vector, steepest climb and descent, a numerical gradient, and the loss gradient.42 min
  79. Gradient descent FreeStepping against the gradient, the learning rate, a training loop, and fitting a line.45 min
  80. Faster descent: momentum and Adam FreeMomentum and Adam by hand, the bias correction, and three optimizers down one narrow valley.40 min
  81. The chain rule with many paths: backpropagation by hand FreeGraphs, multiply along paths and add across them, gradient checks, and a 2-2-1 network by hand.45 min
  82. Automatic differentiation: how PyTorch finds every slope FreeA tape of steps walked backward, and requires_grad, backward(), .grad, zero_grad() and no_grad().40 min
  83. Jacobians and Hessians FreeSlopes of vector functions, a layer's Jacobian, second partials, and bowls, domes and saddles.42 min
  84. Integrals: adding up thin slices FreeStrip and trapezoid sums, summing undoes differencing, probability as area, and AUC.43 min
  85. Review: find the slip (calculus) FreeCalculus slips to fix, mixed practice from the module, and its formula sheet.36 min
  86. Rearranging in calculus: slopes, steps and constants FreeSetting a slope to zero, Newton's step, the chain rule turned around, constants from a point, and learning rates.45 min
  87. Counting: choices, orders and groups FreeThe counting principle, factorials, ordered picks and groups, and why attention's cost grows with the square of the length.43 min
  88. Probability: from counts to chances FreeEqually likely outcomes, the complement, distributions, seeded simulation, and a next-word model.43 min
  89. Combining events: and, or, independent FreeThe or rule, independence, probability trees, drawing with and without replacement, and chains of steps.42 min
  90. Conditional probability and Bayes' rule FreeConditionals from tables, why P(A | B) isn't P(B | A), Bayes' rule, and precision and recall.45 min
  91. Random variables and distributions FreeUncertain numbers, the probability of a range, sampling by slices, and sampling versus argmax.42 min
  92. Expected value, variance and standard deviation FreeProbability-weighted averages, spread in the data's own units, and a training loss as an expected value.42 min
  93. Bernoulli, binomial, uniform and normal FreeYes-or-no trials, counts of yeses, the 68-95-99.7 rule, z-scores, and an accuracy's error bar.45 min
  94. Two variables at once: covariance and correlation FreeJoint tables and marginals, covariance, correlation, the covariance matrix, and features that carry the same information.45 min
  95. Review: find the slip (probability) FreeProbability slips to fix, mixed practice from the module, and its formula sheet.36 min
  96. Probability formulas: solve for the missing chance FreeConditionals, Bayes' rule for the prior, the or rule, expected values, variance, and z-scores turned around.45 min
  97. Describing data: center, spread and scale FreeMean, median and mode, variance and standard deviation, percentiles, outliers, and standardizing features.42 min
  98. Samples, the law of large numbers and the central limit theorem FreeSamples and populations, the standard error σ/√n, the bell of averages, and error bars on test scores.43 min
  99. Is the difference real? Comparing two models FreePaired differences, a bootstrap interval, what a p-value is and isn't, and why many tries make lucky wins.40 min
  100. Maximum likelihood FreeLikelihoods as products, log-likelihoods as sums, grid search, underflow, and the negative log-likelihood loss.45 min
  101. Linear regression: the best line FreeResiduals, least squares by formula, three roads to one line, the matrix form, and train versus test error.45 min
  102. Logistic regression: a line that answers yes or no FreeThe sigmoid, the log loss, its slope p − y, a training loop, and choosing a threshold.45 min
  103. Scoring a classifier: confusion table, precision, recall, F1 FreeThe four cells, accuracy, precision, recall and F1, and what moving a threshold does to each.35 min
  104. Softmax: scores into probabilities FreeExponentiate and share out, shifting and temperature, the safe softmax, and a classifier's last step.43 min
  105. Surprise, entropy and cross-entropy FreeSurprise in bits, entropy, cross-entropy and KL divergence, perplexity, and a language model's loss.45 min
  106. KL divergence: how far one distribution is from another FreeKL by hand, cross-entropy as entropy plus KL, why it isn't symmetric, and a soft-target loss.35 min
  107. Review: find the slip (statistics and information) FreeStatistics slips to fix, mixed practice from the module, and its formula sheet.38 min
  108. Statistics and information: n, z, logits and bits FreeSample sizes from error bars, inputs from probabilities, logit gaps from softmax, and chances from bits and losses.40 min
  109. One neuron, start to finish FreeWeighted sum, activation, loss, slopes and update, by hand and in code, and what one straight line can and can't split.45 min
  110. A layer and a small network as matrices FreeTwo layers on a batch, the shape of every matrix, adding a hidden unit, and XOR solved.45 min
  111. Training a small network FreeThe backward pass in matrix form, gradient checks, a full training loop, and reading loss curves.45 min
  112. The same network in PyTorch Freenn.Sequential with the NumPy weights loaded, the same loss and slopes, then SGD and mini-batches.45 min
  113. Attention as matrix math FreeScaled dot-product scores, the causal mask, a row-by-row softmax, and blending value vectors.45 min
  114. Residual connections and layer norm FreeAdding the input back and why its slope keeps learning alive, layer norm by hand, and add and norm.40 min
  115. A transformer block, start to finish FreeA sentence through embeddings, attention, add and norm, a small network and next-word scores, every shape named.45 min
  116. Planning a model: rearranging the formulas of a working network FreeLayer widths from parameter counts, sizes from memory and compute, the attention scale, and a training plan.40 min
  117. Final test: transpose any formula FreeSlips to fix from every topic, mixed practice of every kind of rearranging, the strategy chart and the full sheet.45 min
  118. Capstone: a sign reader from the formulas FreeBuild, train and test a trail-sign classifier with NumPy alone, and report its accuracy with an error bar.45 min
Part of a free course 118 lessons

The Foundation Math For Ai & ML: from arithmetic to attention

Learn the math behind AI from arithmetic up: numbers, algebra, vectors and matrices, calculus, probability and statistics, each shown as numbers moving and checked in Python, ending with a network you build and train from the formulas.

Part of a free course 19 lessons

Transposition of Formulas: algebraic manipulation in every topic

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

Never trained an AI? Teach a small one to write, right in your browser. It takes about 20 seconds and needs no account. Teach it to write