Index Ai Academy
Foundation · Algebra

Straight lines: slope and intercept

Rise over run, the line through two points, and a model's weight and bias as slope and intercept.

About 42 minutes · Free lesson

What it covers6

Why it matters

A straight line is the simplest way one thing can depend on another: each step across adds the same amount up. Two numbers describe it completely, its slope and its intercept. The first machine learning model you'll ever train, linear regression, is exactly this: the weight is the slope and the bias is the intercept. This lesson is where algebra and models meet. You'll also learn to read a line from a table, from a graph and from its formula.

What you'll be able to do

  • Read y = mx + b: the slope as rise over run, and the intercept as y at x = 0
  • Find the line through two points, and tell when two lines are parallel
  • Work out slope and intercept in Python, print a table of a line and draw its graph
  • See a model's weight as a slope and its bias as an intercept, and predict from a line
Quick check
Have a guess before you start. A straight line goes through (0, 3) and (2, 7). What is y when x = 4?
  1. 15
  2. 14
  3. 9
  4. 11
Show the answer

11

From x = 0 to 2, y goes up 4: that's 2 for each step across. Two more steps to x = 4 add 4 more: 11.

The math: a constant climb

Purpose. Describe the simplest way one quantity can depend on another.

A straight line has the equation

y=mx+by = mx + b

In plain words: m is the slope, how much y goes up for each step of 1 across. b is the intercept, where the line crosses the y-axis, the value of y when x = 0.

In y = 2x + 3, every step right climbs 2, and the line starts at 3 when x = 0. A negative slope goes downhill: y falls as x grows. A slope of 0 is flat.

Quick check
From an earlier lesson: f(x) = 2x + 3. What is f(0)?
  1. 3
  2. 2
  3. 5
  4. 0
Show the answer

3

f(0) = 2 × 0 + 3 = 3. Putting x = 0 into a line always gives its intercept.

Slope from two points. Pick any two points on the line. The rise is how far up you go from the first to the second; the run is how far across. Slope is rise over run. Then walk back along the line to x = 0 to find the intercept. Watch it for (1, 5) and (3, 9). The picture draws each step: the rise and the run become two sides of a right triangle, the line runs through both points, and last you follow it back to where it crosses x = 0.

Try it now

Then set the second point to 3, 1 and press Use these numbers: the rise is negative, so the line goes downhill.

Symbols and formula. For two points (x₁, y₁) and (x₂, y₂):

m=y2−y1x2−x1b=y1−mx1m = \frac{y_2 - y_1}{x_2 - x_1} \qquad b = y_1 - m x_1

In plain words: slope is the change in y over the change in x. The intercept is what's left of y₁ after taking away the climb from 0 to x₁.

The little numbers below, x₁ and x₂, are subscripts: they just name the first and second point.

Parallel lines have the same slope: y = 3x − 2 and y = 3x + 5 never meet, because they climb at the same rate from different starts.

Quick check
What's the slope of the line through (2, 1) and (6, 9)?
  1. 0.5
  2. 4
  3. 2
  4. 8
Show the answer

2

Rise 9 − 1 = 8, run 6 − 2 = 4, so the slope is 8 ÷ 4 = 2.

Quick check
Which line is parallel to y = 3x − 2?
  1. y = 2x − 2
  2. y = x/3 − 2
  3. y = 3x + 5
  4. y = −3x − 2
Show the answer

y = 3x + 5

Parallel lines share a slope: 3. The intercept can be anything.

In your own words
In your own words: what do the slope and the intercept each tell you about a line?

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

In Python: a line from two points

Purpose. Turn two points into a line's numbers, then use the line.

Two small functions do it, one for each number:

def slope(x1, y1, x2, y2):
    return (y2 - y1) / (x2 - x1)

def intercept(x1, y1, m):
    return y1 - m * x1

m = slope(1, 5, 3, 9)
print(m, intercept(1, 5, m))
It runs right here in your browser, with nothing to install.

Now step through the same two functions. This time slope names the rise and the run, so each shows up as its own variable: the same numbers as the cells in the flow above. Press Next and watch 1, 5, 3 and 9 go into slope.

With m and b known, the line is a function, and a loop prints its table:

for x in range(0, 5):
    print(x, 2 * x + 3)

Each row climbs by 2, the slope. That's the quickest way to recognize a straight line in a table: the same jump every step.

A named mistake: mixing up the order. In the slope formula, both differences must go the same way: second point minus first, on top and on the bottom. Taking y₂ − y₁ over x₁ − x₂ flips the sign, and an uphill line comes out downhill. If you swap the points, swap both, and the slope stays the same:

def slope(x1, y1, x2, y2):
    return (y2 - y1) / (x2 - x1)

print(slope(1, 5, 3, 9), slope(3, 9, 1, 5))

Both orders give 2.0: the slope belongs to the line, not to which point you call first.

Worked example

Worked example: Celsius to Fahrenheit is a line

Water freezes at (0 °C, 32 °F) and boils at (100 °C, 212 °F). Find the line through them and use it.

def slope(x1, y1, x2, y2):
    return (y2 - y1) / (x2 - x1)

def intercept(x1, y1, m):
    return y1 - m * x1

m = slope(0, 32, 100, 212)
b = intercept(0, 32, m)
print(m, b)
print(m * 25 + b)
In the lesson you can change this and run it.

The slope is 180 ÷ 100 = 1.8: each degree Celsius is 1.8 degrees Fahrenheit. The intercept is 32, because the first point already sits at x = 0. So F = 1.8C + 32, the same formula as lesson 17's 9C/5 + 32. Two points were enough to find it, and 25 °C comes out as 77.0 °F.

