Index Ai Academy
Foundation · Numbers

Numbers below zero

The number line through zero, sign rules, distance from zero, and an error's direction and size.

About 37 minutes · Free lesson

What it covers6

Why it matters

Some amounts go below zero: a temperature on a cold night, a bank balance in debt, a prediction that's too low. Negative numbers let one number say both how far and which way. Every model's error is like that: too high or too low, by some amount. This lesson extends the number line through zero and shows the few rules for working with what's on the other side.

What you'll be able to do

  • Place negative numbers on the number line and compare them
  • Add, subtract, multiply and divide with negative numbers using the sign rules
  • Find the distance between two numbers with absolute value, and use abs() and comparisons in Python
  • Read a model's error as a direction and a size
Quick check
Have a guess before you start. It's −3 degrees at dawn and 5 degrees at noon. How many degrees did it warm up?
  1. 2
  2. 5
  3. −8
  4. 8
Show the answer

8

From −3 up to 0 is 3 degrees, and from 0 up to 5 is 5 more: 8 in all. That's 5 − (−3), and subtracting a negative is adding.

The math: the number line through zero

Purpose. Counting starts at zero, but amounts don't stop there. A negative number is below zero: −3 means 3 steps the other way.

Picture the number line extended to the left of zero:

 −5  −4  −3  −2  −1   0   1   2   3   4   5

Further right means bigger. So −1 is bigger than −3, even though 3 is the bigger digit: −1 is closer to warm.

Adding moves you right; subtracting moves you left. Adding a negative is moving left: 6 + (−4) is the same as 6 − 4 = 2. And subtracting a negative moves you right: 5 − (−3) = 5 + 3 = 8. Taking away a debt leaves you better off.

The absolute value, written |−3|, is the distance from zero, with no direction: |−3| = 3 and |3| = 3.

The flow below works 6 + (−4) − (−3), and its picture shows each step as a jump along the line. A minus sign in front of a number flips it to the other side of 0. Adding −4 jumps 4 to the left; subtracting −3 jumps 3 to the right.

Try it now

The minus signs that belong to a number apply first; then it's left to right, one jump at a time. Set the expression to 10 - -4 and press Use these numbers: which way does the last jump go?

Symbols and formula. For multiplying and dividing, there are two sign rules:

same signs→+different signs→−\text{same signs} \rightarrow + \qquad \text{different signs} \rightarrow -

In plain words: two negatives multiplied make a positive; a negative times a positive makes a negative. Division follows the same rule.

So −3 × −4 = 12, −3 × 4 = −12 and −24 ÷ 6 = −4.

Distance between two numbers is the absolute value of their difference:

distance(a,b)=∣a−b∣\text{distance}(a, b) = |a - b|

The distance from −3 to 5 is |−3 − 5| = |−8| = 8. Order doesn't matter: |5 − (−3)| = |8| = 8 too.

Smaller minus bigger. Taking a bigger number from a smaller one crosses zero. For 3 − 8, move 3 left to reach 0, then 5 more: −5. A quick way: subtract the smaller from the bigger (8 − 3 = 5), then give the answer the sign of the bigger one's direction. Since you took away more than you had, it's negative.

You meet this all the time. A path climbs from 120 meters below a pass to 45 meters above it: that's 45 − (−120) = 165 meters of climbing. A store is 30 bars short and gets 50: −30 + 50 = 20 bars to spare.

Quick check
Which is the biggest: −7, −2, −10 or −5?
  1. −10
  2. −5
  3. −2
  4. −7
Show the answer

−2

On the number line −2 sits furthest right, closest to zero, so it's the biggest.

Quick check
What is −6 × −3?
  1. −18
  2. 9
  3. −9
  4. 18
Show the answer

18

Same signs make a positive: 6 × 3 = 18.

Where the sign rules come from. Look at the pattern as you count down: 3 × 2 = 6, 2 × 2 = 4, 1 × 2 = 2, 0 × 2 = 0. Each step takes away 2. Keep going: −1 × 2 = −2, −2 × 2 = −4. A negative times a positive is negative.

Now count down with −2 instead: 2 × −2 = −4, 1 × −2 = −2, 0 × −2 = 0. Each step adds 2. Keep going: −1 × −2 = 2, −2 × −2 = 4. Two negatives make a positive because the pattern has to continue.

In your own words
In your own words: why is subtracting a negative the same as adding?

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

In Python: signs, distances and true-or-false

Purpose. Python handles negatives with the same rules, and has a function for distance from zero.

print(-2 + 7)
print(4 - -6)          # subtracting a negative
print(-3 * -5, -24 / 6)
print(abs(-8), abs(8))
It runs right here in your browser, with nothing to install.

abs( ) gives the absolute value: the number without its sign.

You can also ask Python a yes-or-no question. A comparison gives True or False:

print(-1 > -3)        # is −1 bigger than −3?
print(-7 < -10)       # is −7 smaller than −10?
print(abs(-3 - 5) == 8)

The comparison signs are > and < (bigger, smaller), >= and <= (or equal), == for "is equal to" (two equals signs, since one = stores a value), and != for "is not equal to".

Two jobs for one sign. The minus sign does two different jobs. Between two numbers, as in 9 - 4, it subtracts. In front of a single number, as in -4, it makes that number negative. So 4 - -6 reads as "4 minus negative 6", which is 10. Python can tell the two jobs apart from where the sign sits, but people can't always: write brackets, 4 - (-6), when you want the line to be easy to read. Python gives the same answer either way.

Worked example

Worked example: distances on the number line

