Symmetric Pruning of Large Language Models
Not on the map. Why?
Abstract (arXiv)
Popular post-training pruning methods such as Wanda and RIA are known for their simple, yet effective, designs that have shown exceptional empirical performance. Wanda optimizes performance through calibrated activations during pruning, while RIA emphasizes the relative, rather than absolute, importance of weight elements. Despite their practical success, a thorough theoretical foundation explaining these outcomes has been lacking. This paper introduces new theoretical insights that redefine the standard minimization objective for pruning, offering a deeper understanding of the factors contributing to their success. Our study extends beyond these insights by proposing complementary strategies that consider both input activations and weight significance. We validate these approaches through rigorous experiments, demonstrating substantial enhancements over existing methods. Furthermore, we introduce a novel training-free fine-tuning approach R2-DSnoT that incorporates relative weight importance and a regularized decision boundary within a dynamic pruning-and-growing framework, significantly outperforming strong baselines and establishing a new state of the art.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 36 of its 45 references that are in the map. First posted on arXiv 31 Jan 2025.
Builds on
36 of 45 references.
References · 36
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 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
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 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
24 more
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,386
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2023Large Language Modelscited by 780
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
- 2023A Survey on Model Compression for Large Language Modelscited by 269
- 2024Extreme Compression of Large Language Models via Additive Quantizationcited by 232
- 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 189
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 179
- 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 151
- 2017Deep Rewiring: Training very sparse deep networkscited by 139
- 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 110
- 2023Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMscited by 61
- 2024PV-Tuning: Beyond Straight-Through Estimation for Extreme LLM Compressioncited by 61
- 2023Dynamic Sparse Training with Structured Sparsitycited by 38
- 2022Learning Best Combination for Efficient N:M Sparsitycited by 32
- 2024FedLLM-Bench: Realistic Benchmarks for Federated Learning of Large Language Modelscited by 30
- 2024MagR: Weight Magnitude Reduction for Enhancing Post-Training Quantizationcited by 28
- 2023E-Sparse: Boosting the Large Language Model Inference through Entropy-based N:M Sparsitycited by 15
- 2024FedP3: Federated Personalized and Privacy-friendly Network Pruning under Model Heterogeneitycited by 13
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.