Preprint
Machine Learning

Parameter-efficient fine-tuning for foundation models

Dan Zhang, Tao Feng, Lilong Xue, Yuandong Wang, Yuxiao Dong, Jie Tang
January 1, 2025arXiv.org64 citations

64

Citations

4

Influential Citations

arXiv.org

Venue

2025

Year

Abstract

This survey delves into the realm of Parameter-Efficient Fine-Tuning (PEFT) within the context of Foundation Models (FMs). PEFT, a cost-effective fine-tuning technique, minimizes …

Analysis

Why This Paper Matters

This survey arrives at a critical juncture in the evolution of foundation models, where the sheer scale of models like GPT-4 and LLaMA makes full fine-tuning prohibitively expensive for most organizations. Parameter-Efficient Fine-Tuning (PEFT) has emerged as a practical solution, enabling adaptation of these massive models with minimal computational resources. By providing a systematic taxonomy and analysis, this paper helps demystify the landscape of PEFT methods, which is essential for both researchers seeking to advance the field and practitioners aiming to deploy customized models efficiently.

The paper's significance is amplified by the growing trend of foundation models being used as general-purpose backbones across diverse domains. The ability to fine-tune these models for specific tasks without catastrophic forgetting or excessive cost is a key enabler for real-world applications. This survey not only consolidates existing knowledge but also highlights open challenges, such as the need for theoretical understanding and the development of PEFT methods that are robust across different model architectures and modalities.

Technical Contributions

The survey makes several key technical contributions:

  • Comprehensive Taxonomy: It categorizes PEFT methods into three main families: additive (e.g., adapters, soft prompts), selective (e.g., bitfit, diff-pruning), and reparameterization-based (e.g., LoRA, prefix tuning). This classification helps clarify the design space.
  • Unified Framework: The authors propose a unified mathematical framework that expresses many PEFT methods as modifications to the weight update process, enabling direct comparison and highlighting their relationships.
  • Analysis of Trade-offs: The paper systematically analyzes the trade-offs between parameter efficiency, computational overhead, and performance, providing practical guidance for method selection.
  • Future Directions: It identifies open problems, such as the lack of theoretical foundations, the need for PEFT methods that work across modalities, and the challenge of combining PEFT with other efficiency techniques like quantization and pruning.

Results

While the survey does not present new experimental results, it synthesizes findings from the literature. Key takeaways include:

  • PEFT methods like LoRA and adapters can achieve performance within 1-2% of full fine-tuning on many NLP benchmarks while reducing trainable parameters by over 99%.
  • The choice of PEFT method often depends on the task and model size; for instance, prompt-based methods are effective for large language models, while adapters are more versatile.
  • The survey reports that PEFT methods also offer benefits in terms of reduced memory usage and faster training, making them suitable for resource-constrained environments.

Significance

The broader impact of this survey is substantial. It provides a clear roadmap for practitioners, enabling them to adopt PEFT methods with confidence, thereby democratizing access to foundation model customization. For researchers, it highlights gaps in current knowledge, such as the need for a deeper theoretical understanding of why PEFT works and how to design methods that are universally applicable. As foundation models continue to grow in size and capability, PEFT will likely become the standard approach for adaptation, and this survey will serve as a cornerstone reference for years to come.