STADE: Standard Deviation as a Pruning Metric
Not on the map. Why?
Abstract (arXiv)
Recently, Large Language Models (LLMs) have become very widespread and are used to solve a wide variety of tasks. To successfully handle these tasks, LLMs require longer training times and larger model sizes. This makes LLMs ideal candidates for pruning methods that reduce computational demands while maintaining performance. Previous methods require a retraining phase after pruning to maintain the original model's performance. However, state-of-the-art pruning methods, such as Wanda, prune the model without retraining, making the pruning process faster and more efficient. Building upon Wanda's work, this study provides a theoretical explanation of why the method is effective and leverages these insights to enhance the pruning process. Specifically, a theoretical analysis of the pruning problem reveals a common scenario in Machine Learning where Wanda is the optimal pruning method. Furthermore, this analysis is extended to cases where Wanda is no longer optimal, leading to the development of a new method, STADE, based on the standard deviation of the input. From a theoretical standpoint, STADE demonstrates better generality across different scenarios. Finally, extensive experiments on Llama and Open Pre-trained Transformers (OPT) models validate these theoretical findings, showing that depending on the training conditions, Wanda's optimal performance varies as predicted by the theoretical framework. These insights contribute to a more robust understanding of pruning strategies and their practical implications. Code is available at: https://github.com/Coello-dev/STADE/
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 33 of its 50 references that are in the map. First posted on arXiv 28 Mar 2025.
Builds on
33 of 50 references.
References · 33
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 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
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2016Layer Normalizationcited by 5,669
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2023Qwen Technical Reportcited by 3,344
21 more
- 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
- 2018Group Normalizationcited by 1,524
- 2019Root Mean Square Layer Normalizationcited by 1,480
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
- 2024The Era of 1-bit LLMs: All Large Language Models are in 1.58 Bitscited by 308
- 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 221
- 2024OS-Copilot: Towards Generalist Computer Agents with Self-Improvementcited by 205
- 2020Integer Quantization for Deep Learning Inference: Principles and Empirical Evaluationcited by 188
- 2021Chasing Sparsity in Vision Transformers: An End-to-End Explorationcited by 183
- 2022Compute Trends Across Three Eras of Machine Learningcited by 163
- 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
- 2019One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizerscited by 102
- 2024BESA: Pruning Large Language Models with Blockwise Parameter-Efficient Sparsity Allocationcited by 45
- 2024LoRA-drop: Efficient LoRA Parameter Pruning based on Output Evaluationcited by 38
Built on by
Citing papers per year: 2026: 1.
1 paper.