{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T15:57:54Z","timestamp":1785427074378,"version":"3.56.0"},"reference-count":136,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001381","name":"National Research Foundation, Singapore, and DSO National Laboratories through the AI Singapore Programme","doi-asserted-by":"publisher","award":["AISG2-GC-2023-008"],"award-info":[{"award-number":["AISG2-GC-2023-008"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore and the Cyber Security Agency through the National Cybersecurity R&D Programme","doi-asserted-by":"publisher","award":["NCRP25-P04-TAICeN"],"award-info":[{"award-number":["NCRP25-P04-TAICeN"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Research Foundation, Prime Minister’s Office, Singapore through the Campus for Research Excellence and Technological Enterprise (CREATE) Programme"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IIEEE Trans. Software Eng."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1109\/tse.2025.3532759","type":"journal-article","created":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T18:41:47Z","timestamp":1737657707000},"page":"904-928","source":"Crossref","is-referenced-by-count":23,"title":["Comprehensive Fine-Tuning Large Language Models of Code for Automated Program Repair"],"prefix":"10.1109","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-3936-5170","authenticated-orcid":false,"given":"Kai","family":"Huang","sequence":"first","affiliation":[{"name":"Technical University of Munich, Heilbronn, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8316-1894","authenticated-orcid":false,"given":"Jian","family":"Zhang","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7096-2098","authenticated-orcid":false,"given":"Xinlei","family":"Bao","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5057-3278","authenticated-orcid":false,"given":"Xu","family":"Wang","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7300-9215","authenticated-orcid":false,"given":"Yang","family":"Liu","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3318162"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3105906"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2017.2755013"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3631974"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3696450"},{"key":"ref6","article-title":"The living review on automated program repair","author":"Monperrus","year":"2018","journal-title":"HAL Arch. Ouvertes"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3340544"},{"key":"ref8","article-title":"A survey of large language models","author":"Zhao","year":"2023"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2024.3368208"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE48619.2023.00128"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SP46215.2023.10179420"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2023.3308897"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE48619.2023.00125"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3597926.3598135"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ASE56229.2023.00181"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE48619.2023.00129"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3540250.3549101"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ASE56229.2023.00047"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3650212.3680323"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3611643.3616271"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3611643.3616256"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3597503.3608132"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3611643.3613892"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3540250.3549098"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3597503.3639222"},{"key":"ref26","article-title":"RepairLLaMA: Efficient representations and fine-tuned adapters for program repair","author":"Silva","year":"2023"},{"key":"ref27","article-title":"CIGAR: Cost-efficient program repair with LLMS","author":"Hidv\u00e9gi","year":"2024"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3719345"},{"key":"ref29","article-title":"RepairAgent: An autonomous, LLM-based agent for program repair","volume-title":"Proc. 47th Int. Conf. Softw. Eng. (ICSE)","author":"Bouzenia","year":"2024"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ASE56229.2023.00063"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3510003.3510177"},{"key":"ref32","first-page":"780","article-title":"TFIX: Learning to fix coding errors with a text-to-text transformer","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Berabi","year":"2021"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2022.3147265"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/MSR52588.2021.00063"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-021-10003-7"},{"key":"ref36","first-page":"367","article-title":"Template-guided program repair in the era of large language models","volume-title":"Proc. 47th Int. Conf. Softw. Eng. (ICSE)","author":"Huang","year":"2024"},{"key":"ref37","article-title":"Parameter-efficient fine-tuning for large models: A comprehensive survey","author":"Han","year":"2024"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2019.2940179"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3395363.3397369"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE43902.2021.00107"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE48619.2023.00111"},{"key":"ref42","first-page":"602","article-title":"DLFix: Context-based code transformation learning for automated program repair","volume-title":"Proc. 42nd Int. Conf. Softw. Eng. (ICSE)","author":"Li","year":"2020"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3551349.3556926"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3510003.3510222"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3597503.3623337"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3468264.3468544"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE48619.2023.00126"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3510003.3510147"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE48619.2023.00127"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/2610384.2628055"},{"key":"ref51","article-title":"LoRA: Low-rank adaptation of large language models","volume-title":"Proc. Int. Conf. Learn. Representations (ICLR)","author":"Hu","year":"2021"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-short.107"},{"key":"ref53","first-page":"1950","article-title":"Few-shot parameter-efficient fine-tuning is better and cheaper than in-context learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","volume":"35","author":"Liu","year":"2022"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3579640"},{"key":"ref55","article-title":"LLM4APR study","year":"2024"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2022.3156637"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3533767.3534219"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE48619.2023.00180"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3695991"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/DSN-W54100.2022.00027"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-long.69"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/3551349.3560422"},{"key":"ref63","article-title":"CodeBERT-base","year":"2024"},{"key":"ref64","article-title":"CodeSearchNet","year":"2024"},{"key":"ref65","article-title":"StarCoderBase-15b","year":"2024"},{"key":"ref66","article-title":"StarCoder2-15B","year":"2024"},{"key":"ref67","article-title":"GraphCodeBERT-base","year":"2024"},{"key":"ref68","article-title":"CodeLlama-13B","year":"2024"},{"key":"ref69","article-title":"CodeLlama\u201334B","year":"2024"},{"key":"ref70","article-title":"CodeLlama-70B","year":"2024"},{"key":"ref71","article-title":"PLBart-base","year":"2024"},{"key":"ref72","article-title":"CodeGen25-7B","year":"2024"},{"key":"ref73","article-title":"CodeT5-base","year":"2024"},{"key":"ref74","article-title":"CodeGeeX2\u20136B","year":"2024"},{"key":"ref75","article-title":"UniXcoder-base","year":"2024"},{"key":"ref76","article-title":"InCoder-6B","year":"2024"},{"key":"ref77","article-title":"Big code models leaderboard","year":"2024"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1145\/3368089.3417058"},{"key":"ref79","article-title":"CodeXGLUE: A machine learning benchmark dataset for code understanding and generation","volume-title":"Proc. 35th Conf. Neural Inf. Process. Syst. Datasets Benchmarks Track","author":"Lu","year":"2021"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.findings-emnlp.139"},{"key":"ref81","article-title":"GraphCodeBERT: Pre-training code representations with data flow","volume-title":"Proc. Int. Conf. Learn. Representations (ICLR)","author":"Guo","year":"2021"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.naacl-main.211"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.685"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-long.499"},{"key":"ref85","article-title":"Code Llama: Open foundation models for code","author":"Roziere","year":"2023"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1108\/ws.2000.07949fab.004"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599790"},{"key":"ref88","article-title":"CodeGen: An open large language model for code with multi-turn program synthesis","author":"Nijkamp","year":"2022"},{"key":"ref89","article-title":"InCoder: A generative model for code infilling and synthesis","author":"Fried","year":"2022"},{"key":"ref90","article-title":"PEFT: State-of-the-art parameter-efficient fine-tuning methods","author":"Sourab","year":"2024"},{"key":"ref91","article-title":"PEFT","year":"2024"},{"key":"ref92","article-title":"Prompt-based methods","year":"2024"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.243"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.acl-long.353"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2023.08.012"},{"key":"ref96","article-title":"Adapter-based methods","year":"2024"},{"key":"ref97","article-title":"FedPara: Low-rank Hadamard product for communication-efficient federated learning","volume-title":"Proc. Int. Conf. Learn. Representations, ICLR","author":"Hyeon-Woo","year":"2021"},{"key":"ref98","article-title":"Navigating text-to-image customization: From Lycoris fine-tuning to model evaluation","author":"Yeh","year":"2023"},{"key":"ref99","article-title":"IA3","year":"2024"},{"key":"ref100","article-title":"Empirical analysis of the strengths and weaknesses of PEFT techniques for LLMS","volume-title":"Proc. Workshop Math. Empirical Understanding Found. Models","author":"Pu","year":"2023"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1145\/3293882.3330577"},{"key":"ref102","first-page":"10088","article-title":"QLoRA: Efficient finetuning of quantized LLMS","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","volume":"36","author":"Dettmers","year":"2024"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1145\/3379597.3387501"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1145\/3475960.3475985"},{"key":"ref105","article-title":"StarCoder 2 and the Stack v2: The next generation","author":"Lozhkov","year":"2024"},{"key":"ref106","article-title":"The CodRep machine learning on source code competition","author":"Chen","year":"2018"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2021.3070743"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-long.143"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3268118"},{"key":"ref110","article-title":"Flower plot","year":"2024"},{"key":"ref111","article-title":"PEFT: Parameter-efficient fine-tuning of billion-scale models on low-resource hardware","year":"2023"},{"key":"ref112","first-page":"78808","article-title":"MEGABYTE: Predicting million-byte sequences with multiscale transformers","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Yu","year":"2023"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00547"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE48619.2023.00211"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.acl-long.225"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2022.3233901"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1145\/3293882.3330559"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1145\/3510003.3510217"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1145\/3551349.3556943"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1145\/3368089.3417943"},{"key":"ref121","article-title":"How far can we go with practical function-level program repair?","author":"Xiang","year":"2024"},{"key":"ref122","article-title":"A unified debugging approach via LLM-based multi-agent synergy","author":"Lee","year":"2024"},{"key":"ref123","article-title":"Aligning LLMs for FL-free program repair","author":"Xu","year":"2024"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1145\/3660773"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.1145\/3533767.3534390"},{"key":"ref126","article-title":"Parameter-efficient fine-tuning methods for pretrained language models: A critical review and assessment","author":"Xu","year":"2023"},{"key":"ref127","first-page":"2790","article-title":"Parameter-efficient transfer learning for NLP","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Houlsby","year":"2019"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-short.1"},{"key":"ref129","first-page":"24193","article-title":"Training neural networks with fixed sparse masks","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","volume":"34","author":"Sung","year":"2021"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-long.125"},{"key":"ref131","article-title":"Towards a unified view of parameter-efficient transfer learning","volume-title":"Proc. Int. Conf. Learn. Representations (ICLR)","author":"He","year":"2021"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-long.433"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00662"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.1109\/SANER60148.2024.00055"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1109\/ASE56229.2023.00125"},{"key":"ref136","article-title":"A comprehensive evaluation of parameter-efficient fine-tuning on software engineering tasks","author":"Zou","year":"2023"}],"container-title":["IEEE Transactions on Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/32\/10969500\/10850625.pdf?arnumber=10850625","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T17:38:04Z","timestamp":1744997884000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10850625\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":136,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tse.2025.3532759","relation":{},"ISSN":["0098-5589","1939-3520","2326-3881"],"issn-type":[{"value":"0098-5589","type":"print"},{"value":"1939-3520","type":"electronic"},{"value":"2326-3881","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4]]}}}