In-Context Learning Before Specialisation: Theory of Learning in a Solvable Topic Model
Here we provide such a theory in a solvable topic model---documents drawn from a finite mixture of latent topics, mirroring the heterogeneity of modern pretraining data.
ProofPaper ↗
Key points
- Sequence models can generalise in fundamentally distinct ways: extrapolating structures seen in training, or using their prompt to adapt to novel tasks.
- Recent work has characterised many different strategies theoretically, and empirically described the transition between them as the quality and quantity of pretraining data vary.
- The dataset comes with two distinct solutions: a specialised predictor, that stores the finite topic mixture, and an in-context one, optimal for topics never seen during training.
- Our theory predicts their emergence at distinct sample complexities: the in-context predictor is available early, while the specialised one emerges only after the training tokens outnumber the parameters of the data-generating process.
Sources (1)
- [1]In-Context Learning Before Specialisation: Theory of Learning in a Solvable Topic ModelarXiv (AI, ML, NLP, CV, robotics, multi-agent) · Oct 15, 01:54 PM
Here we provide such a theory in a solvable topic model---documents drawn from a finite mixture of latent topics, mirroring the heterogeneity of modern pretraining data.
Sequence models can generalise in fundamentally distinct ways: extrapolating structures seen in training, or using their prompt to adapt to novel tasks.
Extractive summary: sentences quoted from the sources.
Before this
- Oct 15, 2026tencent/Hy-Memory-30B-A3B
- Oct 15, 2026Meta shakes up the frontiers, open and closed
- Oct 14, 2026OrionMoE-v1.0: A Mixture-of-Experts Foundation Model for Tabular In-Context Learning
- Oct 14, 2026Training Dynamics of Transformers on Unbounded Inputs: Attention Learning Can Lag Output Layer Learning
- Oct 14, 2026When Does Depth Help? Understanding Layerwise Inference in Tabular Foundation Models
- Oct 14, 2026mistralai/Timestral-209M
