ExecVerify: White-Box RL with Verifiable Stepwise Rewards for Code Execution Reasoning (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for code execution reasoning are limited by the difficulty of the training data. |
| Approach: | They propose a model that uses reinforcement learning to reward correct answers from execution traces. |
| Outcome: | The proposed model improves pass@1 by up to 5.9% on code generation tasks over strong baselines. |
Similar Papers
CODERL+: Improving Code Generation via Reinforcement with Execution Semantics Alignment (2026.acl-long)
Copied to clipboard
Xue Jiang, Yihong Dong, Mengyang Liu, Deng Hongyi, Tian Wang, Yongding Tao, Zhi Jin, Wenpin Jiao, Ge Li
| Challenge: | Large Language Models excel at code generation by learning from vast code corpora, but a fundamental semantic gap remains between training on textual patterns and the goal of functional correctness . reinforcement learning with verifiable rewards (RLVR) approaches are inefficient for establishing a well-aligned connection between the textual representation of code and its execution semantics. |
| Approach: | They propose a novel approach that integrates execution semantics alignment into the RLVR training pipeline for code generation. |
| Outcome: | The proposed model outperforms baseline training and RLVR and shows strong applicability across RL and LLMs. |
Crossing the Reward Bridge: Expanding Reinforcement Learning with Verifiable Rewards Across Diverse Domains (2026.acl-long)
Copied to clipboard
| Challenge: | Reinforcement learning with verifiable rewards (RLVR) has been effective on structured tasks, but its reliance on simple, rule-based verifiers creates a bottleneck. |
| Approach: | They propose a framework that uses a generative verifier to provide soft, probabilistic rewards. |
| Outcome: | The proposed framework outperforms existing models up to 10x their size and can be scalable and effective. |
StepCoder: Improving Code Generation with Reinforcement Learning from Compiler Feedback (2024.acl-long)
Copied to clipboard
Shihan Dou, Yan Liu, Haoxiang Jia, Enyu Zhou, Limao Xiong, Junjie Shan, Caishuang Huang, Xiao Wang, Xiaoran Fan, Zhiheng Xi, Yuhao Zhou, Tao Ji, Rui Zheng, Qi Zhang, Tao Gui, Xuanjing Huang
| Challenge: | Existing work integrates reinforcement learning with compiler feedback to enhance code generation quality but the long code generated by LLMs makes RL exploration ineffective. |
| Approach: | They propose a framework that integrates reinforcement learning and compiler feedback to enhance code generation quality. |
| Outcome: | The proposed framework outperforms state-of-the-art approaches in corresponding benchmarks and integrates reinforcement learning with compiler feedback to improve code generation quality. |
Beyond Outcome Verification: Verifiable Process Reward Models for Structured Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent work on reinforcement learning with verifiable rewards (RLVR) has shown that large language models can be substantially improved using outcome-level verification signals. |
| Approach: | They propose a framework where intermediate reasoning steps are checked by deterministic, rule-based verifiers. |
| Outcome: | The proposed framework achieves 20% higher F1 than state-of-the-art models and 6.5% higher than verifiable outcome rewards, with substantial gains in evidence grounding and logical coherence. |
Integrating Symbolic Execution into the Fine-Tuning of Code-Generating LLMs (2025.naacl-srw)
Copied to clipboard
| Challenge: | Code-generating Large Language Models (LLMs) have become essential tools in modern software development, enhancing productivity and accelerating development. |
| Approach: | They propose to use Reinforcement Learning and Direct Preference Optimization to fine-tune code-generating Large Language Models (LLMs) by enhancing the training data with symbolic execution techniques. |
| Outcome: | The proposed model improves on the CodeRL benchmark and shows that it is more accurate and objective than the baseline model. |
CodeTool: Enhancing Programmatic Tool Invocation of LLMs via Process Supervision (2025.acl-long)
Copied to clipboard
YifeiLu YifeiLu, Fanghua Ye, Jian Li, Qiang Gao, Cheng Liu, Haibo Luo, Nan Du, Xiaolong Li, Feiliang Ren
| Challenge: | Existing approaches to tool invocation are often unnecessarily long and require lengthy reasoning paths. |
| Approach: | They propose a framework for stepwise code generation that improves LLM tool invocation . they incorporate two distinct process rewards: the On-the-spot and the Latent Reward . |
| Outcome: | The proposed framework improves LLM tool invocation by leveraging the concise nature of code. |
CodePRM: Execution Feedback-enhanced Process Reward Model for Code Generation (2025.findings-acl)
Copied to clipboard
| Challenge: | Recent advances in code generation focus on optimizing the thought process, but lack effective process supervision, making it difficult to optimize the thoughts. |
| Approach: | They propose a method that leverages the code execution feedback to build a code PRM by collecting a large dataset of thought traces and then training it to take both the reasoning process and code execution as input. |
| Outcome: | The proposed approach outperforms baselines and strong LLMs in the inference stage. |
DARL: Encouraging Diverse Answers for General Reasoning without Verifiers (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent efforts such as RLPR have extended RLVR to general domains, enabling training on broader datasets and achieving improvements over RL PR. |
| Approach: | They propose a framework that encourages the generation of diverse answers within a controlled deviation range from the reference while preserving alignment with it. |
| Outcome: | Extensive experiments on 13 benchmarks show that DARL surpasses RLPR in both reasoning accuracy and output diversity. |
Verifying the Subjective: Structured Multilingual Rewards for Low-Resource Alignment (2026.findings-acl)
Copied to clipboard
| Challenge: | Structured Multilingual Reward Modeling Framework extends Reinforcement Learning with Verifiable Rewards (RLVR) to subjective and open-ended tasks. |
| Approach: | They propose a framework that extends Reinforcement Learning with Verifiable Rewards to subjective and open-ended tasks. |
| Outcome: | The proposed framework improves reasoning capability and response quality on 7 tasks across 50 low-resource languages. |
From General Reward to Targeted Reward: Improving Open-ended Long-context Generation Models (2025.emnlp-main)
Copied to clipboard
| Challenge: | Current research on long-form context in Large Language Models (LLMs) focuses on understanding of long-contexts, but the open-ended Long Text Generation (Open-LTG) remains underexplored. |
| Approach: | They propose a method that uses data synthesis and a reward signal to enhance model performance. |
| Outcome: | The proposed method outperforms GPT-4-Turbo and improves performance by 20% on the Open-LTG task. |