PIP: Perturbation-based Iterative Pruning for Large Language Models
Not on the map. Why?
Abstract (arXiv)
The rapid increase in the parameter counts of Large Language Models (LLMs), which often reach into the billions or even trillions, presents significant challenges for their practical deployment, particularly in resource-constrained environments. To address this issue, we propose PIP (Perturbation-based Iterative Pruning), a novel double-view structured pruning method to optimize LLMs, which combines information from two different views: the unperturbed view and the perturbed view. With the calculation of gradient differences, PIP iteratively prunes those that struggle to distinguish between these two views. Our experiments show that PIP reduces the parameter count by approximately 20% while retaining over 85% of the original model's accuracy across varied benchmarks. In some cases, the performance of the pruned model is within 5% of the unpruned version, demonstrating PIP's ability to preserve key aspects of model effectiveness. Moreover, PIP consistently outperforms existing state-of-the-art (SOTA) structured pruning methods, establishing it as a leading technique for optimizing LLMs in constrained environments.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 23 of its 32 references that are in the map. First posted on arXiv 25 Jan 2025.
Builds on
23 of 32 references.
References · 23
- 2017Attention Is All You Needcited by 60,361
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2015Domain-Adversarial Training of Neural Networkscited by 3,044
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 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
- 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,298
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
11 more
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
- 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
- 2019Structured Pruning of Large Language Modelscited by 203
- 2020BinaryBERT: Pushing the Limit of BERT Quantizationcited by 178
- 2022A Fast Post-Training Pruning Framework for Transformerscited by 162
- 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 97
- 2020Contrastive Distillation on Intermediate Representations for Language Model Compressioncited by 57
- 2020Meta-KD: A Meta Knowledge Distillation Framework for Language Model Compression across Domainscited by 33
- 2023Matrix Compression via Randomized Low Rank and Low Precision Factorizationcited by 25
- 2024Tailored-LLaMA: Optimizing Few-Shot Learning in Pruned LLaMA Models with Task-Specific Promptscited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.