Sifting through the Chaff: On Utilizing Execution Feedback for Ranking the Generated Code Candidates
Not on the map. Why?
Abstract (arXiv)
Large Language Models (LLMs), such as GPT-4, StarCoder, and CodeLlama, are transforming the way developers approach programming by automatically generating code based on given natural language descriptions. Despite advancements, generating syntactically and semantically correct code remains challenging, especially for complex programming tasks. Existing approaches typically generate multiple candidate solutions using LLMs to increase the likelihood of producing correct code. However, selecting the correct code from these candidates-a process known as code ranking-remains a major challenge. Current research on code ranking can be categorized into execution-based and non-execution-based methods. Execution-based methods, although effective, encounter notable limitations, such as scarcity of quality unit tests and security risks. Non-execution-based methods like CodeRanker, which rely solely on classification labels to train a code ranker, struggle to capture subtle errors and provide detailed error insights. Recognizing the strengths and limitations of both approaches, we propose a new method. The key insight of our work is that an effective code ranker is expected to truly comprehend the underlying causes of erroneous code, as relying solely on classification labels is insufficient. Inspired by this, this paper puts forward RankEF, an innovative approach for code ranking that leverages execution feedback. RankEF employs multi-task learning to integrate code classification with execution feedback generation. This approach enables the model to understand the reasons behind incorrect code, distinguishing between correct and incorrect solutions without the need to execute the code during the ranking phase. Experiments on three code generation benchmarks demonstrate that RankEF significantly outperforms the state-of-the-art CodeRanker.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 26 Aug 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 3; 2026: 3.
6 papers.
- 2025CODESYNC: Synchronizing Large Language Models with Dynamic Code Evolution at Scalecited by 8
- 2025On LLMs' Internal Representation of Code Correctnesscited by 5
- 2026ACES: Who Tests the Tests? Leave-One-Out AUC Consistency for Code Generationcited by 2
- 2025Reinforcement Learning-Guided Chain-of-Draft for Token-Efficient Code Generationcited by 1
- 2026On the Robustness of LLMs' Internal Representation of Code Correctnesscited by 1
- 2026Keep Evaluation Fair: Detecting Data Leakage in Code Generation Benchmarks via Membership Inference Attackscited by 0
- 2026Keep Evaluation Fair: Detecting Data Leakage in Code Generation Benchmarks via Membership Inference Attacks9 Sep 2026
- 2026On the Robustness of LLMs' Internal Representation of Code Correctness8 Aug 2026
- 2026ACES: Who Tests the Tests? Leave-One-Out AUC Consistency for Code Generation5 Apr 2026
- 2025On LLMs' Internal Representation of Code Correctness8 Dec 2025
- 2025Reinforcement Learning-Guided Chain-of-Draft for Token-Efficient Code Generation26 Sep 2025
- 2025CODESYNC: Synchronizing Large Language Models with Dynamic Code Evolution at Scale23 Feb 2025