Scaling Laws and In-Context Learning: A Unified Theoretical Framework
Not on the map. Why?
Abstract (arXiv)
In-context learning (ICL) enables large language models to adapt to new tasks from demonstrations without parameter updates. Despite extensive empirical studies, a principled understanding of ICL emergence at scale remains more elusive. We present a unified theoretical framework connecting scaling laws to ICL emergence in transformers. Our analysis establishes that ICL performance follows power-law relationships with model depth L, width d, context length k, and training data D, with exponents determined by task structure. We show that under specific conditions, transformers implement gradient-based metalearning in their forward pass, with an effective learning rate ηeff = Theta(1/√Ld). We demonstrate sharp phase transitions at critical scales and derive optimal depth-width allocations favoring L^* propto N2/3, d^* propto N1/3 for the fixed parameter budget N = Ld. Systematic experiments on synthetic tasks validate our predictions, with measured scaling exponents closely matching theory. This work provides both necessary and sufficient conditions for the emergence of ICLs and establishes fundamental computational limits on what transformers can learn in-context.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 25 of its 29 references that are in the map. First posted on arXiv 9 Nov 2025.
Builds on
25 of 29 references.
References · 25
- 2017Attention Is All You Needcited by 59,932
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2021An Explanation of In-context Learning as Implicit Bayesian Inferencecited by 915
- 2022Transformers learn in-context by gradient descentcited by 714
- 2022What Can Transformers Learn In-Context? A Case Study of Simple Function Classescited by 700
- 2022What learning algorithm is in-context learning? Investigations with linear modelscited by 671
- 2020Hopfield Networks is All You Needcited by 461
- 2019Are Transformers universal approximators of sequence-to-sequence functions?cited by 404
- 2021Explaining Neural Scaling Lawscited by 353
13 more
- 2022Data Distributional Properties Drive Emergent In-Context Learning in Transformerscited by 303
- 2023Transformers as Statisticians: Provable In-Context Learning with In-Context Algorithm Selectioncited by 291
- 2023Transformers as Algorithms: Generalization and Stability in In-context Learningcited by 220
- 2022Why Can GPT Learn In-Context? Language Models Implicitly Perform Gradient Descent as Meta-Optimizerscited by 204
- 2022The Parallelism Tradeoff: Limitations of Log-Precision Transformerscited by 191
- 2020Tensor Programs II: Neural Tangent Kernel for Any Architecturecited by 139
- 2021Saturated Transformers are Constant-Depth Threshold Circuitscited by 137
- 2024Language models scale reliably with over-training and on downstream taskscited by 105
- 2023How Deep Neural Networks Learn Compositional Data: The Random Hierarchy Modelcited by 70
- 2020Towards Understanding Hierarchical Learning: Benefits of Neural Representationscited by 46
- 2024Understanding Scaling Laws with Statistical and Approximation Theory for Transformer Neural Networks on Intrinsically Low-dimensional Datacited by 30
- 2025In-Context Learning Is Provably Bayesian Inference: A Generalization Theory for Meta-Learningcited by 17
- 2025Scaling Laws are Redundancy Lawscited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.