Index Ai Academy
Foundation · Vectors and matrices

Angle, cosine similarity and projection

Direction without length, perpendicular vectors, shadows, and search by meaning.

About 45 minutes · Free lesson

What it covers6

Why it matters

The dot product mixes two things together: how long the vectors are and how much they point the same way. Often only the direction matters. Two documents about tents should count as similar whether one is a page long and the other is a book. Dividing the dot product by both lengths removes the length and leaves the cosine of the angle between the vectors, a number from −1 to 1. That number, cosine similarity, is how search engines, recommenders and chat assistants find the text that means the same thing as your question. This lesson builds it from lessons 49 and 50, adds the projection (how far one arrow reaches along another), and ends by searching a tiny dictionary of camping words by meaning.

What you'll be able to do

  • Find the angle between two vectors from cos θ = a·b / (‖a‖‖b‖)
  • Read cosine similarity from −1 to 1, and know that 0 means perpendicular
  • Find how far one vector reaches along another: its projection
  • Rank words by cosine similarity to a query, the core of search by meaning, in NumPy and with PyTorch's F.cosine_similarity and F.normalize
Quick check
Have a guess before you start. The arrows (1, 2) and (2, 4) have different lengths. How similar are their directions?
  1. Identical: one is the other doubled
  2. Half as similar, because one is twice as long
  3. Opposite
  4. Unrelated
Show the answer

Identical: one is the other doubled

(2, 4) is 2 × (1, 2): the same direction, stretched. Cosine similarity says 1, the most similar possible.

The math: the angle hidden in the dot product

Purpose. Compare directions regardless of length.

The dot product has a second formula, using the angle θ (theta) between the two arrows:

a⋅b=∥a∥ ∥b∥cos⁡θ\mathbf{a} \cdot \mathbf{b} = \lVert \mathbf{a} \rVert \, \lVert \mathbf{b} \rVert \cos \theta

In plain words: the dot product is length times length times the cosine of the angle between them.

Divide both sides by the two lengths and the angle is all that's left. For a = (3, 4) and b = (4, 3): the dot product is 12 + 12 = 24, and both lengths are 5, so cos θ = 24 ÷ 25 = 0.96. The arrows lean almost together.

Quick check
From lesson 43: what is cos 90°?
  1. 0
  2. 0.5
  3. −1
  4. 1
Show the answer

0

At 90° the point on the unit circle is straight up, (0, 1), so its x-coordinate, the cosine, is 0.

The picture. Step through (3, 4) and (4, 3). The drawing puts both arrows at the origin, at their true angle. Watch the dot product bring in the angle θ between them, marked by an arc. Then each length is written along its arrow, and the division cancels both lengths and leaves only the angle.

Try it now

Then set vector a to 6, 8 and vector b to 3, 4, and press Use these numbers: one is twice the other, the arrows lie on one line, and the cosine is exactly 1.

Symbols and formula. Cosine similarity is the dot product of the two arrows divided by both lengths:

cos⁡θ=a⋅b∥a∥ ∥b∥\cos \theta = \frac{\mathbf{a} \cdot \mathbf{b}}{\lVert \mathbf{a} \rVert \, \lVert \mathbf{b} \rVert}

Reading the scale. 1 means the same direction, 0 means perpendicular (90°), and −1 means opposite (180°). (1, 0) and (1, 1) give 1 ÷ (1 × √2) ≈ 0.707, and the angle whose cosine is 0.707 is 45°. Length never matters: (1, 2) and (2, 4) give 1, and (1, 2) and (−2, −4) give −1.

The named mistake. Comparing raw dot products. (6, 8) · (3, 4) = 50 is bigger than (3, 4) · (3, 4) = 25, yet both pairs point exactly the same way. The bigger number came from longer arrows, not closer directions.

Quick check
What is the cosine similarity of (2, 0) and (0, 5)?
  1. 10
  2. 0.4
  3. 0
  4. 1
Show the answer

0

The dot product is 2 × 0 + 0 × 5 = 0: one points along x, the other along y. Perpendicular arrows have cosine 0.

