Excess Description Length of Learning Generalizable Predictors
Not on the map. Why?
Abstract (arXiv)
Understanding whether fine-tuning elicits latent capabilities or teaches new ones is a fundamental question for language model evaluation and safety. We develop a formal information-theoretic framework for quantifying how much predictive structure fine-tuning extracts from the train dataset and writes into a model's parameters. Our central quantity, Excess Description Length (EDL), is defined via prequential coding and measures the gap between the bits required to encode training labels sequentially using an evolving model (trained online) and the residual encoding cost under the final trained model. We establish that EDL is non-negative in expectation, converges to surplus description length in the infinite-data limit, and provides bounds on expected generalization gain. Through a series of toy models, we clarify common confusions about information in learning: why random labels yield EDL near zero, how a single example can eliminate many bits of uncertainty about the underlying rule(s) that describe the data distribution, why structure learned on rare inputs contributes proportionally little to expected generalization, and how format learning creates early transients distinct from capability acquisition. This framework provides rigorous foundations for the empirical observation that capability elicitation and teaching exhibit qualitatively distinct scaling signatures.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 13 references that are in the map. First posted on arXiv 8 Jan 2026.
Builds on
5 of 13 references.
References · 5
- 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 303
- 2020Information-Theoretic Probing with Minimum Description Lengthcited by 232
- 2020Reasoning About Generalization via Conditional Mutual Informationcited by 147
- 2018The Description Length of Deep Learning Modelscited by 72
- 2020Evaluating representations by the complexity of learning low-loss predictorscited by 16
Built on by
Not cited yet.