Pruning Pre-trained Language Models Without Fine-Tuning
Not on the map. Why?
Abstract (arXiv)
To overcome the overparameterized problem in Pre-trained Language Models (PLMs), pruning is widely used as a simple and straightforward compression method by directly removing unimportant weights. Previous first-order methods successfully compress PLMs to extremely high sparsity with little performance drop. These methods, such as movement pruning, use first-order information to prune PLMs while fine-tuning the remaining weights. In this work, we argue fine-tuning is redundant for first-order pruning, since first-order pruning is sufficient to converge PLMs to downstream tasks without fine-tuning. Under this motivation, we propose Static Model Pruning (SMP), which only uses first-order pruning to adapt PLMs to downstream tasks while achieving the target sparsity level. In addition, we also design a new masking function and training objective to further improve SMP. Extensive experiments at various sparsity levels show SMP has significant improvements over first-order and zero-order methods. Unlike previous first-order methods, SMP is also applicable to low sparsity and outperforms zero-order methods. Meanwhile, SMP is more parameter efficient than other methods due to it does not require fine-tuning.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 21 of its 33 references that are in the map. First posted on arXiv 12 Oct 2022.
Builds on
21 of 33 references.
References · 21
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,414
- 2020Making Pre-trained Language Models Better Few-shot Learnerscited by 1,255
- 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
9 more
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
- 2019Q-BERT: Hessian Based Ultra Low Precision Quantization of BERTcited by 355
- 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
- 2022Structured Pruning Learns Compact and Accurate Modelscited by 167
- 2022BiBERT: Accurate Fully Binarized BERTcited by 70
- 2021Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalizationcited by 56
- 2021From Dense to Sparse: Contrastive Pruning for Better Pre-trained Language Model Compressioncited by 18
- 2018Piggyback: Adapting a Single Network to Multiple Tasks by Learning to Mask Weightscited by 11
Built on by
Citing papers per year: 2023: 2; 2024: 5.
7 papers.
- 2024Model Compression and Efficient Inference for Large Language Models: A Surveycited by 62
- 2024Faster and Lighter LLMs: A Survey on Current Challenges and Way Forwardcited by 20
- 2024Beware of Calibration Data for Pruning Large Language Modelscited by 14
- 2023The Cost of Down-Scaling Language Models: Fact Recall Deteriorates before In-Context Learningcited by 6
- 2023MUX-PLMs: Data Multiplexing for High-throughput Language Modelscited by 4
- 2024Train & Constrain: Phonologically Informed Tongue-Twister Generation from Topics and Paraphrasescited by 3
- 2024Assessing the Portability of Parameter Matrices Trained by Parameter-Efficient Finetuning Methodscited by 2
- 2024Beware of Calibration Data for Pruning Large Language Models23 Oct 2024
- 2024Train & Constrain: Phonologically Informed Tongue-Twister Generation from Topics and Paraphrases20 Mar 2024
- 2024Model Compression and Efficient Inference for Large Language Models: A Survey15 Feb 2024
- 2024Faster and Lighter LLMs: A Survey on Current Challenges and Way Forward2 Feb 2024
- 2024Assessing the Portability of Parameter Matrices Trained by Parameter-Efficient Finetuning Methods25 Jan 2024
- 2023The Cost of Down-Scaling Language Models: Fact Recall Deteriorates before In-Context Learning7 Oct 2023
- 2023MUX-PLMs: Data Multiplexing for High-throughput Language Models24 Feb 2023