Adapting by Pruning: A Case Study on BERT
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
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 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
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
- 2020What is the State of Neural Network Pruning?cited by 578
- 2015BinaryConnect: Training Deep Neural Networks with binary weights during propagationscited by 571
- 2017Learning multiple visual domains with residual adapterscited by 553
- 2019The State of Sparsity in Deep Neural Networkscited by 471
16 more
- 2019Q-BERT: Hessian Based Ultra Low Precision Quantization of BERTcited by 355
- 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
- 2020Revisiting Few-sample BERT Fine-tuningcited by 237
- 2019What's Hidden in a Randomly Weighted Neural Network?cited by 236
- 2020Supermasks in Superpositioncited by 223
- 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 206
- 2020Compressing BERT: Studying the Effects of Weight Pruning on Transfer Learningcited by 184
- 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 181
- 2019To Tune or Not to Tune? Adapting Pretrained Representations to Diverse Taskscited by 167
- 2020Training with Quantization Noise for Extreme Model Compressioncited by 145
- 2019Winning the Lottery with Continuous Sparsificationcited by 99
- 2020Compressing Large-Scale Transformer-Based Models: A Case Study on BERTcited by 95
- 2017Training Quantized Nets: A Deeper Understandingcited by 74
- 2020DeFormer: Decomposing Pre-trained Transformers for Faster Question Answeringcited by 29
- 2020Successfully Applying the Stabilized Lottery Ticket Hypothesis to the Transformer Architecturecited by 23
- 2020Disentangling Neural Architectures and Weights: A Case Study in Supervised Classificationcited by 2
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 5; 2024: 1; 2025: 0; 2026: 1.
11 papers.
- 2023Task-Specific Skill Localization in Fine-tuned Language Modelscited by 104
- 2023Adapting a Language Model While Preserving its General Knowledgecited by 23
- 2022Improving Personality Consistency in Conversation by Persona Extendingcited by 17
- 2022When Does Syntax Mediate Neural Language Model Performance? Evidence from Dropout Probescited by 12
- 2026Sponge Tool Attack: Stealthy Denial-of-Efficiency against Tool-Augmented Agentic Reasoningcited by 11
- 2023Sub-network Discovery and Soft-masking for Continual Learning of Mixed Taskscited by 7
- 2023A Survey of Personality, Persona, and Profile in Conversational Agents and Chatbotscited by 5
- 2024MSRS: Training Multimodal Speech Recognition Models from Scratch with Sparse Mask Optimizationcited by 2
- 2021Contradiction Detection in Persian Textcited by 1
- 2021Towards Handling Unconstrained User Preferences in Dialoguecited by 0
- 2023Harnessing the Web and Knowledge Graphs for Automated Impact Investing Scoringcited by 0
- 2026Sponge Tool Attack: Stealthy Denial-of-Efficiency against Tool-Augmented Agentic Reasoning24 Jan 2026
- 2024MSRS: Training Multimodal Speech Recognition Models from Scratch with Sparse Mask Optimization25 Jun 2024
- 2023A Survey of Personality, Persona, and Profile in Conversational Agents and Chatbots31 Dec 2023
- 2023Sub-network Discovery and Soft-masking for Continual Learning of Mixed Tasks13 Oct 2023
- 2023Harnessing the Web and Knowledge Graphs for Automated Impact Investing Scoring4 Aug 2023
- 2023Task-Specific Skill Localization in Fine-tuned Language Models13 Feb 2023
- 2023Adapting a Language Model While Preserving its General Knowledge21 Jan 2023
- 2022Improving Personality Consistency in Conversation by Persona Extending23 Aug 2022
- 2022When Does Syntax Mediate Neural Language Model Performance? Evidence from Dropout Probes20 Apr 2022
- 2021Towards Handling Unconstrained User Preferences in Dialogue17 Sep 2021
- 2021Contradiction Detection in Persian Text5 Jul 2021