Pith. sign in

REVIEW 3 cited by

PEFT A2Z: Parameter-Efficient Fine-Tuning Survey for Large Language and Vision Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.14117 v1 pith:XCW5ZSSA submitted 2025-04-19 cs.CL cs.CV

PEFT A2Z: Parameter-Efficient Fine-Tuning Survey for Large Language and Vision Models

classification cs.CL cs.CV
keywords modelspeftlanguagelargefine-tuningvisionchallengeslearning
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Large models such as Large Language Models (LLMs) and Vision Language Models (VLMs) have transformed artificial intelligence, powering applications in natural language processing, computer vision, and multimodal learning. However, fully fine-tuning these models remains expensive, requiring extensive computational resources, memory, and task-specific data. Parameter-Efficient Fine-Tuning (PEFT) has emerged as a promising solution that allows adapting large models to downstream tasks by updating only a small portion of parameters. This survey presents a comprehensive overview of PEFT techniques, focusing on their motivations, design principles, and effectiveness. We begin by analyzing the resource and accessibility challenges posed by traditional fine-tuning and highlight key issues, such as overfitting, catastrophic forgetting, and parameter inefficiency. We then introduce a structured taxonomy of PEFT methods -- grouped into additive, selective, reparameterized, hybrid, and unified frameworks -- and systematically compare their mechanisms and trade-offs. Beyond taxonomy, we explore the impact of PEFT across diverse domains, including language, vision, and generative modeling, showing how these techniques offer strong performance with lower resource costs. We also discuss important open challenges in scalability, interpretability, and robustness, and suggest future directions such as federated learning, domain adaptation, and theoretical grounding. Our goal is to provide a unified understanding of PEFT and its growing role in enabling practical, efficient, and sustainable use of large models.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. LoCA: Spatially-Aware Low-Rank Convolutional Adaptation of Vision Foundation Models

    cs.CV 2026-07 accept novelty 6.0

    Decoupling spatial basis refinement from low-rank channel mixing in convolutional layers yields better parameter-efficient fine-tuning for vision foundation models.

  2. ASA: Backbone-Training-Free Representation Engineering for Tool-Calling Agents

    cs.SE 2026-02 conditional novelty 6.0

    A probe-gated, router-conditioned activation hook raises strict tool-call F1 from 0.18 to 0.50 on Qwen2.5-1.5B while cutting false-positive triggers from 0.15 to 0.05.

  3. PEFT-Bench: A Parameter-Efficient Fine-Tuning Methods Benchmark

    cs.CL 2025-11 unverdicted novelty 6.0

    PEFT-Bench is a standardized end-to-end benchmark for 7 PEFT methods across 27 NLP datasets on autoregressive LLMs, accompanied by the PSCP metric that penalizes based on trainable parameters, inference speed, and tra...