Bibliographic record
Abstract
The advent of foundation models has revolutionized artificial intelligence, enabling unprecedented performance across natural language processing, computer vision, and multimodal tasks. However, the sheer scale of these models, often encompassing billions or even trillions of parameters, poses significant challenges for adaptation to downstream tasks, including high computational cost, memory constraints, and environmental impact. Parameter-Efficient Fine-Tuning (PEFT) has emerged as a principled solution to this problem, providing mechanisms to adapt large pretrained models by updating only a small subset of parameters while keeping the majority of the model frozen. This survey provides a comprehensive examination of PEFT techniques, categorizing them into adapters, low-rank adaptation methods, prompt-and prefix-based approaches, and hybrid strategies, and highlighting the theoretical foundations that justify their efficiency and effectiveness. We discuss the structural design choices underlying these methods, their empirical performance across a range of tasks and domains, and the trade-offs between parameter efficiency, inference cost, generalization, and robustness. The survey further explores applications of PEFT in natural language understanding, computer vision, multimodal learning, continual adaptation, and personalization, illustrating how modular and low-dimensional updates enable scalable and sustainable AI. Additionally, we address challenges related to evaluation metrics, robustness under distribution shift, fairness, interpretability, and deployment constraints, emphasizing the need for standardized benchmarks and multi-objective assessments. Interdisciplinary opportunities, including the integration of PEFT with reinforcement learning, federated learning, and neuroscience-inspired mechanisms, are examined as promising directions for future research. Finally, we discuss the broader societal and environmental implications of PEFT, highlighting its potential to democratize access to large models, reduce energy consumption, and promote ethical, equitable, and sustainable AI practices. By synthesizing current knowledge, identifying open challenges, and proposing avenues for innovation, this survey aims to provide researchers and practitioners with a definitive reference for understanding, implementing, and advancing parameter-efficient adaptation of foundation models. The findings suggest that PEFT not only addresses pressing efficiency constraints but also serves as a central paradigm for responsible, scalable, and adaptable artificial intelligence in the era of ever-growing foundation models.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.010 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".