Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.01618 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912832444956672 |
|---|---|
| author | Dey, Nolan Zhang, Bin Claire Noci, Lorenzo Li, Mufan Bordelon, Blake Bergsma, Shane Pehlevan, Cengiz Hanin, Boris Hestness, Joel |
| author_facet | Dey, Nolan Zhang, Bin Claire Noci, Lorenzo Li, Mufan Bordelon, Blake Bergsma, Shane Pehlevan, Cengiz Hanin, Boris Hestness, Joel |
| contents | We study compute efficiency of LLM training when using different parameterizations, i.e., rules for adjusting model and optimizer hyperparameters (HPs) as model size changes. Some parameterizations fail to transfer optimal base HPs (such as learning rate) across changes in model depth, requiring practitioners to either re-tune these HPs as they scale up (expensive), or accept sub-optimal training when re-tuning is prohibitive. Even when they achieve HP transfer, we develop theory to show parameterizations may still exist in the lazy learning regime where layers learn only features close to their linearization, preventing effective use of depth and nonlinearity. Finally, we identify and adopt the parameterization we call CompleteP that achieves both depth-wise HP transfer and non-lazy learning in all layers. CompleteP enables a wider range of model width/depth ratios to remain compute-efficient, unlocking shapes better suited for different hardware settings and operational contexts. Moreover, CompleteP enables 12-34% compute efficiency improvements over the prior state-of-the-art. All experiments were run on Cerebras CS-3 systems. A minimal implementation is available at https://github.com/EleutherAI/nanoGPT-mup/tree/completep. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_01618 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Don't be lazy: CompleteP enables compute-efficient deep transformers Dey, Nolan Zhang, Bin Claire Noci, Lorenzo Li, Mufan Bordelon, Blake Bergsma, Shane Pehlevan, Cengiz Hanin, Boris Hestness, Joel Machine Learning Artificial Intelligence We study compute efficiency of LLM training when using different parameterizations, i.e., rules for adjusting model and optimizer hyperparameters (HPs) as model size changes. Some parameterizations fail to transfer optimal base HPs (such as learning rate) across changes in model depth, requiring practitioners to either re-tune these HPs as they scale up (expensive), or accept sub-optimal training when re-tuning is prohibitive. Even when they achieve HP transfer, we develop theory to show parameterizations may still exist in the lazy learning regime where layers learn only features close to their linearization, preventing effective use of depth and nonlinearity. Finally, we identify and adopt the parameterization we call CompleteP that achieves both depth-wise HP transfer and non-lazy learning in all layers. CompleteP enables a wider range of model width/depth ratios to remain compute-efficient, unlocking shapes better suited for different hardware settings and operational contexts. Moreover, CompleteP enables 12-34% compute efficiency improvements over the prior state-of-the-art. All experiments were run on Cerebras CS-3 systems. A minimal implementation is available at https://github.com/EleutherAI/nanoGPT-mup/tree/completep. |
| title | Don't be lazy: CompleteP enables compute-efficient deep transformers |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2505.01618 |