Learning Theory of Transformers: Generalization and Optimization of In-Context Learning
summary
Claims that pretrained Transformers reach minimax optimality for in‑context regression by learning shared nonlinear features and then doing linear (ridge) readout; analysis uses a truncated infinite‑feature model with context length n and T pretraining tasks and proves test risk converges to Bayes optimal as T grows. Optimization guarantees come from mean‑field two‑layer networks, Wasserstein gradient flow and a strict‑saddle property that lets gradient dynamics escape saddles; experiments show learned linear attention approximates ridge regression and matches the theory.
AI-written summary · about
chapters (5)
- 0:00Transformer learning theory intro
- 4:44In-context learning statistics
- 16:32Linear attention & ridge regression
- 31:40Mean field optimization
- 42:44Summary & open challenges
related talks
01h 30mToward Understanding In-context Learning
01h 27mChallenges in Making LLMs Safe and Robust
01h 33mOn large language models and transformers: perspectives from physics, neuroscience, and theory
40mAn Occam's Razor Principle for Transformers?
01h 01mOptimization's Untold Gift to Learning: Implicit Regularization
38mHow Transformers Learn Causal Structure with Gradient Descent
01h 23mImplicit Regularization II
01h 16mHow Do Transformers Work?
