Revisiting Neural Scaling Laws in Language and Vision
Ibrahim Alabdulmohsin, Behnam Neyshabur, Xiaohua Zhai
TL;DR
The paper investigates neural scaling laws in language and vision and argues that extrapolating learning curves provides a more reliable assessment of scaling behavior than interpolating fits. It introduces the Scaling Law Estimator M4, a sigmoid-like extension that recovers power-law behavior asymptotically while accommodating deviations, and validates it across image classification, neural machine translation, language modeling, and BIG-Bench tasks. The authors demonstrate that estimators optimized for best interpolation can misrepresent true extrapolations, and show that M4 achieves superior extrapolation RMSE in most tasks, often revealing more favorable scaling exponents for larger architectures. To accelerate research, they also release a 90-task benchmark for systematic evaluation of scaling laws.
Abstract
The remarkable progress in deep learning in recent years is largely driven by improvements in scale, where bigger models are trained on larger datasets for longer schedules. To predict the benefit of scale empirically, we argue for a more rigorous methodology based on the extrapolation loss, instead of reporting the best-fitting (interpolating) parameters. We then present a recipe for estimating scaling law parameters reliably from learning curves. We demonstrate that it extrapolates more accurately than previous methods in a wide range of architecture families across several domains, including image classification, neural machine translation (NMT) and language modeling, in addition to tasks from the BIG-Bench evaluation benchmark. Finally, we release a benchmark dataset comprising of 90 evaluation tasks to facilitate research in this domain.
