mlsanityData to 14 Oct 2026

The Race to Efficiency: A New Perspective on AI Scaling Laws

arXiv 2501.02156 ↗First posted 4 Jan 2025cs.LG cs.AI cs.PFcited by 3

Not on the map. Why?

Abstract (arXiv)

As large-scale AI models expand, training becomes costlier and sustaining progress grows harder. Classical scaling laws (e.g., Kaplan et al. (2020), Hoffmann et al. (2022)) predict training loss from a static compute budget yet neglect time and efficiency, prompting the question: how can we balance ballooning GPU fleets with rapidly improving hardware and algorithms? We introduce the relative-loss equation, a time- and efficiency-aware framework that extends classical AI scaling laws. Our model shows that, without ongoing efficiency gains, advanced performance could demand millennia of training or unrealistically large GPU fleets. However, near-exponential progress remains achievable if the "efficiency-doubling rate" parallels Moore's Law. By formalizing this race to efficiency, we offer a quantitative roadmap for balancing front-loaded GPU investments with incremental improvements across the AI stack. Empirical trends suggest that sustained efficiency gains can push AI scaling well into the coming decade, providing a new perspective on the diminishing returns inherent in classical scaling.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 12 of its 24 references that are in the map. First posted on arXiv 4 Jan 2025.

Builds on

12 of 24 references.

References · 12

  1. 2020Language Models are Few-Shot Learnerscited by 32,419
  2. 2024The Llama 3 Herd of Modelscited by 14,715
  3. 2020Scaling Laws for Neural Language Modelscited by 6,586
  4. 2022Training Compute-Optimal Large Language Modelscited by 3,019
  5. 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameterscited by 1,986
  6. 2022STaR: Bootstrapping Reasoning With Reasoningcited by 940
  7. 2024Inference Scaling Laws: An Empirical Analysis of Compute-Optimal Inference for Problem-Solving with Language Modelscited by 290
  8. 2022Unified Scaling Laws for Routed Language Modelscited by 253
  9. 2022Sparse Upcycling: Training Mixture-of-Experts from Dense Checkpointscited by 209
  10. 2024Scaling Laws for Precisioncited by 95
  11. 2024Upcycling Large Language Models into Mixture of Expertscited by 49
  12. 2024Llama 3 Meets MoE: Efficient Upcyclingcited by 6

Built on by

Cited by year

Citing papers per year: 2025: 3.

3 papers.