Quick check
What does this print?
def slope(x1, y1, x2, y2):
    return (y2 - y1) / (x2 - x1)

print(slope(-1, 4, 3, -4))
  1. -2.0
  2. -8.0
  3. -0.5
  4. 2.0
Show the answer

-2.0

Rise −4 − 4 = −8, run 3 − (−1) = 4, so −8 ÷ 4 = −2.0.

Quick check
In a table of a straight line, what's the same in every row?
  1. The jump in y from one row to the next
  2. The intercept added each row
  3. The value of y
  4. The value of y divided by x
Show the answer

The jump in y from one row to the next

A line climbs the same amount for each equal step in x: that jump is the slope.

A line in a table, a graph and a formula. A straight line can be recognized three ways. In a table, equal steps in x give equal jumps in y. On a graph, the points sit along one straight edge. In a formula, x appears only to the first power: no x², no 1/x, and no x times another letter. Any one of these tells you the other two, and switching between them is how you'll read most charts in machine learning.

Here's the graph view of the table you printed above, drawn with the same Matplotlib lines as lesson 19:

import matplotlib.pyplot as plt

xs = [0, 1, 2, 3, 4]
ys = []
for x in xs:
    ys.append(2 * x + 3)
plt.plot(xs, ys)
plt.xlabel("x")
plt.ylabel("y = 2x + 3")
plt.show()

The graph is one straight line, starting from 3 on the y-axis.

Quick check
Read the graph. How much does the line climb from x = 1 to x = 3?
  1. 2
  2. 8
  3. 4
  4. 6
Show the answer

4

From 5 up to 9 is a rise of 4, over a run of 2. Rise over run gives the slope, 4 ÷ 2 = 2, the number in front of x.

Drill

Slope and intercept from two points

Fix slope and intercept, then set m and b for the line through (2, 1) and (6, 9).

def slope(x1, y1, x2, y2):
    return (y2 - y1) / (x1 - x2)

def intercept(x1, y1, m):
    return y1 + m * x1

m = slope(2, 1, 6, 9)
b = intercept(2, 1, m)
print(m, b)
In the lesson, your code is checked as you write it.
In your own words
Why does it not matter which of two points you call the first?

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

In AI and ML: the first model is a line

Purpose. Linear regression, the first model most people train, is y = mx + b with machine learning's letters.

In machine learning's letters, the line is

y^=wx+b\hat{y} = w x + b

In plain words: the weight w is the slope, how much the prediction rises per unit of input. The bias b is the intercept, the prediction when the input is 0.

Take the tent days from lesson 19: (10, 22), (20, 41) and (30, 59). A line through the coolest and hottest days:

def slope(x1, y1, x2, y2):
    return (y2 - y1) / (x2 - x1)

w = slope(10, 22, 30, 59)
b = 22 - w * 10
print(w, b)
print(w * 20 + b, w * 25 + b)
print(41 - (w * 20 + b))

On the middle day, 20 degrees, the line predicts 40.5 rentals; the shop actually rented 41, so the line misses by 0.5. The picture shows the three days and the line, then zooms in on that miss.

Quick check
The model above is rentals = 1.85 × temperature + 3.5. What does the 1.85 mean?
  1. It's the error on each day
  2. It's the best temperature for rentals
  3. Each extra degree adds about 1.85 rentals
  4. At 0 degrees it predicts 1.85 rentals
Show the answer

Each extra degree adds about 1.85 rentals

1.85 is the weight, the slope: the predicted rentals rise 1.85 for each degree warmer.

One line, three points. The line hits the two days it was drawn through exactly, but misses the middle day by half a rental. With more days, a straight line can't usually hit every point, so a model finds the line with the smallest total miss instead. That search, for the best w and b, is what training means. Lesson 22 shows exactly why two points pin a line down and three usually can't.

In the real tools. In PyTorch, the library most models are built with, a line like this is a layer with one input and one output. Here is the model above, its weight set to 1.85 and its bias to 3.5, asked about a 20-degree day:

A slope has units. A weight of 1.85 is a rate: rentals per degree. A model's weights always carry the units of output per unit of input, which makes them readable. A house-price model with a weight of 150 on floor area says 150 dollars per square foot. Reading a weight with its units is the first check that a model makes sense: a negative weight on temperature for tent rentals would be a warning sign. Predict the model's answers at 0 and 10 degrees.

Quick check
What does this print?
w = 1.85
b = 3.5
print(w * 0 + b, w * 10 + b)
  1. 0 18.5
  2. 3.5 22.0
  3. 3.5 18.5
  4. 1.85 22.0
Show the answer

3.5 22.0

At 0 degrees only the bias is left: 3.5. At 10 degrees: 18.5 + 3.5 = 22.0, which is the first data day exactly.

Drill

Read a model's line

A model's line passes through (15, 31) and (25, 51). Set w and b to its weight and bias, and pred to its prediction at 30 degrees.

w = (25 - 15) / (51 - 31)
b = 31
pred = w * 30
print(w, b, pred)
In the lesson, your code is checked as you write it.
In your own words
What are a linear model's weight and bias, in the language of lines?

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

Goes deeper in

Practice what you just read

  • 6 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 are the slope and intercept of y = 5 − 2x?

  1. Slope −2, intercept 5
  2. Slope 5, intercept −2
  3. Slope 2, intercept 5
  4. Slope −2, intercept −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