Parameter-efficient Tuning for Large Language Model without Calculating Its Gradients
Feihu Jin, Jiajun Zhang, Chengqing Zong
Abstract
Fine-tuning all parameters of large language models (LLMs) requires significant computational resources and is time-consuming. Recent parameter-efficient tuning methods such as Adapter tuning, Prefix tuning, and LoRA allow for updating a small subset of parameters in large language models. However, they can only save approximately 30% of the training memory requirements, due to the problem that gradient computation and backpropagation are still necessary for these methods. This paper proposes a novel parameter-efficient tuning method for LLMs without calculating their gradients. Leveraging the discernible similarities between the parameter-efficient modules of the same task learned by both large and small language models, we put forward a strategy for transferring the parameter-efficient modules, originally derived from small language models to much larger ones. To ensure a smooth and effective adaptation process, we further introduce a Bridge model to guarantee dimensional consistency while also stimulating a dynamic interaction between the models. We demonstrate the effectiveness of our method using the T5 and GPT-2 series of language models on the SuperGLUE benchmark. Our method achieves comparable performance to both fine-tuning and parameter-efficient tuning on large language models without needing gradient-based optimization. Additionally, our method achieves up to 5.7x memory reduction compared to parameter-efficient tuning.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 71eddd7f-085f-4cc0-8e3e-663193d56896Cited by top-tier papers5
- On Giant's Shoulders: Effortless Weak to Strong by Dynamic Logits FusionChenghao Fan, Zhenyi Lu, Wei Wei, Jie Tian et al.NeurIPS 2024 · 17 citations
- RAT: Adversarial Attacks on Deep Reinforcement Agents for Targeted BehaviorsFengshuo Bai, Runze Liu, Yali Du, Ying Wen et al.AAAI 2025 · 15 citations
- Memory-Efficient Fine-Tuning of Transformers via Token SelectionAntoine Simoulin, Namyong Park, Xiaoyi Liu, Grey YangEMNLP 2024 · 1 citation
- MEPT: Mixture of Expert Prompt Tuning as a Manifold MapperRunjia Zeng, Guangyan Sun, Qifan Wang, Tong Geng et al.EMNLP 2025
- Adapt Once, Thrive with Updates: Transferable Parameter-Efficient Fine-Tuning on Evolving Base ModelsNaibin Gu, Peng Fu, Xiyu Liu, Ke Ma et al.ACL 2025
Builds on5
- Language Models are Few-Shot LearnersTom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah et al.NeurIPS 2020 · 64,255 citations
- LoRA: Low-Rank Adaptation of Large Language ModelsEdward J. Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu et al.ICLR 2022 · 18,833 citations
- LST: Ladder Side-Tuning for Parameter and Memory Efficient Transfer LearningYi-Lin Sung, Jaemin Cho, Mohit BansalNeurIPS 2022 · 347 citations
- Crosslingual Generalization through Multitask FinetuningNiklas Muennighoff, Thomas Wang, Lintang Sutawika, Adam Roberts et al.ACL 2023 · 319 citations
- Prefix-Tuning: Optimizing Continuous Prompts for GenerationXiang Lisa Li, Percy LiangACL 2021
Related papers
- Trans-LoRA: towards data-free Transferable Parameter Efficient FinetuningRunqian Wang, Soumya Ghosh, David D. Cox, Diego Antognini et al.NeurIPS 2024 · 15 citations
- PrefixMemory-Tuning: Modernizing Prefix-Tuning by Decoupling the Prefix from AttentionHaonan Wang, Brian K Chen, Siquan Li, Liang Xinhe et al.ICLR 2026 · 5 citations
- LoRA-GA: Low-Rank Adaptation with Gradient ApproximationShaowen Wang, Linxi Yu, Jian LiNeurIPS 2024 · 194 citations
- HiRA: Parameter-Efficient Hadamard High-Rank Adaptation for Large Language ModelsQiushi Huang, Tom Ko, Zhan Zhuang, Lilian Tang et al.ICLR 2025
- Uni-LoRA: One Vector is All You NeedKaiyang Li, Shaobo Han, Qing Su, Wei Li et al.NeurIPS 2025 · 10 citations
