IDEA Prune: An Integrated Enlarge-and-Prune Pipeline in Generative Language Model Pretraining
Not on the map. Why?
Abstract (arXiv)
Recent advancements in large language models have intensified the need for efficient and deployable models within limited inference budgets. Structured pruning pipelines have shown promise in token efficiency compared to training target-size models from scratch. In this paper, we advocate incorporating enlarged model pretraining, which is often ignored in previous works, into pruning. We study the enlarge-and-prune pipeline as an integrated system to address two critical questions: whether it is worth pretraining an enlarged model even when the model is never deployed, and how to optimize the entire pipeline for better pruned models. We propose an integrated enlarge-and-prune pipeline, which combines enlarge model training, pruning, and recovery under a single cosine annealing learning rate schedule. This approach is further complemented by a novel iterative structured pruning method for gradual parameter removal. The proposed method helps to mitigate the knowledge loss caused by the rising learning rate in naive enlarge-and-prune pipelines and enable effective redistribution of model capacity among surviving neurons, facilitating smooth compression and enhanced performance. We conduct comprehensive experiments on compressing 2.8B models to 1.3B with up to 2T tokens in pretraining. It demonstrates the integrated approach not only provides insights into the token efficiency of enlarged model pretraining but also achieves superior performance of pruned models.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 29 of its 35 references that are in the map. First posted on arXiv 7 Mar 2025.
Builds on
29 of 35 references.
References · 29
- 2017Attention Is All You Needcited by 60,361
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2024Gemini 1.5: Unlocking multimodal understanding across millions of tokens of contextcited by 3,224
- 2023Mistral 7Bcited by 3,164
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
17 more
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
- 2024Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phonecited by 1,917
- 2024Mixtral of Expertscited by 1,823
- 2016Sequence-Level Knowledge Distillationcited by 801
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
- 2019Importance Estimation for Neural Network Pruningcited by 541
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
- 2024DataComp-LM: In search of the next generation of training sets for language modelscited by 398
- 2019Structured Pruning of Large Language Modelscited by 203
- 2022Structured Pruning Learns Compact and Accurate Modelscited by 170
- 2022A Fast Post-Training Pruning Framework for Transformerscited by 162
- 2024Compact Language Models via Pruning and Knowledge Distillationcited by 148
- 2023LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximationcited by 104
- 2022PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importancecited by 79
- 2019Global Sparse Momentum SGD for Pruning Very Deep Neural Networkscited by 70
- 2023HomoDistil: Homotopic Task-Agnostic Distillation of Pre-trained Transformerscited by 25
Built on by
Citing papers per year: 2025: 1.
1 paper.