Index Ai Academy
Foundation · Algebra

Solving equations: keep the balance

The same move on both sides, undoing steps in reverse, and running a model's formula backward.

About 41 minutes · Free lesson

What it covers6

Why it matters

An equation says two things are equal, and solving it means finding the number that makes that true. The picture to keep is a balance: whatever you do to one pan, you must do to the other, or it tips. With that one rule, and undoing steps in reverse order, every equation in this lesson falls. In machine learning it answers backward questions, like which temperature makes a model predict 40 rentals. It also covers the two odd cases, an equation with no answer and one with every answer, and how to check any answer by putting it back, the habit that catches nearly every slip.

What you'll be able to do

  • Test whether a number solves an equation by putting it in
  • Solve a linear equation by doing the same to both sides, undoing the steps in reverse order
  • Solve and check equations in Python, with a function and by guess, check and adjust
  • Run a model's formula backward: which input gives a target prediction
Quick check
Have a guess before you start. Which value of x makes 3x + 5 = 20 true?
  1. 15
  2. 25/3
  3. 8.3
  4. 5
Show the answer

5

Try it: 3 × 5 + 5 = 15 + 5 = 20. Putting a number in is the quickest way to test a solution.

The math: an equation is a balance

Purpose. Find the number that makes a statement true.

An equation says two expressions are equal: 3x + 5 = 20. A solution is a value of x that makes it true. Before solving anything, you can always test a proposed answer by putting it in. If both sides come out equal, it's a solution.

To find the answer, picture a balance with 3x + 5 on the left pan and 20 on the right. They balance. You may do anything you like to the pans, as long as you do the same to both: then they still balance.

Quick check
From an earlier lesson: work out 4x − 3 when x = 2.
  1. 5
  2. −4
  3. 39
  4. 11
Show the answer

5

Substitute: 4 × 2 − 3 = 8 − 3 = 5. That's exactly how a solution is tested.

Undo in reverse order. Think of how the left side was built. Start with x, times by 3, then add 5. To get x back, undo those steps in the reverse order, on both pans: first take away 5, then divide by 3.

Watch a harder one, 4x + 7 = 2x + 15, with an x on both sides. The first move gathers the x's on one pan. The picture draws the two pans on a level beam. Each step writes its move above the beam and does it to both pans, and on each pan the part that move changed lights up. The last step puts the answer back in, and both pans come to the same number.

Try it now

Each step does one thing to both pans. Change the numbers and press Use these numbers to solve another.

Symbols and formula. For any equation of the form ax + b = c:

ax+b=c⇒ax=c−b⇒x=c−baax + b = c \quad\Rightarrow\quad ax = c - b \quad\Rightarrow\quad x = \frac{c - b}{a}

In plain words: take b from both sides, then divide both sides by a.

Always finish by checking: put the answer back into the original equation and see that both sides match. A solution you haven't checked is only a guess.

Quick check
Solve 7x − 4 = 31.
  1. x = 3.9
  2. x = 35
  3. x = 5
  4. x = 27/7
Show the answer

x = 5

Add 4 to both sides: 7x = 35. Divide both by 7: x = 5. Check: 7 × 5 − 4 = 31.

Quick check
To solve x/3 + 2 = 6, what's the first move?
  1. Times both sides by 3
  2. Divide both sides by 3
  3. Take 2 from the left side
  4. Take 2 from both sides
Show the answer

Take 2 from both sides

The left was built as x, divide by 3, add 2. Undo in reverse: first take 2 from both sides (x/3 = 4), then times both by 3 (x = 12).

In your own words
In your own words: why do you undo the steps in reverse order?

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

In Python: solve it, then check it

Purpose. Python can check a solution in one line, and solve a whole family of equations with one function.

Checking is substitution, then a comparison:

def lhs(x):
    return 3 * x + 5

print(lhs(5) == 20, lhs(4) == 20)
It runs right here in your browser, with nothing to install.

The formula x = (c − b)/a, written once, solves every equation of the shape ax + b = c:

def solve_linear(a, b, c):
    return (c - b) / a

print(solve_linear(3, 5, 20), solve_linear(2, -5, 11), solve_linear(7, -4, 31))

Solve, then check, one line at a time. Here is the flow's equation, 4x + 7 = 2x + 15, in code. The x's are gathered by hand first, 4x − 2x on the left, so solve_linear gets a = 4 − 2, b = 7 and c = 15. Then the last three lines put the answer back into both sides of the original equation. Press Next to run one line at a time, and watch a, b and c fill when solve_linear is called.

A named mistake: c − b / a. The brackets in (c − b) / a matter. Without them, Python divides only b, because dividing comes before subtracting:

c = 20
b = 5
a = 3
print((c - b) / a, c - b / a)

Guess, check and adjust. There's a second way that needs no rearranging at all. Guess, see how far off you are, and adjust. For 4x + 7 = 31:

print(4 * 5 + 7)   # guess 5: 27, too low by 4
print(4 * 6 + 7)   # guess 6: 31, just right

It's slower by hand, but it works on equations no formula covers. Computers solve many hard problems this way.

Worked example

Worked example: solve, then check, three equations

Solve 4x + 7 = 31, x/2 + 3 = 8 and −2x + 10 = 4 with one function, and check each answer by putting it back.

def solve_linear(a, b, c):
    return (c - b) / a

