Task-specific Compression for Multi-task Language Models using Attribution-based Pruning
Not on the map. Why?
Abstract (arXiv)
Multi-task language models show outstanding performance for various natural language understanding tasks with only a single model. However, these language models utilize an unnecessarily large number of model parameters, even when used only for a specific task. This paper proposes a novel training-free compression method for multi-task language models using a pruning method. Specifically, we use an attribution method to determine which neurons are essential for performing a specific task. We task-specifically prune unimportant neurons and leave only task-specific parameters. Furthermore, we extend our method to be applicable in low-resource and unsupervised settings. Since our compression method is training-free, it uses few computing resources and does not destroy the pre-trained knowledge of language models. Experimental results on the six widely-used datasets show that our proposed pruning method significantly outperforms baseline pruning methods. In addition, we demonstrate that our method preserves performance even in an unseen domain setting.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 35 of its 45 references that are in the map. First posted on arXiv 9 May 2022.
Builds on
35 of 45 references.
References · 35
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2020Longformer: The Long-Document Transformercited by 3,362
- 2019XLNet: Generalized Autoregressive Pretraining for Language Understandingcited by 2,801
23 more
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,718
- 2020Big Bird: Transformers for Longer Sequencescited by 1,673
- 2020Linformer: Self-Attention with Linear Complexitycited by 1,462
- 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2014Striving for Simplicity: The All Convolutional Netcited by 983
- 2019Are Sixteen Heads Really Better than One?cited by 803
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
- 2019Patient Knowledge Distillation for BERT Model Compressioncited by 502
- 2020MobileBERT: a Compact Task-Agnostic BERT for Resource-Limited Devicescited by 476
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
- 2019Q-BERT: Hessian Based Ultra Low Precision Quantization of BERTcited by 355
- 2020DynaBERT: Dynamic BERT with Adaptive Width and Depthcited by 246
- 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 220
- 2018Online Structured Laplace Approximations For Overcoming Catastrophic Forgettingcited by 197
- 2021Learned Token Pruning for Transformerscited by 138
- 2020EarlyBERT: Efficient BERT Training via Early-bird Lottery Ticketscited by 79
- 2020LadaBERT: Lightweight Adaptation of BERT through Hybrid Model Compressioncited by 45
- 2021Magic Pyramid: Accelerating Inference with Early Exiting and Token Pruningcited by 15
- 2021ROSITA: Refined BERT cOmpreSsion with InTegrAted techniquescited by 14
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 3; 2026: 1.
7 papers.
- 2024Model Compression and Efficient Inference for Large Language Models: A Surveycited by 62
- 2023Mitigating Biases for Instruction-following Language Models via Bias Neurons Eliminationcited by 23
- 2025FaithUn: Toward Faithful Forgetting in Language Models by Investigating the Interconnectedness of Knowledgecited by 5
- 2024VTrans: Accelerating Transformer Compression with Variational Information Bottleneck based Pruningcited by 3
- 2025CachePrune: Teaching LLMs What Not to Follow via KV-Cache Editingcited by 2
- 2025Fairness Evaluation and Inference Level Mitigation in LLMscited by 2
- 2026Knowing Bias, Doing Better: Mitigating Social Bias in LLMs via Know-Bias Neuron Enhancementcited by 0
- 2026Knowing Bias, Doing Better: Mitigating Social Bias in LLMs via Know-Bias Neuron Enhancement29 Jan 2026
- 2025Fairness Evaluation and Inference Level Mitigation in LLMs21 Oct 2025
- 2025CachePrune: Teaching LLMs What Not to Follow via KV-Cache Editing29 Apr 2025
- 2025FaithUn: Toward Faithful Forgetting in Language Models by Investigating the Interconnectedness of Knowledge26 Feb 2025
- 2024VTrans: Accelerating Transformer Compression with Variational Information Bottleneck based Pruning7 Jun 2024
- 2024Model Compression and Efficient Inference for Large Language Models: A Survey15 Feb 2024
- 2023Mitigating Biases for Instruction-following Language Models via Bias Neurons Elimination16 Nov 2023