arXiv:2410.02089cs.CL
RLEF: Grounding Code LLMs in Execution Feedback with Reinforcement Learning
Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.
Abstract
Large language models (LLMs) deployed as agents solve user-specified tasks over multiple steps while keeping the required manual engagement to a minimum. Crucially, such LLMs need to ground their generations in any feedback obtained to reliably achieve the desired outcomes. We propose an end-to-end reinforcement learning method for teaching models to leverage execution feedback in the realm of code synthesis, where state-of-the-art LLMs struggle to improve code iteratively compared to independent sampling. We benchmark on competitive programming tasks, where we achieve new state-of-the art results with both small (8B parameters) and large (70B) models while reducing the amount of samples required by an order of magnitude. Our analysis of inference-time behavior demonstrates that our method produces LLMs that effectively leverage automatic feedback over multiple steps.
My stack lately has been Next.js with Prettier and very strict lint, type, and complexity gates, plus opinionated tests that aim for real signal over mere coverage theatre. I want to find the time to fine-tune GPT-4o using before/after examples of code that fails the gates and…
mkw5053View on HNParent context