mlsanityData to 7 Oct 2026

Adapting by Pruning: A Case Study on BERT

arXiv 2105.03343 ↗First posted 7 May 2021cs.LG cs.CLcited by 11

Not on the map. Why?

Abstract (arXiv)

Adapting pre-trained neural models to downstream tasks has become the standard practice for obtaining high-quality models. In this work, we propose a novel model adaptation paradigm, adapting by pruning, which prunes neural connections in the pre-trained model to optimise the performance on the target task; all remaining connections have their weights intact. We formulate adapting-by-pruning as an optimisation problem with a differentiable loss and propose an efficient algorithm to prune the model. We prove that the algorithm is near-optimal under standard assumptions and apply the algorithm to adapt BERT to some GLUE tasks. Results suggest that our method can prune up to 50% weights in BERT while yielding similar performance compared to the fine-tuned full model. We also compare our method with other state-of-the-art pruning methods and study the topological differences of their obtained sub-networks.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 28 of its 28 references that are in the map. First posted on arXiv 7 May 2021.

Builds on

28 of 28 references.

References · 28

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  4. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  5. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
  6. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  7. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  8. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
  9. 2020What is the State of Neural Network Pruning?cited by 578
  10. 2015BinaryConnect: Training Deep Neural Networks with binary weights during propagationscited by 571
  11. 2017Learning multiple visual domains with residual adapterscited by 553
  12. 2019The State of Sparsity in Deep Neural Networkscited by 471
16 more
  1. 2019Q-BERT: Hessian Based Ultra Low Precision Quantization of BERTcited by 355
  2. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  3. 2020Revisiting Few-sample BERT Fine-tuningcited by 237
  4. 2019What's Hidden in a Randomly Weighted Neural Network?cited by 236
  5. 2020Supermasks in Superpositioncited by 223
  6. 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 206
  7. 2020Compressing BERT: Studying the Effects of Weight Pruning on Transfer Learningcited by 184
  8. 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 181
  9. 2019To Tune or Not to Tune? Adapting Pretrained Representations to Diverse Taskscited by 167
  10. 2020Training with Quantization Noise for Extreme Model Compressioncited by 145
  11. 2019Winning the Lottery with Continuous Sparsificationcited by 99
  12. 2020Compressing Large-Scale Transformer-Based Models: A Case Study on BERTcited by 95
  13. 2017Training Quantized Nets: A Deeper Understandingcited by 74
  14. 2020DeFormer: Decomposing Pre-trained Transformers for Faster Question Answeringcited by 29
  15. 2020Successfully Applying the Stabilized Lottery Ticket Hypothesis to the Transformer Architecturecited by 23
  16. 2020Disentangling Neural Architectures and Weights: A Case Study in Supervised Classificationcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 2; 2023: 5; 2024: 1; 2025: 0; 2026: 1.

11 papers.