x1 = solve_linear(4, 7, 31)
x2 = solve_linear(0.5, 3, 8)
x3 = solve_linear(-2, 10, 4)
print(x1, x2, x3)
print(4 * x1 + 7 == 31, 0.5 * x2 + 3 == 8, -2 * x3 + 10 == 4)
In the lesson you can change this and run it.

Each equation is written as a, b and c for ax + b = c. Dividing by 2 is the same as multiplying by 0.5, so x/2 + 3 = 8 has a = 0.5. The answers are 6.0, 10.0 and 3.0, and the second line confirms each one balances its equation. The checks use == safely here because every number is exact; with messier decimals you'd use math.isclose, as in lesson 7.

Quick check
What does this print?
def solve_linear(a, b, c):
    return (c - b) / a

print(solve_linear(5, 10, 0))
  1. -10.0
  2. -2.0
  3. 2.0
  4. 0.0
Show the answer

-2.0

5x + 10 = 0, so x = (0 − 10) / 5 = −2.0. Check: 5 × (−2) + 10 = 0.

Quick check
Which line checks whether x = 4 solves 2x + 7 = 15?
  1. print(2x + 7 == 15)
  2. print((15 - 7) * 2)
  3. print(2 * 4 + 7 == 15)
  4. print(2 * 4 + 7 = 15)
Show the answer

print(2 * 4 + 7 == 15)

Substitute 4 for x and compare with ==, which gives True or False.

No answer, or every answer. Most linear equations have exactly one solution, but two other cases turn up. In 2x + 3 = 2x + 5, taking 2x from both sides leaves 3 = 5, which is never true: there's no solution. In 2x + 3 = 2x + 3, everything cancels to 3 = 3, which is always true: every x is a solution. In code, both cases make a zero once the x's are gathered, and solve_linear would stop with a division-by-zero error. A careful solver checks a first and says which case it's in. You'll meet the same three outcomes again in lesson 22, as lines that cross, coincide or run side by side.

Drill

Solve and check

Fix solve_linear(a, b, c) so it solves ax + b = c, then set x to the solution of 6x − 9 = 27 and ok to whether it balances.

def solve_linear(a, b, c):
    return c - b / a

x = solve_linear(6, -9, 27)
ok = 6 * x - 9 == 20
print(x, ok)
In the lesson, your code is checked as you write it.
In your own words
Why is it worth checking an answer even when a formula produced it?

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

In AI and ML: running a formula backward

Purpose. A model's formula answers "what will happen?". Solving it answers the backward question: "what input gives the result I want?"

The tent shop's model is rentals = 3 × temperature − 20. At what temperature does it predict 40 rentals?

y^=wx+b⇒x=y^−bw\hat{y} = w x + b \quad\Rightarrow\quad x = \frac{\hat{y} - b}{w}

In plain words: take the bias away from the target, then divide by the weight.

def input_for(target, w, b):
    return (target - b) / w

print(input_for(40, 3, -20))

At 20 degrees, the model expects 40 rentals.

Quick check
A model predicts score = 2.5 × hours + 25. How many hours does it say a score of 100 needs?
  1. 40
  2. 50
  3. 250
  4. 30
Show the answer

30

(100 − 25) ÷ 2.5 = 75 ÷ 2.5 = 30 hours.

Training arithmetic, solved for any letter. In one pass over n examples (an epoch) in batches of size B, a model takes n ÷ B steps. So steps = epochs × n ÷ B. Solving it lets you plan: which batch size gives exactly 500 steps per epoch on 16,000 examples?

print(16000 / 500)
print(16000 / 32)

A batch of 32 gives 500 steps, and the second line checks it. The same equation answers "how many epochs fit in a budget of steps", by solving for epochs instead.

In the real tools. In PyTorch, the library most models are built with, a DataLoader cuts the examples into batches, and len(loader) counts the batches in one epoch. So steps = epochs × len(loader). Here it is on the 16,000 examples in batches of 32, solved for the epochs that fit a budget of 1,500 steps:

Backward answers need a sense check. Solving gives a number, and the formula decides its unit. Asking the rental model for 100 rentals gives (100 + 20) ÷ 3 = 40 degrees: a real number, but far outside the days the model was built from. A formula will answer for temperatures it has never seen, so a backward answer should be checked against the data too. If the shop never opened above 30 degrees, a temperature of 40 is a guess dressed as a fact. Predict both answers below before you run them.

Quick check
What does this print?
def input_for(target, w, b):
    return (target - b) / w

print(input_for(100, 3, -20), input_for(-20, 3, -20))
  1. 26.7 -13.3
  2. 26.7 0.0
  3. 40.0 0.0
  4. 40.0 -13.3
Show the answer

40.0 0.0

Taking away b = −20 adds 20: (100 + 20) ÷ 3 = 40.0. A target of −20 gives (−20 + 20) ÷ 3 = 0.0: the bias alone, at 0 degrees.

Drill

Two backward questions

Write input_for(target, w, b), then set temp to the temperature where rentals = 3 × temperature − 20 predicts 61, and batch to the batch size that gives 250 steps per epoch on 8,000 examples.

def input_for(target, w, b):
    return target / w - b

temp = input_for(61, 3, -20)
batch = 8000 * 250
print(temp, batch)
In the lesson, your code is checked as you write it.
In your own words
What kind of question does solving a model's formula answer, that running it forward can't?

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

Goes deeper in

  • Formulas: rearranging and using formulas in more Python.

Practice what you just read

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

Solve 4x + 9 = 1.

  1. x = −2
  2. x = 2.5
  3. x = 2
  4. x = −2.5

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