liveBook · Manning

The Bitter Lesson

As explained in Sutskever's List

The Bitter Lesson is an essay arguing that general-purpose methods that improve with increased computation tend to outperform hand-engineered, domain-specific strategies over time.

The Bitter Lesson is the argument that general-purpose methods which reliably turn more computation into better performance tend to outlast hand-tuned heuristics and domain-specific strategies. Encoding prior knowledge can help in the short term, but learned features can surpass handcrafted ones as data and computation grow. section 3.8

This is not simply a claim that more compute wins. Scaling pays off when a method can convert added resources into performance. Residual connections, for example, matter in deep learning because they support learning layered representations across many layers; adding compute to a convex optimization problem does not create the same scaling loop. section 3.8

Handcrafted features and learned representations

AlexNet’s success over handcrafted feature engineering such as SIFT illustrates the lesson: prior knowledge may offer early gains, while architectures that learn features from data can surpass them at scale. section 3.8

How Sutskever's List covers it

How deep it goes
Explains the scaling principle, qualifies the role of compute, and contrasts architectures without formal derivation.
Examples
Compares AlexNet’s learned features with handcrafted SIFT features and contrasts deep learning with convex optimization.
What you can do after
Evaluate whether a method can convert additional computation into improved performance.
How it connects
Connects feature engineering, deep learning, residual connections, computation, and data.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Sutskever's List. The section links point to the parts of the book it draws on.