The Geometry of Learning
Linear algebra as the language of neural networks: vectors and similarity, matrices as maps, and the eigenvectors and singular vectors that reveal what a layer does.
3 lessons • 21 min read

- 01
Vectors, dot products and similarity
Neural networks represent words, images and whole documents as lists of numbers, and then decide what is related to what by multiplying those lists together. The dot product is that multiplication, and understanding its geometry explains embeddings, retrieval and attention.
7 min read - 02
Matrices as maps: layers, rank and composition
A neural network layer is, before its nonlinearity, a matrix multiplying a vector. Reading that matrix as a map that moves, stretches and collapses space explains why depth needs nonlinearities, why some information is irrecoverably lost inside a network, and why fine-tuning a large model can need only a small fraction of its parameters.
7 min read - 03
Eigenvectors and the SVD: the directions that matter
Most matrices in a trained network are large, but their action is often dominated by a handful of directions. Eigenvectors and the singular value decomposition find those directions, say how much each one matters, and give the provably best way to throw the rest away.
7 min read
Reference videos
9:523Blue1BrownVectors | Chapter 1, Essence of linear algebra
Start of the classic visual series. The whole playlist is worth it.
Watch
10:593Blue1BrownLinear transformations and matrices | Chapter 3, Essence of linear algebra
Matrices as maps: the mental model behind every neural-network layer.
Watch
17:163Blue1BrownEigenvectors and eigenvalues | Chapter 14, Essence of linear algebra
The directions a map only stretches, and why they matter.
Watch
6:44Steve BruntonSingular Value Decomposition (SVD): Overview
Opens a full lecture series on the SVD and its data-science uses.
Watch
Series16 videos3Blue1BrownEssence of linear algebra
The full visual series, from vectors to abstract vector spaces.
Open series
Series36 videosMIT OpenCourseWareMIT 18.06 Linear Algebra, Spring 2005
Gilbert Strang's classic course, for the full university treatment.
Open series
Series43 videosSteve BruntonSingular Value Decomposition [Data-Driven Science and Engineering]
The SVD in depth: low-rank approximation, PCA and least squares.
Open series
