mlsanityData to 7 Oct 2026

See Further for Parameter Efficient Fine-tuning by Standing on the Shoulders of Decomposition

arXiv 2407.05417 ↗First posted 7 Jul 2024cs.LG cs.AI cs.CVcited by 13

Not on the map. Why?

Abstract (arXiv)

The rapid expansion of large foundation models within the pre-training and fine-tuning framework has underscored that larger models often yield better results. However, the scaling up of large foundation models has led to soaring costs in fine-tuning and parameter storage, rendering extensive adaptations impractical. This challenge has sparked the development of parameter-efficient fine-tuning (PEFT), which focuses on optimizing a select subset of parameters while keeping the rest fixed, significantly lowering computational and storage overheads. While recent years have witnessed a significant success in PEFT, a deep understanding of the fundamental principles behind these methods remains unexplored. To this end, here we take the first step to unify all approaches by dissecting them from a decomposition perspective. We initiate a comprehensive mathematical analysis of these methods, allowing us to delve deeply into their underlying mechanisms, and we explore the reasons behind the variations in performance among different techniques. Furthermore, inspired by our theoretical analysis, we introduce two novel PEFT methods alongside a simple yet effective framework designed to enhance the performance of PEFT techniques across various applications. Our empirical validations, conducted across multiple datasets, demonstrate the efficacy of these methods, showcasing both theoretical validity and practical performance improvements under the guidance of our analytical findings. We believe our work will deepen researchers' understanding of PEFT and other techniques, prompting further contemplation and advancing the research across the whole community.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 64 of its 79 references that are in the map. First posted on arXiv 7 Jul 2024.

Builds on

64 of 79 references.

References · 64

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  3. 2020Language Models are Few-Shot Learnerscited by 32,199
  4. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  5. 2023GPT-4 Technical Reportcited by 18,132
  6. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  7. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  8. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  9. 2023Segment Anythingcited by 8,158
  10. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  11. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  12. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
38 more
  1. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  2. 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,222
  3. 2020Making Pre-trained Language Models Better Few-shot Learnerscited by 1,255
  4. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,234
  5. 2021DeBERTaV3: Improving DeBERTa using ELECTRA-Style Pre-Training with Gradient-Disentangled Embedding Sharingcited by 1,219
  6. 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 886
  7. 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 863
  8. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 780
  9. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 740
  10. 2022AdaptFormer: Adapting Vision Transformers for Scalable Visual Recognitioncited by 714
  11. 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 658
  12. 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 641
  13. 2020Pre-trained Models for Natural Language Processing: A Surveycited by 504
  14. 2021Compacter: Efficient Low-Rank Hypercomplex Adapter Layerscited by 458
  15. 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 364
  16. 2020Parameter-Efficient Transfer Learning with Diff Pruningcited by 351
  17. 2023SVDiff: Compact Parameter Space for Diffusion Fine-Tuningcited by 338
  18. 2023VeRA: Vector-based Random Matrix Adaptationcited by 294
  19. 2021Parameter-efficient Multi-task Fine-tuning for Transformers via Shared Hypernetworkscited by 278
  20. 2023Customized Segment Anything Model for Medical Image Segmentationcited by 277
  21. 2024PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Modelscited by 261
  22. 2020AdapterDrop: On the Efficiency of Adapters in Transformerscited by 223
  23. 2021Training Neural Networks with Fixed Sparse Maskscited by 212
  24. 2023Controlling Text-to-Image Diffusion by Orthogonal Finetuningcited by 207
  25. 2021FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learningcited by 140
  26. 2022On the Effectiveness of Parameter-Efficient Fine-Tuningcited by 140
  27. 2024LoRA-GA: Low-Rank Adaptation with Gradient Approximationcited by 134
  28. 2023Navigating Text-To-Image Customization: From LyCORIS Fine-Tuning to Model Evaluationcited by 108
  29. 2024Flora: Low-Rank Adapters Are Secretly Gradient Compressorscited by 103
  30. 2021Cross-Attention is All You Need: Adapting Pretrained Transformers for Machine Translationcited by 74
  31. 2023Sensitivity-Aware Visual Parameter-Efficient Fine-Tuningcited by 74
  32. 2023Towards Efficient Visual Adaption via Structural Re-parameterizationcited by 73
  33. 2023GPTEval: A Survey on Assessments of ChatGPT and GPT-4cited by 73
  34. 2023Tied-Lora: Enhancing parameter efficiency of LoRA with weight tyingcited by 65
  35. 2021Model Complexity of Deep Learning: A Surveycited by 64
  36. 2023Residual Prompt Tuning: Improving Prompt Tuning with Residual Reparameterizationcited by 64
  37. 2023A Comprehensive Survey on Segment Anything Model for Vision and Beyondcited by 64
  38. 2023Parameter-Efficient Fine-Tuning without Introducing New Latencycited by 59

50 most cited of 64 All 64 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 4; 2025: 6; 2026: 3.

13 papers.

Sort:

By area: