Adapt Once, Thrive with Updates: Transferable Parameter-Efficient Fine-Tuning on Evolving Base Models
Not on the map. Why?
Abstract (arXiv)
Parameter-efficient fine-tuning (PEFT) has become a common method for fine-tuning large language models, where a base model can serve multiple users through PEFT module switching. To enhance user experience, base models require periodic updates. However, once updated, PEFT modules fine-tuned on previous versions often suffer substantial performance degradation on newer versions. Re-tuning these numerous modules to restore performance would incur significant computational costs. Through a comprehensive analysis of the changes that occur during base model updates, we uncover an interesting phenomenon: continual training primarily affects task-specific knowledge stored in Feed-Forward Networks (FFN), while having less impact on the task-specific pattern in the Attention mechanism. Based on these findings, we introduce Trans-PEFT, a novel approach that enhances the PEFT module by focusing on the task-specific pattern while reducing its dependence on certain knowledge in the base model. Further theoretical analysis supports our approach. Extensive experiments across 7 base models and 12 datasets demonstrate that Trans-PEFT trained modules can maintain performance on updated base models without re-tuning, significantly reducing maintenance overhead in real-world applications.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 38 of its 48 references that are in the map. First posted on arXiv 7 Jun 2025.
Builds on
38 of 48 references.
References · 38
- 2017Attention Is All You Needcited by 60,361
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2024Qwen2.5 Technical Reportcited by 4,942
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
- 2021Program Synthesis with Large Language Modelscited by 3,637
26 more
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generationcited by 1,391
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
- 2024DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligencecited by 1,181
- 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 872
- 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
- 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 671
- 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 656
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 439
- 2024OpenCodeInterpreter: Integrating Code Generation with Execution and Refinementcited by 247
- 2020Self-Attention Attribution: Interpreting Information Interactions Inside Transformercited by 125
- 2023Offsite-Tuning: Transfer Learning without Full Modelcited by 78
- 2023Chat Vector: A Simple Approach to Equip LLMs with Instruction Following and Model Alignment in New Languagescited by 54
- 2025Training Plug-n-Play Knowledge Modules with Deep Context Distillationcited by 24
- 2023Recyclable Tuning for Continual Pre-trainingcited by 17
- 2024Light-PEFT: Lightening Parameter-Efficient Fine-Tuning via Early Pruningcited by 15
- 2024textitTrans-LoRA: towards data-free Transferable Parameter Efficient Finetuningcited by 13
- 2022Reducing Retraining by Recycling Parameter-Efficient Promptscited by 11
- 2024RE-Adapt: Reverse Engineered Adaptation of Large Language Modelscited by 9
- 2024ConTrans: Weak-to-Strong Alignment Engineering via Concept Transplantationcited by 8
- 2023Zero-Shot Continuous Prompt Transfer: Generalizing Task Semantics Across Language Modelscited by 7
- 2024PortLLM: Personalizing Evolving Large Language Models with Training-Free and Portable Model Patchescited by 7
- 2025Train Small, Infer Large: Memory-Efficient LoRA Training for Large Language Modelscited by 5
- 2025BeamLoRA: Beam-Constraint Low-Rank Adaptationcited by 3
Built on by
Citing papers per year: 2025: 3; 2026: 2.
5 papers.
- 2025VecInfer: Efficient LLM Inference with Low-Bit KV Cache via Outlier-Suppressed Vector Quantizationcited by 4
- 2025Weights-Rotated Preference Optimization for Large Language Modelscited by 3
- 2025CBP-Tuning: Efficient Local Customization for Black-box Large Language Modelscited by 1
- 2026RPMem: Learning Long-Term Recurrent Parametric Memory Across Sessions for LLM Agentscited by 1
- 2026UpgradeBench: A Decision-Centric Benchmark for Upgrading Fine-Tuned LLM Specialistscited by 0
- 2026RPMem: Learning Long-Term Recurrent Parametric Memory Across Sessions for LLM Agents20 Sep 2026
- 2026UpgradeBench: A Decision-Centric Benchmark for Upgrading Fine-Tuned LLM Specialists21 Aug 2026
- 2025VecInfer: Efficient LLM Inference with Low-Bit KV Cache via Outlier-Suppressed Vector Quantization7 Oct 2025
- 2025CBP-Tuning: Efficient Local Customization for Black-box Large Language Models15 Sep 2025
- 2025Weights-Rotated Preference Optimization for Large Language Models25 Aug 2025