PrunePEFT: Iterative Hybrid Pruning for Parameter-Efficient Fine-tuning of LLMs
Not on the map. Why?
Abstract (arXiv)
Parameter Efficient Fine-Tuning (PEFT) methods have emerged as effective and promising approaches for fine-tuning pre-trained language models. Compared with Full parameter Fine-Tuning (FFT), PEFT achieved comparable task performance with a substantial reduction of trainable parameters, which largely saved the training and storage costs. However, using the PEFT method requires considering a vast design space, such as the type of PEFT modules and their insertion layers. Inadequate configurations can lead to sub-optimal results. Conventional solutions such as architectural search techniques, while effective, tend to introduce substantial additional overhead. In this paper, we propose a novel approach, PrunePEFT, which formulates the PEFT strategy search as a pruning problem and introduces a hybrid pruning strategy that capitalizes on the sensitivity of pruning methods to different PEFT modules. This method extends traditional pruning techniques by iteratively removing redundant or conflicting PEFT modules, thereby optimizing the fine-tuned configuration. By efficiently identifying the most relevant modules, our approach significantly reduces the computational burden typically associated with architectural search processes, making it a more scalable and efficient solution for fine-tuning large pre-trained models.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 30 of its 38 references that are in the map. First posted on arXiv 9 Jun 2025.
Builds on
30 of 38 references.
References · 30
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,245
- 2019BERT Rediscovers the Classical NLP Pipelinecited by 1,059
- 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 872
- 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 788
- 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 541
18 more
- 2021Datasets: A Community Library for Natural Language Processingcited by 530
- 2020MAD-X: An Adapter-Based Framework for Multi-Task Cross-Lingual Transfercited by 445
- 2020AdapterHub: A Framework for Adapting Transformerscited by 444
- 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 357
- 2020AdapterDrop: On the Efficiency of Adapters in Transformerscited by 224
- 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 221
- 2020Proving the Lottery Ticket Hypothesis: Pruning is All You Needcited by 201
- 2018Auto-Keras: An Efficient Neural Architecture Search Systemcited by 171
- 2021UniPELT: A Unified Framework for Parameter-Efficient Language Model Tuningcited by 162
- 2020Probing Pretrained Language Models for Lexical Semanticscited by 156
- 2022AdaMix: Mixture-of-Adaptations for Parameter-efficient Model Tuningcited by 137
- 2019One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizerscited by 102
- 2023Parameter-Efficient Fine-Tuning Design Spacescited by 67
- 2020Methods for Pruning Deep Neural Networkscited by 49
- 2023AutoPEFT: Automatic Configuration Search for Parameter-Efficient Fine-Tuningcited by 49
- 2021When to Prune? A Policy towards Early Structural Pruningcited by 38
- 2023Neural Architecture Search for Parameter-Efficient Fine-tuning of Large Pre-trained Language Modelscited by 25
- 2021Blending Pruning Criteria for Convolutional Neural Networkscited by 13
Built on by
Not cited yet.