A trail sign marks 0 at the parking lot. Two hikers stand at −350 meters (behind the sign) and 1,200 meters (ahead). How far apart are they, and who is farther from the sign?

ann = -350
ben = 1200
gap = abs(ann - ben)
print(f"gap: {gap} meters")
print(f"Ann from the sign: {abs(ann)}, Ben from the sign: {abs(ben)}")
print(abs(ben) > abs(ann))
In the lesson you can change this and run it.

The gap is |−350 − 1200| = |−1550| = 1,550 meters: the distance doesn't care who's ahead. Each hiker's distance from the sign is their absolute value: Ann is 350 meters away, Ben 1,200. The last line asks whether Ben is farther, and Python answers True. Notice that comparing abs(ben) with abs(ann) compares distances, while comparing ben with ann would only say who is farther ahead.

Here those two questions get different answers. Ann is now 1,500 meters behind the sign and Ben 900 ahead. Step through one line at a time and watch each name get its value: diff keeps its minus sign, gap drops it, and the two comparisons come out as True or False.

Quick check
What does this print?
print(-7 // 2)
print(abs(-7) // 2)
  1. -4 4
  2. -4 3
  3. -3.5 3
  4. -3 3
Show the answer

-4 3

// always rounds down, toward the left of the number line: −3.5 rounds down to −4. abs(−7) is 7, and 7 // 2 = 3.

Quick check
Which line checks whether two hikers at a and b are less than 100 meters apart?
  1. print(abs(a - b) < 100)
  2. print(abs(a - b) = 100)
  3. print(abs(a) - abs(b) < 100)
  4. print(a - b < 100)
Show the answer

print(abs(a - b) < 100)

The distance is abs(a − b), and < 100 asks whether it's under 100. It works whichever hiker is ahead.

Drill

How far, and which way

A thermometer read −12 at night and 7 at noon. Set change to noon minus night, distance to how far apart the readings are, and warmer to whether noon was warmer than night.

night = -12
noon = 7
change = night - noon
distance = noon - night
warmer = noon < night
print(change, distance, warmer)
In the lesson, your code is checked as you write it.
In your own words
What does abs( ) throw away, and what does it keep?

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

In AI and ML: an error has a direction and a size

Purpose. When a model predicts a number, it's usually a little off. Which way it's off, and by how much, are two different facts, and negative numbers carry both.

On the model map below, this lesson lights two parts at the end of the forward row: the targets (the right answers) and the loss (one score for how wrong the predictions are).

For the trail club's tent rentals:

error=prediction−targetabsolute error=∣error∣\text{error} = \text{prediction} - \text{target} \qquad \text{absolute error} = |\text{error}|

In plain words: the error is positive when the model guessed too high, negative when too low. The absolute error is just how far off, either way.

prediction = 38
target = 45
error = prediction - target
print(f"error {error}: too low by {abs(error)} tents")

Negatives show up inside models too. A weight multiplies an input. A positive weight pushes the prediction up as the input grows; a negative weight pushes it down. If rentals drop as rain grows, the weight on "millimeters of rain" will come out negative.

Quick check
What does this print?
prediction = 50
target = 44
error = prediction - target
print(error, abs(error), error > 0)
  1. 6 -6 True
  2. 6 6 True
  3. -6 6 False
  4. -6 6 True
Show the answer

6 6 True

50 − 44 = 6: positive, so the model guessed too high. Its absolute error is also 6, and 6 > 0 is True.

Now put both of those predictions on the number line: 38 against 45 from the cell, and 50 against 44 from the check. An error is a jump from the target to the prediction. Its direction is the sign, and its length is the absolute error. Press Next to step through.

Why the absolute error matters. Suppose a model is 10 tents too high one day and 10 too low the next. Its two errors are +10 and −10, and they add up to zero, as if it were perfect:

e1 = 10
e2 = -10
print(e1 + e2, abs(e1) + abs(e2))

The plain sum hides both mistakes, because the signs cancel. The sum of absolute errors, 20, shows how wrong the model really was. That's why a model is judged by the size of its errors, with the sign dropped, while the sign is kept to spot a habit, like always guessing low.

In the real tools. In PyTorch, the library most models are built with, a tensor holds many numbers together, so one line finds the error for every day at once. Here are the two predictions you just drew, and a third day:

Quick check
A model's weight on "millimeters of rain" is −3. What happens to its tent prediction as rain grows?
  1. It goes up by 3 tents per millimeter
  2. It goes down by 3 tents per millimeter
  3. It doesn't change
  4. It becomes negative at once
Show the answer

It goes down by 3 tents per millimeter

The weight multiplies the input: each extra millimeter adds −3 × 1 = −3 to the prediction.

Drill

Errors for three predictions

Three days' tent predictions and true counts are below. Set e1, e2 and e3 to each error (prediction minus target), a1, a2 and a3 to their absolute values, and beats_1 and beats_3 to whether day 2's absolute error is bigger than day 1's and than day 3's.

p1 = 40
t1 = 43
p2 = 31
t2 = 25
p3 = 44
t3 = 52
e1 = t1 - p1
e2 = t2 - p2
e3 = t3 - p3
a1 = e1
a2 = e2
a3 = e3
beats_1 = a2 < a1
beats_3 = a2 < a3
print(e1, e2, e3, a1, a2, a3, beats_1, beats_3)
In the lesson, your code is checked as you write it.
In your own words
Why keep both the error and the absolute error?

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

Goes deeper in

Practice what you just read

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

What is −8 + 3?

  1. −5
  2. −11
  3. 5
  4. 11

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