Projection: how far one arrow reaches along another. Shine a light straight down onto b's line, and a casts a shadow on it. The shadow's length is the scalar projection of a onto b (the widget above showed it the other way round, b's shadow on a):

proj length=a⋅b∥b∥proj vector=a⋅bb⋅b b\text{proj length} = \frac{\mathbf{a} \cdot \mathbf{b}}{\lVert \mathbf{b} \rVert} \qquad \text{proj vector} = \frac{\mathbf{a} \cdot \mathbf{b}}{\mathbf{b} \cdot \mathbf{b}} \, \mathbf{b}

In plain words: the length is the dot product divided by the length of the arrow you project onto. The vector is that much of b's direction.

Project a = (3, 1) onto b = (1, 1): the dot product is 4 and ‖b‖ = √2, so the shadow is 4 ÷ √2 ≈ 2.83 long, and the vector is (4 ÷ 2) × (1, 1) = (2, 2). Lesson 52 uses these shadows as coordinates.

Quick check
How far does (5, 2) reach along the x-axis, b = (1, 0)?
  1. √29
  2. 7
  3. 5
  4. 2
Show the answer

5

(5, 2) · (1, 0) = 5, and ‖b‖ = 1, so the shadow on the x-axis is 5: just the x-coordinate.

In your own words
In your own words: why does dividing by both lengths make cosine similarity ignore length?

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

In Python: a cosine function from two earlier pieces

Purpose. Write cosine similarity once, from @ and np.linalg.norm, and use it to rank.

import numpy as np

def cosine(a, b):
    return (a @ b) / (np.linalg.norm(a) * np.linalg.norm(b))

a = np.array([3.0, 4.0])
print(round(cosine(a, np.array([4.0, 3.0])), 3))
print(round(cosine(a, np.array([6.0, 8.0])), 3))
print(round(cosine(a, np.array([-4.0, 3.0])), 3))
It runs right here in your browser, with nothing to install.

The three answers are 0.96 (leaning together), 1.0 (same direction, twice as long) and 0.0 (perpendicular). The rounding keeps float noise like 0.9999999999999998 out of the printout.

Code flow. Here is the inside of cosine written out for (3, 4) and (4, 3), one piece per line. Step through it and watch dot, then the two lengths na and nb, then cos: the same cells the math part's flow filled.

Unit vectors make it a plain dot product. Normalize both arrows first (lesson 49) and their lengths are 1, so the cosine is just their dot product. Search systems store their vectors normalized for exactly this reason: one @ per comparison.

import numpy as np

a = np.array([3.0, 4.0])
b = np.array([4.0, 3.0])
a_hat = a / np.linalg.norm(a)
b_hat = b / np.linalg.norm(b)
print(round(a_hat @ b_hat, 3))

A named mistake: a zero vector. (0, 0) has length 0, so the formula divides by 0 and NumPy prints nan, "not a number", with a warning. A zero vector has no direction; check for it before you compare.

Worked example

Worked example: rank four arrows by similarity to a query

Score each of four vectors against the query (1, 1) and print them from most to least similar.

import numpy as np

def cosine(a, b):
    return (a @ b) / (np.linalg.norm(a) * np.linalg.norm(b))

query = np.array([1.0, 1.0])
names = ["east", "north-east", "north", "south-west"]
vecs = [np.array([2.0, 0.0]), np.array([3.0, 3.0]), np.array([0.0, 5.0]), np.array([-1.0, -1.0])]
scores = []
for v in vecs:
    scores.append(round(cosine(query, v), 3))
best = 0
for i in range(len(vecs)):
    print(names[i], scores[i])
    if scores[i] > scores[best]:
        best = i
print("most similar:", names[best])
In the lesson you can change this and run it.

north-east scores 1.0 even though it's three times longer than the query: same direction. east and north both sit 45° away and score 0.707. south-west points exactly backward and scores −1.0. Two lists kept side by side, names and vectors, share their positions, so position 1 is both "north-east" and (3, 3). The search for the best is lesson 19's: keep the position of the best so far, and replace it when a score beats it.

Quick check
What does this print?
import numpy as np

a = np.array([2.0, 0.0])
b = np.array([3.0, 3.0])
print(a @ b, round((a @ b) / (np.linalg.norm(a) * np.linalg.norm(b)), 3))
  1. 6.0 0.707
  2. 12.0 0.707
  3. 0.707 6.0
  4. 6.0 1.0
Show the answer

6.0 0.707

The dot product is 2 × 3 + 0 × 3 = 6. The lengths are 2 and √18, so the cosine is 6 ÷ (2 × 4.243) ≈ 0.707: a 45° angle.

Drill

A cosine that refuses zero vectors

Fix cosine(a, b): it should return None when either vector has length 0, and otherwise divide the dot product by both lengths. Then set best to the name of the vector most similar to query.

import numpy as np

def cosine(a, b):
    return (a @ b) / np.linalg.norm(a)

query = np.array([0.0, 2.0])
names = ["up", "right", "up-right"]
vecs = [np.array([0.0, 7.0]), np.array([3.0, 0.0]), np.array([1.0, 1.0])]
best = "right"
print(cosine(query, vecs[0]), cosine(query, np.array([0.0, 0.0])), best)
In the lesson, your code is checked as you write it.
In your own words
Why might a search system normalize every stored vector once, ahead of time?

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

In AI and ML: search by meaning

Purpose. Find the words, sentences or documents that mean the same as a query.

Models turn words into vectors, called embeddings (lesson 47), placed so that words used in similar ways point in similar directions. Here are six camp-log words as tiny 3-number vectors, with one number each for shelter, cooking and finding the way. Real embeddings have hundreds of numbers, but the search works the same.

import numpy as np

def cosine(a, b):
    return (a @ b) / (np.linalg.norm(a) * np.linalg.norm(b))

names = ["tent", "tarp", "stove", "kettle", "map", "compass"]
vecs = [np.array([0.9, 0.1, 0.0]), np.array([0.8, 0.0, 0.2]), np.array([0.1, 0.9, 0.0]),
        np.array([0.0, 0.8, 0.1]), np.array([0.1, 0.0, 0.9]), np.array([0.0, 0.1, 0.8])]
q = vecs[2]
for i in range(len(names)):
    if names[i] != "stove":
        print(names[i], round(cosine(q, vecs[i]), 3))

"kettle" scores 0.986 and every other word scores under 0.25: the nearest meaning to "stove" is the other cooking word. That's retrieval, the core of semantic search and of the systems that look up documents before a chatbot answers. A search shows its results ranked, best first. Here are the five scores as bars:

Quick check
Which word is closest in meaning to "map"? This prints the cosine of map with compass, then with tarp.
import numpy as np

def cosine(a, b):
    return (a @ b) / (np.linalg.norm(a) * np.linalg.norm(b))

m = np.array([0.1, 0.0, 0.9])
print(round(cosine(m, np.array([0.0, 0.1, 0.8])), 3), round(cosine(m, np.array([0.8, 0.0, 0.2])), 3))
  1. 1.0 0.0
  2. 0.986 0.348
  3. 0.348 0.986
  4. 0.986 0.986
Show the answer

0.986 0.348

compass (printed first) scores 0.986 and tarp 0.348, so compass is closest. Both lean mostly on the third number, finding the way, but compass leans almost entirely on it.

Why cosine, not distance or raw dot product? A long document repeats its words more, so its vector can be longer without meaning anything different. Cosine similarity ignores that. A query vector that's twice as long should find the same answers, and with cosine it does. Many systems normalize every vector once and then use the dot product, which then equals the cosine, as in Part 2. Search engines built on embeddings do exactly this, at a scale of millions of stored vectors.

In PyTorch. The same search with tensors. F.cosine_similarity(x, y, dim=0) is this lesson's formula for two vectors. F.normalize(words, dim=1) divides each row by its own length, so every word becomes a unit vector, as Part 2 did by hand. Then one @ scores every word at once: it dots each row of unit with stove's unit vector, one dot product per row (lesson 55 takes this apart). torch.round(..., decimals=3) rounds like NumPy's round.

import torch
import torch.nn.functional as F

words = torch.tensor([[0.9, 0.1, 0.0], [0.8, 0.0, 0.2], [0.1, 0.9, 0.0],
                      [0.0, 0.8, 0.1], [0.1, 0.0, 0.9], [0.0, 0.1, 0.8]])
stove = words[2]
print(round(F.cosine_similarity(words[3], stove, dim=0).item(), 3))
unit = F.normalize(words, dim=1)
print(torch.round(unit @ unit[2], decimals=3))

The first line is kettle against stove: 0.986, the number the NumPy cell printed. The second scores all six words in the order tent, tarp, stove, kettle, map, compass: 0.22, 0.107, 1.0, 0.986, 0.012 and 0.123, the NumPy cell's numbers again, plus stove against itself, 1.0. Normalize once, then every search is one @.

Drill

The two nearest words

Write nearest_two(query, names, vecs) returning the names of the two words most similar to query by cosine, best first, skipping any word whose vector equals the query.

import numpy as np

def cosine(a, b):
    return (a @ b) / (np.linalg.norm(a) * np.linalg.norm(b))

def nearest_two(query, names, vecs):
    return [names[0], names[1]]

names = ["tent", "tarp", "stove", "kettle", "map", "compass"]
vecs = [np.array([0.9, 0.1, 0.0]), np.array([0.8, 0.0, 0.2]), np.array([0.1, 0.9, 0.0]),
        np.array([0.0, 0.8, 0.1]), np.array([0.1, 0.0, 0.9]), np.array([0.0, 0.1, 0.8])]
print(nearest_two(vecs[0], names, vecs))
In the lesson, your code is checked as you write it.
In your own words
A query vector is doubled in length. What happens to its search results under cosine similarity, and why?

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
  • 8 review cards for spaced repetition

Try a quiz question

Two vectors have cosine similarity −1. What does that mean?

  1. They point in opposite directions
  2. They're perpendicular to each other
  3. They're the same vector
  4. One of them is zero

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

Before this lesson

Go deeper, if you like

Optional lessons that build on this one. They never block a phase or a certificate.

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