From PEFT to DEFT: Parameter Efficient Finetuning for Reducing Activation Density in Transformers
Not on the map. Why?
Abstract (arXiv)
Pretrained Language Models (PLMs) have become the de facto starting point for fine-tuning on downstream tasks. However, as model sizes continue to increase, traditional fine-tuning of all the parameters becomes challenging. To address this, parameter-efficient fine-tuning (PEFT) methods have gained popularity as a means to adapt PLMs effectively. In parallel, recent studies have revealed the presence of activation sparsity within the intermediate outputs of the multilayer perceptron (MLP) blocks in transformers. Low activation density enables efficient model inference on sparsity-aware hardware. Building upon this insight, in this work, we propose a novel density loss that encourages higher activation sparsity (equivalently, lower activation density) in the pre-trained models. We demonstrate the effectiveness of our approach by utilizing mainstream PEFT techniques, including QLoRA, LoRA, Adapter, and Prompt/Prefix Tuning, to facilitate efficient model adaptation across diverse downstream tasks. Experiments show that our proposed method, DEFT (Density-Efficient Fine-Tuning), can consistently reduce activation density by up to 44.94% on RoBERTaLarge and by 53.19% (encoder density) and 90.60% (decoder density) on Flan-T5XXL (11B) compared to PEFT, using GLUE and QA (SQuAD) benchmarks respectively. We also introduce ADA-DEFT, an adaptive variant of our DEFT approach, which achieves significant memory and runtime savings during inference. For instance, ADA-DEFT reduces runtime by 8.79%and memory usage by 17.46% in Flan-T5XL, and by 2.79% and 2.54% respectively in Flan-T5XXL. Additionally, we showcase that DEFT works complementarily with quantized and pruned models.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 36 of its 48 references that are in the map. First posted on arXiv 2 Feb 2024.
Builds on
36 of 48 references.
References · 36
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 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
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2016Gaussian Error Linear Units (GELUs)cited by 3,431
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
24 more
- 2022Scaling Instruction-Finetuned Language Modelscited by 2,997
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2020GLU Variants Improve Transformercited by 1,724
- 2017Decoupled Weight Decay Regularizationcited by 1,722
- 2019Energy and Policy Considerations for Deep Learning in NLPcited by 1,242
- 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
- 2019Are Sixteen Heads Really Better than One?cited by 803
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 2020MAD-X: An Adapter-Based Framework for Multi-Task Cross-Lingual Transfercited by 443
- 2020AdapterHub: A Framework for Adapting Transformerscited by 441
- 2022DeepSpeed-MoE: Advancing Mixture-of-Experts Inference and Training to Power Next-Generation AI Scalecited by 400
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
- 2021MoEfication: Transformer Feed-forward Layers are Mixtures of Expertscited by 149
- 2020Sponge Examples: Energy-Latency Attacks on Neural Networkscited by 108
- 2020GOBO: Quantizing Attention-Based NLP Models for Low Latency and Energy Efficient Inferencecited by 103
- 2021Beyond Distillation: Task-level Mixture-of-Experts for Efficient Inferencecited by 96
- 2021Differentiable Subset Pruning of Transformer Headscited by 46
- 2021DSEE: Dually Sparsity-embedded Efficient Tuning of Pre-trained Language Modelscited by 8
- 2023Minimizing Energy Consumption of Deep Learning Models by Energy-Aware Trainingcited by 3
- 2020Sparsity Turns Adversarial: Energy and Latency Attacks on Deep Neural Networkscited by 1
Built on by
Citing papers per year: 2024: 1; 2025: 3.
4 papers.
- 2025MetaTT: A Global Tensor-Train Adapter for Parameter-Efficient Fine-Tuningcited by 4
- 2025Generalizable Multispectral Land Cover Classification via Frequency-Aware Mixture of Low-Rank Token Expertscited by 3
- 2024Uncovering Layer-Dependent Activation Sparsity Patterns in ReLU Transformerscited by 0
- 2025Automated Evolutionary Optimization for Resource-Efficient Neural Network Trainingcited by 0
- 2025Automated Evolutionary Optimization for Resource-Efficient Neural Network Training10 Oct 2025
- 2025MetaTT: A Global Tensor-Train Adapter for Parameter-Efficient Fine-Tuning10 Jun 2025
- 2025Generalizable Multispectral Land Cover Classification via Frequency-Aware Mixture of Low-Rank Token Experts20 May 2025
- 2024Uncovering Layer-Dependent Activation Sparsity Patterns in ReLU Transformers10 Jul 2024