No. 275 of 500 No. 52 in Machine Learning

Linear Algebra and Learning from Data

By Gilbert Strang

Published
January 31, 2019
Print length
446 pages
Reading level
Advanced
ISBN-13
978-0692196380
Publisher
Wellesley-Cambridge Press
Written for
Students and engineers with basic linear algebra who want the mathematics behind machine learning.

Synopsis

Gilbert Strang wrote this textbook for MIT's course 18.065, Matrix Methods in Data Analysis, Signal Processing, and Machine Learning, and it reads like his lectures: informal in tone, built on worked examples, and focused on why each idea matters for data. It opens with a fresh look at matrix multiplication by columns and the four fundamental subspaces, then makes the singular value decomposition the center of the book, using it to explain principal component analysis, low-rank approximation and least squares. Later parts cover special matrices, computation with very large matrices including randomized methods, compressed sensing, probability and statistics, and optimization from gradient descent to stochastic gradient descent.

The final part turns to the construction of deep neural networks, explaining backpropagation as the chain rule organized by matrices and showing how piecewise linear activation functions let networks carve up their input space. The payoff for readers is fluency in the mathematics underneath machine learning code: what a weight matrix does, why low-rank structure appears everywhere, and how optimization behaves. The book assumes a first course in linear algebra and some calculus, and its free companion videos on MIT OpenCourseWare make self-study practical. It does not cover transformers or attention, so readers must extend its tools to modern architectures themselves.

Scorecard

Editorial score

How it scored

Editorial score: 74.8 / 1005 weighted criteria

  • Influence30%

    21.0/30
  • Authority25%

    22.5/25
  • Practical value20%

    13.0/20
  • Currency15%

    11.3/15
  • Readability10%

    7.0/10
  • Editorial score

    74.8/100

How the rank was computed

Rank No. 275 of 500 comes from a composite of 53.9: observable signals 20.1 of 55 points plus editorial review 33.8 of 45 points.

All 11 inputs
InputPoints
Observable signals20.1/55
Reach (Amazon ratings volume)8.9/16.5
Consensus across best-of lists2.8/13.8
Awards and bestseller evidence0.0/8.3
Reader rating, sample-adjusted7.1/8.3
Amazon sales rank1.3/5.5
Recency0.0/2.8
Editorial review33.8/45
Author authority10.1/11.3
Influence9.5/13.5
Practical value5.9/9.0
Readability3.2/4.5
Currency5.1/6.8

Each criterion is scored from 1 to 10 and weighted, and the points add up to the editorial score. The rank combines observable signals (55 percent) with this score (45 percent). Read the methodology.

Verdict

Strang's rigorous yet conversational bridge from matrix methods to deep learning, best used alongside his free MIT 18.065 lectures.

Strengths

  • Clear, conversational explanations from a master teacher
  • Paired with free MIT lecture videos
  • Connects classical linear algebra to modern learning

Keep in mind

This is a mathematics text without code or framework guidance, and it omits attention and transformers, so practitioners must bridge to current architectures themselves.

Key takeaways

  1. The singular value decomposition is the central tool of data science, underlying principal component analysis, low-rank approximation and compression of large datasets.
  2. Viewing matrix multiplication as combinations of columns and rank-one pieces makes factorizations and many machine learning operations far easier to analyze.
  3. Stochastic gradient descent and its variants are the workhorse of training, and their behavior depends on step size, conditioning and problem structure.
  4. A deep network with ReLU activations computes a continuous piecewise linear function, and backpropagation is the chain rule applied efficiently through matrices.

Notable facts

  • The book is the assigned textbook for MIT's 18.065, Matrix Methods in Data Analysis, Signal Processing, and Machine Learning, whose lectures are published free on MIT OpenCourseWare. Source (opens in a new tab)
  • MIT News described it as Strang's 12th textbook and reported that his 18.06 linear algebra course had passed 10 million views on OpenCourseWare. Source (opens in a new tab)

About the author

Gilbert Strang

Gilbert Strang taught mathematics at MIT for more than six decades and held the MathWorks Professor of Mathematics chair. He earned an MIT bachelor's degree in 1955, studied at Oxford as a Rhodes Scholar and received a UCLA PhD in 1959. His Introduction to Linear Algebra is a standard text, and his 18.06 lectures have drawn more than 10 million OpenCourseWare views.

Questions

What is Linear Algebra and Learning from Data about?
It is Gilbert Strang's textbook on the mathematics behind machine learning. It covers matrix factorizations, especially the singular value decomposition, large-scale matrix computation, low-rank approximation, compressed sensing, probability and statistics, and optimization, ending with how deep neural networks are built and trained. It serves as the companion text for MIT course 18.065.
What background do I need for Linear Algebra and Learning from Data?
Readers should have completed a first course in linear algebra, such as Strang's own MIT 18.06, plus basic calculus. The prose is conversational, but the material moves quickly through proofs and derivations. Self-learners can watch Strang's free 18.065 lectures on MIT OpenCourseWare, which follow the book closely and include problems aligned with each chapter.
Is Linear Algebra and Learning from Data still useful in 2026?
Yes. The mathematics it teaches, including the singular value decomposition, low-rank structure, least squares and stochastic gradient descent, underlies current models, including large language models, whose fine-tuning methods such as LoRA rely on low-rank matrices. It does not cover attention or transformers, so pair it with a modern deep learning text.

Sources

As an Amazon Associate, Best AI Books earns from qualifying purchases. Best AI Books is sponsored by Iternal.ai, whose founder and CEO, John Byron Hanby IV, wrote The AI Strategy Blueprint, our #1 ranked book. How we rank books.