AIAny

The Bitter Lesson

A 2019 essay arguing that over 70 years of AI, general methods that scale with computation — search and learning — consistently beat hand-coded human knowledge. The short text that crystallized the scaling-vs-priors debate.

Introduction

Every few years the same drama replays: a team hand-codes deep domain knowledge, wins the early benchmark, then gets buried by a cruder method that simply scales with compute. Rich Sutton's essay names that pattern and explains why it keeps catching researchers off guard — the win is "bitter" precisely because it beats the human-centric approach we are emotionally invested in.

Core Argument

Sutton reads 70 years of AI as one repeated experiment:

  • Search and learning are the only methods that scale arbitrarily with computation — everything else plateaus once compute grows.
  • Building in human knowledge pays off short-term, then caps progress — it complicates methods in ways that resist general scaling.
  • The engine is Moore's law: researchers optimize as if compute were fixed, but it inevitably explodes, rewarding whoever bet on general methods.
  • The evidence is a string of reversals — deep search over chess heuristics, AlphaGo's self-play over hand-built Go knowledge, statistical HMMs over phonetic models, CNNs over SIFT features.
Why It Still Matters

Great fit if you want the intellectual backbone of the "scaling hypothesis" — this ~700-word note is the root of debates that now shape LLM strategy and compute budgets. Look elsewhere if you want balance or rebuttal: it is a deliberately provocative thesis, and critics (notably Rodney Brooks' "A Better Lesson") argue it understates the data, architecture, and human design still baked into every supposedly "general" method.

Information

More Items

Enables multi-head, depth-wise residual retrieval in Transformers by expanding a single residual stream into multiple context-aware streams using causal depthwise convolutions. Improves pretraining convergence and downstream benchmark scores with minimal overhead, yielding notable iso-loss compute speedups in large MoE models.

A concise textbook-style book that explains foundational concepts and techniques for large language models, covering pre-training, generative models, prompting, alignment, inference, and reasoning. Structured as self-contained chapters for readers with some ML/NLP background or those seeking a principled introduction to LLM foundations.

Analyzes why self-evolving reasoning models collapse under repeated self-training and proposes R-Quest: a feedback-driven pipeline that trains solvers to reject invalid questions and uses a frozen base model to detect task-level repetition, filtering training data to sustain multi-round gains.