Thinking Before Running! Efficient Code Generation with Thorough Exploration and Optimal Refinement (2025.findings-acl)
Copied to clipboard
| Challenge: | Recent research indicates that large language models (LLMs) have demonstrated remark-able capabilities in various programming-related domains, such as code generation and code refinement. |
| Approach: | They propose a framework that combines exploration with refinement to reduce test-time computation overhead. |
| Outcome: | The proposed framework outperforms SOTA and AgentCoder on humanEval and MBPP benchmarks while reducing test-time computation overhead and scalability. |
Similar Papers
MapCoder: Multi-Agent Code Generation for Competitive Problem Solving (2024.acl-long)
Copied to clipboard
| Challenge: | Large language models (LLMs) have impressive proficiency in natural language processing, but performance in code generation tasks remains limited. |
| Approach: | They propose a framework that emulates the full cycle of program synthesis as observed in humans. |
| Outcome: | The proposed framework replicates the full cycle of program synthesis as observed in human developers. |
PairCoder: Pair Programming-Inspired Two-Agent Collaboration for Code Generation (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing multi agent frameworks for large language models are brittle on code generation tasks. |
| Approach: | They propose a framework that brings pair programming to autonomous LLM collaboration. |
| Outcome: | Using PairCoder, large language models achieve better results on code generation tasks and reduce token usage by 40% to 70% on eight representative backbones. |
Code-Optimise: Self-Generated Preference Data for Correctness and Efficiency (2025.findings-naacl)
Copied to clipboard
| Challenge: | Existing studies have shown that CLMs can generate accurate solutions with no regard for runtime, but at a substantial cost to correctness (down by up to 30%) |
| Approach: | They propose a framework that incorporates correctness and runtime as learning signals via self-generated preference data. |
| Outcome: | The proposed framework reduces the baseline runtimes by 6% and the average length of the generated solutions is reduced by up to 48% on MBPP and 23% on HumanEval. |
MavenCoder: Competitive Code Generation via Model Adaptive Planning Strategies and Multi-Perspective Verification Enhancement (2026.acl-long)
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have significantly enhanced automated program synthesis. |
| Approach: | They propose a model-adaptive and verification–enhanced framework for competition-level code generation that leverages adaptive assessment aligned with the model’s capabilities to select planning strategies while providing timely feedback and correction via multi-perspective verification. |
| Outcome: | The proposed framework outperforms existing state-of-the-art approaches on livecodebench, humanEval+, MBPP+, and codecontests, and achieves pass@1 results exceeding 3%–40%. |
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. |
CodeDPO: Aligning Code Models with Self Generated and Verified Source Code (2025.acl-long)
Copied to clipboard
| Challenge: | Existing training methods for code generation do not improve code correctness and efficiency. |
| Approach: | They propose a framework that integrates preference learning into code generation to improve code correctness and efficiency. |
| Outcome: | The proposed framework improves code correctness and efficiency by integrating preference learning into code generation. |
SolidCoder: Bridging the Mental-Reality Gap in LLM Code Generation through Concrete Execution (2026.findings-acl)
Copied to clipboard
| Challenge: | State-of-the-art code generation frameworks rely on mental simulations to validate buggy code. |
| Approach: | They propose a mental-reality gap between mental simulation and actual execution . they propose sandboxed execution with a simple principle: don't imagine—execute . |
| Outcome: | The proposed framework achieves state-of-the-art pass@1 performance on humanEval, CodeContests and APPS. |
SeDev: Structured Semantic Exploration for LLM-Driven Code Generation (2026.acl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown remarkable capabilities in automating code generation, but they suffer from insufficient exploration of the vast solution space. |
| Approach: | They propose a large-scale LLM-driven code generation framework that efficiently finds high-quality solutions in only a few iterations. |
| Outcome: | The proposed framework outperforms baselines while maintaining reasonable time and computational costs. |
CollabCoder: Plan-Code Co-Evolution via Collaborative Decision-Making for Efficient Code Generation (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing multi-agent code generation frameworks are constrained by static planning, isolated execution, high computational overhead, and limited adaptability to complex tasks. |
| Approach: | They propose a plan-code co-evolution framework that allows dynamic multi-agent collaboration to improve code quality and robustness across tasks. |
| Outcome: | The proposed framework improves code quality and robustness across tasks while reducing the number of API calls by an average of 4-10 per execution. |
CodeTree: Agent-guided Tree Search for Code Generation with Large Language Models (2025.naacl-long)
Copied to clipboard
| Challenge: | coding tasks require generated code to be fully executable and functionally correct . current agentic approaches struggle with multi-stage planning, generating, and debugging . |
| Approach: | They propose a framework for LLM agents to efficiently explore the search space in different stages of the code generation process. |
| Outcome: | The proposed framework achieves top results on 7 code generation benchmarks and a 31.9% solving rate on the SWEBench benchmark. |