mlsanityData to 14 Oct 2026

q0: Primitives for Hyper-Epoch Pretraining

arXiv 2606.03938 ↗First posted 2 Jun 2026cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Multi-epoch training is becoming the standard now that compute is growing faster than the supply of high-quality text. But pretraining a single model saturates within a few passes, long before the compute budget is exhausted. We argue this calls for a conceptual shift from training a single model toward exploring a population of models and aggregating their predictions. We introduce hyper-epoch pretraining (q0), which turns a multi-epoch budget into a population of diverse models whose combined predictions reach a lower validation loss than a single refined model. q0 reduces to three core primitives. A cyclic schedule with anti-correlated learning rate and weight decay collects diverse models from a few parallel trajectories. Chain distillation trains each model against its predecessor so that model quality compounds across the population. A learned prior, fit on a held out set, selects and weights members for any inference budget. On a 1.8B-parameter model trained on 100M FineWeb tokens, q0 matches a strong 256-epoch ensemble baseline using only ~56 epochs (~4.6x fewer), or ~67 epochs (~3.8x fewer) when matched to the baseline's ensemble size, and continues to improve beyond it. These gains reach cumulative ~12.9x data efficiency under the Slowrun setting and transfer to downstream benchmarks. Crucially, the optimal allocation shifts with the budget, so we give prescriptive recipes for how to spend a given epoch budget to maximize generalization, from a single epoch up to the largest budgets.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 23 of its 33 references that are in the map. First posted on arXiv 2 Jun 2026.

Builds on

23 of 33 references.

References · 23

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  2. 2020Scaling Laws for Neural Language Modelscited by 6,586
  3. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  5. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
  6. 2022Training Compute-Optimal Large Language Modelscited by 3,019
  7. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  8. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
  9. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
  10. 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,160
  11. 2022STaR: Bootstrapping Reasoning With Reasoningcited by 940
  12. 2017Crowdsourcing Multiple Choice Science Questionscited by 765
11 more
  1. 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
  2. 2018Born Again Neural Networkscited by 546
  3. 2019Deep Ensembles: A Loss Landscape Perspectivecited by 443
  4. 2017Snapshot Ensembles: Train 1, get M for freecited by 350
  5. 2018Essentially No Barriers in Neural Network Energy Landscapecited by 330
  6. 2021Accounting for Variance in Machine Learning Benchmarkscited by 201
  7. 2020Self-Distillation Amplifies Regularization in Hilbert Spacecited by 173
  8. 2018Snapshot Distillation: Teacher-Student Optimization in One Generationcited by 99
  9. 2021Nondeterminism and Instability in Neural Network Optimizationcited by 48
  10. 2022Efficient Knowledge Distillation from Model Checkpointscited by 37
  11. 2026Prescriptive Scaling Laws for Data Constrained Trainingcited by 12

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.