Papers › No More Fine-Tuning? An Experimental Evaluation of Prompt Tuning in Code Intelligence

No More Fine-Tuning? An Experimental Evaluation of Prompt Tuning in Code Intelligence

24 Jul 2022arXiv:2207.11680archive 2025-07-28

Chaozheng Wang, Yuanhang Yang, Cuiyun Gao, Yun Peng, Hongyu Zhang, Michael R. Lyu

Pre-trained models have been shown effective in many code intelligence tasks. These models are pre-trained on large-scale unlabeled corpus and then fine-tuned in downstream tasks. However, as the inputs to pre-training and downstream tasks are in different forms, it is hard to fully explore the knowledge of pre-trained models. Besides, the performance of fine-tuning strongly relies on the amount of downstream data, while in practice, the scenarios with scarce data are common. Recent studies in the natural language processing (NLP) field show that prompt tuning, a new paradigm for tuning, alleviates the above issues and achieves promising results in various NLP tasks. In prompt tuning, the prompts inserted during tuning provide task-specific knowledge, which is especially beneficial for tasks with relatively scarce data. In this paper, we empirically evaluate the usage and effect of prompt tuning in code intelligence tasks. We conduct prompt tuning on popular pre-trained models CodeBERT and CodeT5 and experiment with three code intelligence tasks including defect prediction, code summarization, and code translation. Our experimental results show that prompt tuning consistently outperforms fine-tuning in all three tasks. In addition, prompt tuning shows great potential in low-resource scenarios, e.g., improving the BLEU scores of fine-tuning by more than 26\% on average for code summarization. Our results suggest that instead of fine-tuning, we could adapt prompt tuning for code intelligence tasks to achieve better performance, especially when lacking task-specific data.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2207.11680")

Code

Syntology Ran 5 of 14 code samples harvested from 1 repository linked to this paper; 9 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 4 ran with no contract checked.

By repository: official repository: 14 samples from 1 repository, 5 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

adf1178/pt4code officialmentioned in paperpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

14 samples harvested; 5 ran; 0 honoured the contract we drafted; 9 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
4ran
9unverified

Licence: 0 of the 14 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from adf1178/pt4code. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

add_lang_by_task adf1178/pt4code/CodeT5-main/_utils.py official repository ran fingerprinted MIT (permissive) · 2e3e72e1e860afb2 · report
convert_clone_examples_to_features adf1178/pt4code/CodeT5-main/_utils.py official repository ran MIT (permissive) · 08ffc47da0ae6767 · report
convert_examples_to_features adf1178/pt4code/CodeT5-main/_utils.py official repository ran MIT (permissive) · 70674cae33ae9c61 · report
count_ngrams adf1178/pt4code/summarization/bleu.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · 835fca2953749b59 · report
get_model_size adf1178/pt4code/CodeT5-main/models.py official repository ran MIT (permissive) · 8cfe38019e9d6a49 · report
add_args adf1178/pt4code/CodeT5-main/configs.py official repository unverified MIT (permissive) · 504a7d87c9b11731 · report
build_or_load_gen_model adf1178/pt4code/CodeT5-main/models.py official repository unverified MIT (permissive) · eb4f6d081f695b86 · report
eval_ppl_epoch adf1178/pt4code/CodeT5-main/run_gen.py official repository unverified MIT (permissive) · 18886d59952fec97 · report
evaluate adf1178/pt4code/CodeT5-main/run_clone.py official repository unverified MIT (permissive) · a8459dd6372165af · report
evaluate adf1178/pt4code/CodeT5-main/run_defect.py official repository unverified MIT (permissive) · 7162c6b07c0d21f6 · report
load_and_cache_clone_data adf1178/pt4code/CodeT5-main/utils.py official repository unverified MIT (permissive) · 4dfcf272e3b5535f · report
load_and_cache_defect_data adf1178/pt4code/CodeT5-main/utils.py official repository unverified MIT (permissive) · db9fdc88ead105ab · report
load_and_cache_gen_data adf1178/pt4code/CodeT5-main/utils.py official repository unverified MIT (permissive) · 08e8e1fc7c5648f7 · report
read_examples adf1178/pt4code/defect/finetune/finetune_t5.py official repository unverified MIT (permissive) · 90c23ee13a3e7488 · report

Tasks

Code SummarizationCode Translation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

AdafactorAttentionAttention DropoutBPECodeBERTDense ConnectionsDropoutGated Linear UnitInverse Square Root ScheduleLayer NormalizationLinear LayerMulti-Head AttentionResidual ConnectionSentencePieceSoftmaxT5

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections