Delving into Parameter-Efficient Fine-Tuning in Code Change Learning: An Empirical Study
Not on the map. Why?
Abstract (arXiv)
Compared to Full-Model Fine-Tuning (FMFT), Parameter Efficient Fine-Tuning (PEFT) has demonstrated superior performance and lower computational overhead in several code understanding tasks, such as code summarization and code search. This advantage can be attributed to PEFT's ability to alleviate the catastrophic forgetting issue of Pre-trained Language Models (PLMs) by updating only a small number of parameters. As a result, PEFT effectively harnesses the pre-trained general-purpose knowledge for downstream tasks. However, existing studies primarily involve static code comprehension, aligning with the pre-training paradigm of recent PLMs and facilitating knowledge transfer, but they do not account for dynamic code changes. Thus, it remains unclear whether PEFT outperforms FMFT in task-specific adaptation for code-change-related tasks. To address this question, we examine two prevalent PEFT methods, namely Adapter Tuning (AT) and Low-Rank Adaptation (LoRA), and compare their performance with FMFT on five popular PLMs. Specifically, we evaluate their performance on two widely-studied code-change-related tasks: Just-In-Time Defect Prediction (JIT-DP) and Commit Message Generation (CMG). The results demonstrate that both AT and LoRA achieve state-of-the-art (SOTA) results in JIT-DP and exhibit comparable performances in CMG when compared to FMFT and other SOTA approaches. Furthermore, AT and LoRA exhibit superiority in cross-lingual and low-resource scenarios. We also conduct three probing tasks to explain the efficacy of PEFT techniques on JIT-DP and CMG tasks from both static and dynamic perspectives. The study indicates that PEFT, particularly through the use of AT and LoRA, offers promising advantages in code-change-related tasks, surpassing FMFT in certain aspects.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Feb 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 6; 2025: 2.
8 papers.
- 2024A Survey on LoRA of Large Language Modelscited by 67
- 2024Router-Tuning: A Simple and Effective Approach for Enabling Dynamic-Depth in Transformerscited by 8
- 2024OccamLLM: Fast and Exact Language Model Arithmetic in a Single Stepcited by 7
- 2024Exploring Data-Efficient Adaptation of Large Language Models for Code Generationcited by 3
- 2024Just-In-Time Software Defect Prediction via Bi-modal Change Representation Learningcited by 1
- 2025MSPLoRA: A Multi-Scale Pyramid Low-Rank Adaptation for Efficient Model Fine-Tuningcited by 1
- 2024MergeRepair: An Exploratory Study on Merging Task-Specific Adapters in Code LLMs for Automated Program Repaircited by 0
- 2025CodeFlowLM: Incremental Just-In-Time Defect Prediction with Pretrained Language Models and Exploratory Insights into Defect Localizationcited by 0
- 2025CodeFlowLM: Incremental Just-In-Time Defect Prediction with Pretrained Language Models and Exploratory Insights into Defect Localization28 Nov 2025
- 2025MSPLoRA: A Multi-Scale Pyramid Low-Rank Adaptation for Efficient Model Fine-Tuning27 Mar 2025
- 2024Router-Tuning: A Simple and Effective Approach for Enabling Dynamic-Depth in Transformers17 Oct 2024
- 2024Just-In-Time Software Defect Prediction via Bi-modal Change Representation Learning15 Oct 2024
- 2024MergeRepair: An Exploratory Study on Merging Task-Specific Adapters in Code LLMs for Automated Program Repair18 Aug 2024
- 2024A Survey on LoRA of Large Language Models8 Jul 2024
- 2024OccamLLM: Fast and Exact Language Model Arithmetic in a Single Step4 Jun 2024
- 2024Exploring Data-Efficient Adaptation of Large Language Models for Code Generation29 Feb 2024