mlsanityData to 7 Oct 2026

DARE the Extreme: Revisiting Delta-Parameter Pruning For Fine-Tuned Models

arXiv 2410.09344 ↗First posted 12 Oct 2024cs.LG cs.AI cs.CLcited by 10

Not on the map. Why?

Abstract (arXiv)

Storing open-source fine-tuned models separately introduces redundancy and increases response times in applications utilizing multiple models. Delta-parameter pruning (DPP), particularly the random drop and rescale (DARE) method proposed by Yu et al., addresses this by pruning the majority of delta parameters--the differences between fine-tuned and pre-trained model weights--while typically maintaining minimal performance loss. However, DARE fails when either the pruning rate or the magnitude of the delta parameters is large. We highlight two key reasons for this failure: (1) an excessively large rescaling factor as pruning rates increase, and (2) high mean and variance in the delta parameters. To push DARE's limits, we introduce DAREx (DARE the eXtreme), which features two algorithmic improvements: (1) DAREx-q, a rescaling factor modification that significantly boosts performance at high pruning rates (e.g., >30 % on COLA and SST2 for encoder models, with even greater gains in decoder models), and (2) DAREx-L2, which combines DARE with AdamR, an in-training method that applies appropriate delta regularization before DPP. We also demonstrate that DAREx-q can be seamlessly combined with vanilla parameter-efficient fine-tuning techniques like LoRA and can facilitate structural DPP. Additionally, we revisit the application of importance-based pruning techniques within DPP, demonstrating that they outperform random-based methods when delta parameters are large. Through this comprehensive study, we develop a pipeline for selecting the most appropriate DPP method under various practical scenarios.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 46 of its 60 references that are in the map. First posted on arXiv 12 Oct 2024.

Builds on

46 of 60 references.

References · 46

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  5. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  6. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  7. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
  8. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  9. 2023A Survey of Large Language Modelscited by 2,537
  10. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  11. 2024Qwen2 Technical Reportcited by 2,076
  12. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
34 more
  1. 2021Multitask Prompted Training Enables Zero-Shot Task Generalizationcited by 1,462
  2. 2019Root Mean Square Layer Normalizationcited by 1,425
  3. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
  4. 2022Editing Models with Task Arithmeticcited by 1,076
  5. 2017SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluationcited by 998
  6. 2018Neural Network Acceptability Judgmentscited by 952
  7. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
  8. 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
  9. 2023MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Modelscited by 724
  10. 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 679
  11. 2023WizardMath: Empowering Mathematical Reasoning for Large Language Models via Reinforced Evol-Instructcited by 618
  12. 2021ImageNet-21K Pretraining for the Massescited by 607
  13. 2021FedBN: Federated Learning on Non-IID Features via Local Batch Normalizationcited by 565
  14. 2024Prometheus 2: An Open Source Language Model Specialized in Evaluating Other Language Modelscited by 431
  15. 2023Llemma: An Open Language Model For Mathematicscited by 385
  16. 2020Fine-Tuning Pretrained Language Models: Weight Initializations, Data Orders, and Early Stoppingcited by 377
  17. 2020Parameter-Efficient Transfer Learning with Diff Pruningcited by 351
  18. 2024BioMistral: A Collection of Open-Source Pretrained Large Language Models for Medical Domainscited by 299
  19. 2024Massive Activations in Large Language Modelscited by 277
  20. 2019Understanding and Improving Layer Normalizationcited by 213
  21. 2024Evolutionary Optimization of Model Merging Recipescited by 204
  22. 2024Arcee's MergeKit: A Toolkit for Merging Large Language Modelscited by 189
  23. 2022Outlier Suppression: Pushing the Limit of Low-bit Transformer Language Modelscited by 176
  24. 2022On the Effectiveness of Parameter-Efficient Fine-Tuningcited by 140
  25. 2021Distributed Learning in Wireless Networks: Recent Progress and Future Challengescited by 125
  26. 2022Revisiting Parameter-Efficient Tuning: Are We Really There Yet?cited by 76
  27. 2023Parameter-Efficient Fine-Tuning without Introducing New Latencycited by 59
  28. 2018Distributed learning with compressed gradientscited by 53
  29. 2022Structural Pruning via Latency-Saliency Knapsackcited by 40
  30. 2024BitDelta: Your Fine-Tune May Only Be Worth One Bitcited by 38
  31. 2023An Empirical Study of Scaling Instruct-Tuned Large Multimodal Modelscited by 32
  32. 2020On the Overlooked Pitfalls of Weight Decay and How to Mitigate Them: A Gradient-Norm Perspectivecited by 25
  33. 2023Unlocking the Potential of Prompt-Tuning in Bridging Generalized and Personalized Federated Learningcited by 20
  34. 2013Large Deviation Methods for Approximate Probabilistic Inferencecited by 12

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 9; 2026: 1.

10 papers.