IRCoCo: Immediate Rewards-Guided Deep Reinforcement Learning for Code Completion
Not on the map. Why?
Abstract (arXiv)
Code completion aims to enhance programming productivity by predicting potential code based on the current programming context. Recently, pretrained language models (LMs) have become prominent in this field. Various approaches have been proposed to fine-tune LMs using supervised fine-tuning (SFT) techniques for code completion. However, the inherent exposure bias of these models can cause errors to accumulate early in the sequence completion, leading to even more errors in subsequent completions. To address this problem, deep reinforcement learning (DRL) is an alternative technique for fine-tuning LMs for code completion, which can improve the generalization capabilities and overall performance. Nevertheless, integrating DRL-based strategies into code completion faces two major challenges: 1) The dynamic nature of the code context requires the completion model to quickly adapt to changes, which poses difficulties for conventional DRL strategies that focus on delayed rewarding of the final code state. 2) It is difficult to evaluate the correctness of partial code, thus the reward redistribution-based strategies cannot be adapted to code completion. To tackle these challenges, we propose IRCoCo, a code completion-specific DRL-based fine-tuning framework. This framework is designed to provide immediate rewards as feedback for detecting dynamic context changes arising from continuous edits during code completion. With the aid of immediate feedback, the fine-tuned LM can gain a more precise understanding of the current context, thereby enabling effective adjustment of the LM and optimizing code completion in a more refined manner. Experimental results demonstrate that fine-tuning pretrained LMs with IRCoCo leads to significant improvements in the code completion task, outperforming both SFT-based and other DRL-based baselines.
Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Jan 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 4; 2025: 5; 2026: 4.
13 papers.
Sort:
By area:
- 2025What to Retrieve for Effective Retrieval-Augmented Code Generation? An Empirical Study and Beyondcited by 22
- 2024CodeIP: A Grammar-Guided Multi-Bit Watermark for Large Language Models of Codecited by 21
- 2024Enhancing Code Generation Performance of Smaller Models by Distilling the Reasoning Ability of LLMscited by 17
- 2024Large Language Model for Verilog Generation with Code-Structure-Guided Reinforcement Learningcited by 15
- 2025Insights from Verification: Training a Verilog Generation LLM with Reinforcement Learning with Testbench Feedbackcited by 14
- 2024Does Your Neural Code Completion Model Use My Code? A Membership Inference Approachcited by 9
- 2025CODESYNC: Synchronizing Large Language Models with Dynamic Code Evolution at Scalecited by 8
- 2025Smart-LLaMA-DPO: Reinforced Large Language Model for Explainable Smart Contract Vulnerability Detectioncited by 7
- 2025Mitigating Sensitive Information Leakage in LLMs4Code through Machine Unlearningcited by 1
- 2026StepCodeReasoner: Aligning Code Reasoning with Stepwise Execution Traces via Reinforcement Learningcited by 1
- 2026Towards Order Fairness: Mitigating LLMs Order Sensitivity through Dual Group Advantage Optimizationcited by 1
- 2026Router-Suggest: Dynamic Routing for Multimodal Auto-Completion in Visually-Grounded Dialogscited by 0
- 2026Towards Order Fairness: Mitigating LLMs Order Sensitivity through Dual Group Advantage Optimization12 May 2026
- 2026StepCodeReasoner: Aligning Code Reasoning with Stepwise Execution Traces via Reinforcement Learning12 May 2026
- 2026PYTHALAB-MERA: Validation-Grounded Memory, Retrieval, and Acceptance Control for Frozen-LLM Coding Agents8 May 2026
- 2026Router-Suggest: Dynamic Routing for Multimodal Auto-Completion in Visually-Grounded Dialogs9 Jan 2026
- 2025Smart-LLaMA-DPO: Reinforced Large Language Model for Explainable Smart Contract Vulnerability Detection23 Jun 2025
- 2025Insights from Verification: Training a Verilog Generation LLM with Reinforcement Learning with Testbench Feedback22 Apr 2025
- 2025What to Retrieve for Effective Retrieval-Augmented Code Generation? An Empirical Study and Beyond26 Mar 2025
- 2025CODESYNC: Synchronizing Large Language Models with Dynamic Code Evolution at Scale23 Feb 2025
- 2025Mitigating Sensitive Information Leakage in LLMs4Code through Machine Unlearning9 Feb 2025
- 2024Large Language Model for Verilog Generation with Code-Structure-Guided Reinforcement Learning21 Jul 2024
- 2024CodeIP: A Grammar-Guided Multi-Bit Watermark for Large Language Models of Code24 Apr 2024
- 2024Does Your Neural Code Completion Model Use My Code? A Membership Inference Approach22 Apr 2024
- 2025Insights from Verification: Training a Verilog Generation LLM with Reinforcement Learning with Testbench Feedbackcited by 14
- 2025CODESYNC: Synchronizing Large Language Models with Dynamic Code Evolution at Scalecited by 8
- 2025Smart-LLaMA-DPO: Reinforced Large Language Model for Explainable Smart Contract Vulnerability Detectioncited by 7
- 2026StepCodeReasoner: Aligning Code Reasoning with Stepwise Execution Traces via Reinforcement Learningcited by 1
- 2026StepCodeReasoner: Aligning Code Reasoning with Stepwise Execution Traces via Reinforcement Learning12 May 2026
- 2025Smart-LLaMA-DPO: Reinforced Large Language Model for Explainable Smart Contract Vulnerability Detection23 Jun 2025
- 2025Insights from Verification: Training a Verilog Generation LLM with Reinforcement Learning with Testbench Feedback22 Apr 2025
- 2025CODESYNC: Synchronizing Large Language Models with Dynamic Code Evolution at Scale23 Feb 2025
- 2024Large Language Model for Verilog Generation with Code-Structure-Guided Reinforcement Learningcited by 15
- 2026Towards Order Fairness: Mitigating LLMs Order Sensitivity through Dual Group Advantage Optimizationcited by 1
- 2026Router-Suggest: Dynamic Routing for Multimodal Auto-Completion in Visually-Grounded Dialogscited by 0
- 2026Towards Order Fairness: Mitigating LLMs Order Sensitivity through Dual Group Advantage Optimization12 May 2026
- 2026Router-Suggest: Dynamic Routing for Multimodal Auto-Completion in Visually-Grounded Dialogs9 Jan 2026
- 2024Large Language Model for Verilog Generation with Code-Structure-Guided Reinforcement Learning21 Jul 2024