Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.02119 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911041123778560 |
|---|---|
| author | Qiu, Shikai Xiao, Lechao Wilson, Andrew Gordon Pennington, Jeffrey Agarwala, Atish |
| author_facet | Qiu, Shikai Xiao, Lechao Wilson, Andrew Gordon Pennington, Jeffrey Agarwala, Atish |
| contents | What scaling limits govern neural network training dynamics when model size and training time grow in tandem? We show that despite the complex interactions between architecture, training algorithms, and data, compute-optimally trained models exhibit a remarkably precise universality. Specifically, loss curves from models of varying sizes collapse onto a single universal curve when training compute and loss are normalized to unity at the end of training. With learning rate decay, the collapse becomes so tight that differences in the normalized curves across models fall below the noise floor of individual loss curves across random seeds, a phenomenon we term supercollapse. We observe supercollapse across learning rate schedules, datasets, and architectures, including transformers trained on next-token prediction, and find it breaks down when hyperparameters are scaled suboptimally, providing a precise and practical indicator of good scaling. We explain these phenomena by connecting collapse to the power-law structure in typical neural scaling laws, and analyzing a simple yet surprisingly effective model of SGD noise dynamics that accurately predicts loss curves across various learning rate schedules and quantitatively explains the origin of supercollapse. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_02119 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Scaling Collapse Reveals Universal Dynamics in Compute-Optimally Trained Neural Networks Qiu, Shikai Xiao, Lechao Wilson, Andrew Gordon Pennington, Jeffrey Agarwala, Atish Machine Learning What scaling limits govern neural network training dynamics when model size and training time grow in tandem? We show that despite the complex interactions between architecture, training algorithms, and data, compute-optimally trained models exhibit a remarkably precise universality. Specifically, loss curves from models of varying sizes collapse onto a single universal curve when training compute and loss are normalized to unity at the end of training. With learning rate decay, the collapse becomes so tight that differences in the normalized curves across models fall below the noise floor of individual loss curves across random seeds, a phenomenon we term supercollapse. We observe supercollapse across learning rate schedules, datasets, and architectures, including transformers trained on next-token prediction, and find it breaks down when hyperparameters are scaled suboptimally, providing a precise and practical indicator of good scaling. We explain these phenomena by connecting collapse to the power-law structure in typical neural scaling laws, and analyzing a simple yet surprisingly effective model of SGD noise dynamics that accurately predicts loss curves across various learning rate schedules and quantitatively explains the origin of supercollapse. |
| title | Scaling Collapse Reveals Universal Dynamics in Compute-Optimally Trained Neural Networks |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2507.02119 |