mlsanityData to 7 Oct 2026

How to Prune Your Language Model: Recovering Accuracy on the "Sparsity May Cry'' Benchmark

arXiv 2312.13547 ↗First posted 21 Dec 2023cs.CLcited by 2

Not on the map. Why?

Abstract (arXiv)

Pruning large language models (LLMs) from the BERT family has emerged as a standard compression benchmark, and several pruning methods have been proposed for this task. The recent ``Sparsity May Cry'' (SMC) benchmark put into question the validity of all existing methods, exhibiting a more complex setup where many known pruning methods appear to fail. We revisit the question of accurate BERT-pruning during fine-tuning on downstream datasets, and propose a set of general guidelines for successful pruning, even on the challenging SMC benchmark. First, we perform a cost-vs-benefits analysis of pruning model components, such as the embeddings and the classification head; second, we provide a simple-yet-general way of scaling training, sparsification and learning rate schedules relative to the desired target sparsity; finally, we investigate the importance of proper parametrization for Knowledge Distillation in the context of LLMs. Our simple insights lead to state-of-the-art results, both on classic BERT-pruning benchmarks, as well as on the SMC benchmark, showing that even classic gradual magnitude pruning (GMP) can yield competitive results, with the right approach.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 20 of its 25 references that are in the map. First posted on arXiv 21 Dec 2023.

Builds on

20 of 25 references.

References · 20

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  4. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  5. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  6. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  7. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
  8. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  9. 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,793
  10. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
  11. 2021Datasets: A Community Library for Natural Language Processingcited by 526
  12. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
8 more
  1. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
  2. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  3. 2021Block Pruning For Faster Transformerscited by 176
  4. 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
  5. 2022PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importancecited by 79
  6. 2021Prune Once for All: Sparse Pre-Trained Language Modelscited by 66
  7. 2021Rethinking Network Pruning -- under the Pre-train and Fine-tune Paradigmcited by 40
  8. 2023Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!cited by 27

Built on by

Cited by year

Citing papers per year: 2024: 2.

2 papers.