Pith. sign in

REVIEW 21 cited by

Scaling Down to Scale Up: A Guide to Parameter-Efficient Fine-Tuning

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 2303.15647 v2 pith:6K5T6HIQ submitted 2023-03-28 cs.CL

Scaling Down to Scale Up: A Guide to Parameter-Efficient Fine-Tuning

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

This paper presents a systematic overview of parameter-efficient fine-tuning methods, covering over 50 papers published between early 2019 and mid-2024. These methods aim to address the challenges of fine-tuning large language models by training only a small subset of parameters. We provide a taxonomy that covers a broad range of methods and present a detailed method comparison with a specific focus on real-life efficiency in fine-tuning multibillion-scale language models. We also conduct an extensive head-to-head experimental comparison of 15 diverse PEFT methods, evaluating their performance and efficiency on models up to 11B parameters. Our findings reveal that methods previously shown to surpass a strong LoRA baseline face difficulties in resource-constrained settings, where hyperparameter optimization is limited and the network is fine-tuned only for a few epochs. Finally, we provide a set of practical recommendations for using PEFT methods and outline potential future research directions.

discussion (0)

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

Forward citations

Cited by 21 Pith papers

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

  1. Prompt engineering using order-of-addition experiments: An application to generating two-level fractional factorial designs

    stat.AP 2026-07 accept novelty 7.0

    Order-of-addition designs and logistic pairwise-ordering models measure and optimize prompt-element order, lifting LLM success on 16-run fractional factorial design tasks from low teens or mid-thirties to near 100%.

  2. Parameter-Efficient Neuroevolution for Diverse LLM Generation: Quality-Diversity Optimization via Prompt Embedding Evolution

    cs.NE 2026-05 unverdicted novelty 7.0

    QD-LLM evolves prompt embeddings via neuroevolution in a quality-diversity framework, delivering 46% higher coverage and 41% higher QD-score than prior methods on coding and writing benchmarks.

  3. MASCing: Configurable Mixture-of-Experts Behavior via Activation Steering Masks

    cs.CR 2026-04 unverdicted novelty 7.0

    MASCing uses an LSTM surrogate and optimized steering masks to enable flexible, inference-time control over MoE expert routing for safety objectives, improving jailbreak defense and content generation success rates su...

  4. CLIPoint3D: Language-Grounded Few-Shot Unsupervised 3D Point Cloud Domain Adaptation

    cs.CV 2026-02 unverdicted novelty 7.0

    CLIPoint3D is the first CLIP-based framework for few-shot unsupervised 3D point cloud domain adaptation that reports 3-16% accuracy gains on PointDA-10 and GraspNetPC-10.

  5. Combining pre-trained models via localized model averaging

    stat.ME 2026-05 unverdicted novelty 6.0

    Localized model averaging with covariate-dependent weights achieves asymptotic optimality and weight consistency for combining pre-trained models under a general loss framework.

  6. Parameter-Efficient Neuroevolution for Diverse LLM Generation: Quality-Diversity Optimization via Prompt Embedding Evolution

    cs.NE 2026-05 unverdicted novelty 6.0

    QD-LLM applies neuroevolution to prompt embeddings within a quality-diversity framework, producing 46% higher coverage and 41% higher QD-score than QDAIF on HumanEval, MBPP, and creative writing benchmarks.

  7. Structural Correspondence and Universal Approximation in Diagonal plus Low-Rank Neural Networks

    cs.LG 2026-05 unverdicted novelty 6.0

    Diagonal plus Low-Rank (DLoR) neural networks achieve universal approximation for general activations by additive or multiplicative decompositions of full-rank transformations.

  8. Are Large Language Models Economically Viable for Industry Deployment?

    cs.CL 2026-04 unverdicted novelty 6.0

    Small LLMs under 2B parameters achieve better economic break-even, energy efficiency, and hardware density than larger models on legacy GPUs for industrial tasks.

  9. One Prompt, Many Sounds: Modeling Listener Variability in LLM-Based Equalization

    cs.SD 2026-01 conditional novelty 6.0

    LLM-based equalizers can match the spread of 11 human listeners' EQ choices for text prompts better than random sampling, but are not yet perceptually validated.

  10. One Prompt, Many Sounds: Modeling Listener Variability in LLM-Based Equalization

    cs.SD 2026-01 unverdicted novelty 6.0

    LLMs using in-context learning and fine-tuning on listener experiment data generate equalization settings that align better with population preferences than random sampling or static presets.

  11. 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...

  12. Efficiency vs. Alignment: Investigating Safety and Fairness Risks in Parameter-Efficient Fine-Tuning of LLMs

    cs.AI 2025-11 conditional novelty 6.0

    Benign PEFT fine-tuning changes LLM safety and fairness: adapter-based methods (LoRA, IA3) preserve alignment better than prompt-based methods, and the base model strongly moderates outcomes.

  13. Adapting Automotive Aerodynamics Surrogates to New Vehicle Families via Transfer Learning

    cs.CE 2026-05 unverdicted novelty 5.0

    LoRA adapters enable a 61.47M-parameter aerodynamics Transformer pretrained on four vehicle families to adapt to a held-out fifth family with 20 samples, reaching R²=0.85 and outperforming full fine-tuning and from-sc...

  14. ReLoRA: Knowledge-Reusing Adaptation for Fast Rollout of Evolving LLM Services

    cs.LG 2026-05 unverdicted novelty 5.0

    ReLoRA reduces time-to-readiness for LoRA adapters on updated LLMs by up to 8.9x through adaptive Bayesian initialization and scheduled regularization while improving accuracy by up to 4.6%.

  15. PEFT-Factory: Unified Parameter-Efficient Fine-Tuning of Autoregressive Large Language Models

    cs.CL 2025-12 unverdicted novelty 5.0

    PEFT-Factory supplies a ready-to-use, extensible codebase that unifies 19 PEFT methods and evaluation pipelines for fine-tuning large autoregressive language models.

  16. On-Device Fine-Tuning via Backprop-Free Zeroth-Order Optimization

    cs.LG 2025-11 unverdicted novelty 5.0

    MeZO enables larger models for on-device fine-tuning by estimating gradients via forward passes only, with theoretical size estimates and numerical results showing accuracy benefits when wall-clock time is sufficient.

  17. CLIP-SVD: Efficient and Interpretable Vision-Language Adaptation via Singular Values

    cs.CV 2025-09 unverdicted novelty 5.0

    CLIP-SVD performs parameter-efficient adaptation of CLIP by fine-tuning singular values from SVD of weight matrices, reporting SOTA few-shot accuracy on 21 datasets plus a language-based interpretability analysis.

  18. Fine-Tuning Causal LLMs for Text Classification: Embedding-Based vs. Instruction-Based Approaches

    cs.CL 2025-12 unverdicted novelty 4.0

    Embedding-based fine-tuning of causal LLMs matches or exceeds instruction-tuning on single-label text classification while training 10-30 times fewer parameters and remains competitive with BERT models.

  19. Fine-Tuning Causal LLMs for Text Classification: Embedding-Based vs. Instruction-Based Approaches

    cs.CL 2025-12 conditional novelty 4.0

    Embedding-based QLoRA fine-tuning of causal LLMs matches BERT on single-label patent classification with 10–30x fewer trainable parameters, while instruction-tuning wins on multi-label classification only with ≥100M t...

  20. A Survey on Large Language Models for Code Generation

    cs.CL 2024-06 unverdicted novelty 3.0

    A systematic literature review that organizes recent work on LLMs for code generation into a taxonomy covering data curation, model advances, evaluations, ethics, environmental impact, and applications, with benchmark...

  21. Entry-level guide to the use of large language models for medical research

    cs.AI 2024-10 unverdicted novelty 2.0

    A tutorial guide outlining phases for integrating LLMs into medical research, including task formulation, model choice, prompt engineering, fine-tuning, and deployment with ethical considerations.