Small LLMs: Pruning vs. Training from Scratch
Not on the map. Why?
Abstract (arXiv)
Pruning promises a shortcut to strong small language models. In this work, we examine this promise by pruning Llama-3.1-8B at pruning ratios of 0.5--0.8 with six methods spanning depth, width, and sparse granularities, under two controlled token-matched settings. (1) With the same training token budget, pruned initialization consistently outperforms random initialization. This shows that the parent model provides a strong starting point, although the advantage narrows as the training token budget grows and as the pruning ratio rises, nearly vanishing at the highest pruning ratio we study. (2) When training from scratch is instead given the full token budget consumed by the whole pipeline, pruning at finer granularities still retains an advantage, while coarser structured pruning can be matched or surpassed. This suggests that the parent model transfers knowledge that additional training tokens alone cannot fully recover, but only at fine granularity. Taken together, our results yield a clear recommendation: with a large pretrained model in hand and a limited training token budget, pruning is better than training from scratch; when the training budget is not limited, training from scratch can be competitive for coarser pruning, so a large pretrained parent is not always necessary.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 52 of its 63 references that are in the map. First posted on arXiv 12 Jun 2026.
Builds on
52 of 63 references.
References · 52
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 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
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,160
38 more
- 2016Pruning Filters for Efficient ConvNetscited by 1,143
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2017Crowdsourcing Multiple Choice Science Questionscited by 765
- 2023The RefinedWeb Dataset for Falcon LLM: Outperforming Curated Corpora with Web Data, and Web Data Onlycited by 763
- 2024MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategiescited by 723
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2023An Empirical Study of Catastrophic Forgetting in Large Language Models During Continual Fine-tuningcited by 639
- 2018Rethinking the Value of Network Pruningcited by 599
- 2020Scaling Laws for Autoregressive Generative Modelingcited by 522
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
- 2024Dolma: an Open Corpus of Three Trillion Tokens for Language Model Pretraining Researchcited by 483
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 442
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
- 2023Scaling Data-Constrained Language Modelscited by 403
- 2024DataComp-LM: In search of the next generation of training sets for language modelscited by 398
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
- 2019ERNIE 2.0: A Continual Pre-training Framework for Language Understandingcited by 231
- 2021Accelerating Sparse Deep Neural Networkscited by 223
- 2024RedPajama: an Open Dataset for Training Large Language Modelscited by 182
- 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 179
- 2024Scaling Laws and Compute-Optimal Training Beyond Fixed Training Durationscited by 170
- 2024Compact Language Models via Pruning and Knowledge Distillationcited by 148
- 2023Continual Pre-Training of Large Language Models: How to (re)warm your model?cited by 137
- 2024Simple and Scalable Strategies to Continually Pre-train Large Language Modelscited by 127
- 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 111
- 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
- 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 97
- 2024Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methodscited by 82
- 2024LLM Pruning and Distillation in Practice: The Minitron Approachcited by 82
- 2016A Thorough Examination of the CNN/Daily Mail Reading Comprehension Taskcited by 72
- 2024Reuse, Don't Retrain: A Recipe for Continued Pretraining of Language Modelscited by 72
- 2023Initializing Models with Larger Onescited by 39
- 2025Pre-training under infinite computecited by 29
- 2025Wanda++: Pruning Large Language Models via Regional Gradientscited by 26
50 most cited of 52 All 52 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.