about
Planning-Driven Programming: A Large Language Model Programming Workflow (arxiv.org)
1 point by PaulHoule on Dec 13, 2024 | hide | past | pdf | discuss on HN

In plain words: Instead of coding straight away and patching failures, this workflow has the model write a plain-language solution plan, check it against visible tests, then write code from that plan. It raised first-try success by up to 16.4% over the best earlier approaches.

Abstract

The strong performance of large language models (LLMs) raises extensive discussion on their application to code generation. Recent research suggests continuous program refinements through visible tests to improve code generation accuracy in LLMs. However, these methods suffer from LLMs' inefficiency and limited reasoning capacity. In this work, we propose an LLM programming workflow (LPW) designed to improve both initial code generation and subsequent refinements within a structured two-phase workflow. Specifically, the solution generation phase formulates a solution plan, which is then verified through visible tests to specify the intended natural language solution. Subsequently, the code implementation phase drafts an initial code according to the solution plan and its verification. If the generated code fails the visible tests, the plan verification serves as the intended solution to consistently inform the refinement process for correcting bugs. Compared to state-of-the-art methods across various existing LLMs, LPW significantly improves the Pass@1 accuracy by up to 16.4% on well-established text-to-code generation benchmarks. LPW also sets new state-of-the-art Pass@1 accuracy, achieving 98.2% on HumanEval, 84.8% on MBPP, 59.3% on LiveCode, 62.6% on APPS, and 34.7% on CodeContest, using GPT-4o as the backbone. Our code is publicly available at: https://github.com/you68681/lpw

Chao Lei, Yanchuan Chang, Nir Lipovetzky, Krista A. Ehinger
arXiv:2411.14503 · cs.SE, cs.AI · submitted Nov 21, 2024 · updated May 23, 2025
abstract · pdf · html

add comment on HN