What Is a Repeated Token Worth? The Scaling Geometry of Multi-Epoch Pretraining
Not on the map. Why?
Abstract (arXiv)
As pretraining increasingly repeats data, every run faces three questions: how many epochs to take, how that number should change with model size, and whether anything besides the epoch count matters. We answer them by pricing a repeated token against two references: one epoch on the same data, which gives its value, and fresh data at equal compute, which gives its cost. Against fresh data, the cost of repetition follows a single variable, the number of extra epochs divided by the unique tokens per parameter. Against the same data, a second epoch is worth nearly as much as a fresh one, and repeated tokens fall to half the value of fresh ones after a critical epoch count that grows with the training budget per parameter but hardly with model size. With unique data fixed, the predicted compute-optimal run grows model size and epochs together until loss stops improving, near the critical epoch count. The same variable accounts for the direction of size trends that appear to conflict: larger models tolerate fewer epochs when the corpus is fixed, from about 15 at 127M to 4 at 2B parameters, but not when unique data grow with the model. Counts alone do not determine loss: at identical counts, replaying shards consecutively raises loss by up to 0.46~bits per byte, concentrating repeats on fewer samples also raises it, lower-entropy sources degrade faster with repetition, and re-tokenizing repeats helps only under heavy repetition. These results offer an empirical guide to pretraining when unique data, rather than compute, are the binding constraint.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 30 of its 36 references that are in the map. First posted on arXiv 4 Oct 2026.
Builds on
30 of 36 references.
References · 30
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
- 2022Quantifying Memorization Across Neural Language Modelscited by 763
- 2021Deduplicating Training Data Makes Language Models Bettercited by 714
- 2018Subword Regularization: Improving Neural Network Translation Models with Multiple Subword Candidatescited by 639
- 2023Scaling Data-Constrained Language Modelscited by 403
- 2021Scaling Laws for Transfercited by 272
- 2022Memorization Without Overfitting: Analyzing the Training Dynamics of Large Language Modelscited by 220
- 2019BPE-Dropout: Simple and Effective Subword Regularizationcited by 195
- 2022Scaling Laws and Interpretability of Learning from Repeated Datacited by 152
- 2023To Repeat or Not To Repeat: Insights from Scaling LLM under Token-Crisiscited by 92
- 2024Scaling Laws for Data Filtering -- Data Curation cannot be Compute Agnosticcited by 77
18 more
- 2025Pre-training under infinite computecited by 29
- 2024Tokenization Falling Short: On Subword Robustness in Large Language Modelscited by 20
- 2024gzip Predicts Data-dependent Scaling Lawscited by 16
- 2025Larger Datasets Can Be Repeated More: A Theoretical Analysis of Multi-Epoch Scaling in Linear Regressioncited by 16
- 2026Prescriptive Scaling Laws for Data Constrained Trainingcited by 12
- 2026ERNIE 5.0 Technical Reportcited by 11
- 2025StochasTok: Improving Fine-Grained Subword Understanding in LLMscited by 7
- 2026Scaling Laws for Mixture Pretraining Under Data Constraintscited by 6
- 2026Scale Dependent Data Duplicationcited by 4
- 2026Demystifying Training-Time Augmentation for Data-Constrained Language Model Pretrainingcited by 4
- 2026Internal Data Repetition Destroys Language Modelscited by 4
- 2026InfoLaw: Information Scaling Laws for Large Language Models with Quality-Weighted Mixture Data and Repetitioncited by 3
- 2026Data-Constrained Language Model Pretraining: Improved Regularization and Scaling Lawscited by 3
- 2026When Data Is Scarce: Scaling Sparse Language Models with Repeated Trainingcited by 2
- 2026Repetition Mismatch: Why Data Mixture Experiments Don't Scale and How to Fix Themcited by 2
- 2026Bridging Compute- and Data-Optimal Pretrainingcited by 2
- 2026Pretraining Language Models with Subword Regularization: An Empirical Study of BPE Dropout in Low-Resource NLPcited by 1
- 2026Train Smarter, Not Longer: Memorization-Guided Data Reuse for Efficient LLM Trainingcited by 1
Built on by
Not cited yet.