Data Scarcity and Model Sparsity: Mixtures-of-Experts Overfit More to Repeated Data
cs.LG, cs.CL
Submitted: 2026-09-10
Updated: 2026-10-07
Code: https://github.com/togethercomputer/RedPajama-Data
License: http://creativecommons.org/licenses/by/4.0/
The gist: As the supply of human-written text is exhausted, it has become standard practice to repeat language model training data.
Terminology
Abstract
As the supply of human-written text is exhausted, it has become standard practice to repeat language model training data. Prior work has studied data repetition for densely activated Transformers, but the effects of data repetition remains largely unexplored for recently dominant sparse architectures such as Mixture-of-Experts (MoE), despite their increased compute efficiency. We vary data repetition rates across single- and multi-domain data mixes, and across MoE settings, including expert count and granularity. We consistently find, for models ranging from 80M to 1B active (8.5B total) parameters, that MoEs degrade more rapidly under data repetition. This effect increases with sparsity, dictated by total rather than active parameters. While 80M dense models can repeat data over 8x with minimal degradation, MoEs instead begin to suffer at 4x, and deteriorate rapidly, ceding their performance benefits in all-unique data settings to underperform dense models after 32x. We experiment with existing regularization methods as a potential remedy. We find that some methods, such as dropout, can mitigate overfitting. In particular, with strong masking-based regularization, MoEs are able to outperform dense models even when data is repeated more than 64 times. However, no method fully matches the performance of all-unique training data. Finally, we analyze internal mechanisms correlated with MoE overfitting in high repetition regimes, and find that MoE routing universally stabilizes early in training, and that expert specialization correlates with overfitting to repeated data. In sum, our work addresses the adverse interactions between sparsity and data repetition: we present evidence for the core mechanisms of overfitting and its potential remediation, and suggest promising avenues for future methods to reduce over-specialization in model parameters by disrupting memorization patterns.
Sources
- Internal Data Repetition Destroys Language Models
- BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions
- DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Models
- The Pile: An 800GB Dataset of Diverse Text for Language Modeling
- Scaling Laws and Interpretability of Learning from Repeated Data
- Training Compute-Optimal Large Language Models
- The Stack: 3 TB of permissively licensed source code
- InfoLaw: Information Scaling Laws for Large Language Models with Quality-Weighted Mixture Data and Repetition
- Prescriptive Scaling Laws for Data Constrained Training
- Paloma: A Benchmark for Evaluating Language Model Fit
- Pointer Sentinel Mixture Models
- A Bitter Lesson for Data Filtering
- Scaling Data-Constrained Language Models
- OLMoE: Open Mixture-of-Experts Language Models
- Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer
- Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer
- Dolma: an Open Corpus of Three Trillion Tokens for Language Model Pretraining Research
- KMMLU: Measuring Massive Multitask Language Understanding in Korean
- To Repeat or Not To Repeat: Insights from Scaling LLM under Token-Crisis
- HellaSwag: Can a Machine Really Finish Your Sentence?
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks