mlsanityData to 7 Oct 2026

Pruning Pre-trained Language Models Without Fine-Tuning

arXiv 2210.06210 ↗First posted 12 Oct 2022cs.CL cs.LGcited by 7

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

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  3. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  4. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
  5. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
  6. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  7. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
  8. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  9. 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,414
  10. 2020Making Pre-trained Language Models Better Few-shot Learnerscited by 1,255
  11. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
  12. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
9 more
  1. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
  2. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
  3. 2019Q-BERT: Hessian Based Ultra Low Precision Quantization of BERTcited by 355
  4. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  5. 2022Structured Pruning Learns Compact and Accurate Modelscited by 167
  6. 2022BiBERT: Accurate Fully Binarized BERTcited by 70
  7. 2021Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalizationcited by 56
  8. 2021From Dense to Sparse: Contrastive Pruning for Better Pre-trained Language Model Compressioncited by 18
  9. 2018Piggyback: Adapting a Single Network to Multiple Tasks by Learning to Mask Weightscited by 11

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 5.

7 papers.