Empirical evidence is provided that planning and coding can be separated to a considerable extent in LLM-based code generation, which may offer a more flexible way to construct code-generation systems.
Abstract
Planning has been identified as an important factor for improved code generation with Large Language Models (LLMs). However, the interaction between planning capability and coding capability remains largely underexplored, especially when the two capabilities are from different LLMs. In this paper, we conduct the first comprehensive empirical study of planning-coding interaction in LLM-based code generation, where planning and coding are assigned to different LLMs (i.e., planning-coding separation). Specifically, we explore different planner-coder combinations to investigate the effectiveness for coders to utilize planning information from various planners and the impact of further training of coders on planner-coder combinations. Our results demonstrate that almost all planner-coder combinations are as competitive as using the same LLM for planning and coding, and the combination of a stronger planner and a stronger coder typically achieves improved effectiveness. Furthermore, using a large model as the planner paired with a much smaller model as the coder can sometimes be as competitive as using the large model as both the planner and the coder, and further training of the coder can typically boost various planner-coder combinations. These findings provide empirical evidence that planning and coding can be separated to a considerable extent in LLM-based code generation, which may offer a more flexible way to construct code-generation systems.
Recent advances in code intelligence are largely driven by large language models (LLMs), which represent code as token sequences and achieve strong results on many software engineering tasks. However, standard token-based approaches often struggle to capture the inherent structural regularities of programming languages...
Qing-Lin Liang, Zhao Zhang, Chen Liu et al.· Proceedings of the ACM on So...· 1 citation
Frontier large language models (LLMs) can generate heuristic functions that guide search to achieve state-of-the-art performance in satisficing planning, where any plan is acceptable. However, these heuristics are not guaranteed to be admissible and can lead to suboptimal plans. We introduce LeanPlan, the first plannin...
A. G. Pereira, Augusto B. Corrêa, Felipe Meneguzzi et al.· 0 citations
Abstract We propose an iterative programmatic planning (IPP) framework that solves grid-based tasks by using large language models (LLMs) to synthesize interpretable, executable programs that act as agent policies mapping environment states to action sequences, rather than relying on traditional search or reinforcement...
Ashwath Vaithinathan Aravindan, Zhi-Bin Tang, M. Kejriwal· Royal Society Open Science· 3 citations
In this work we focus on the problem of embodied task planning, which requires an agent to accomplish a complex task by separating it into atomic actions. Recent studies have developed LLM-based methods to address this problem. However, the executability and correctness of the generated plans remain suboptimal in compl...
Pei-Ran Xu, Yi-Xiang Yang, Jing-Han Li et al.· Conference on Empirical Meth...· 0 citations
Large Language Models (LLMs) have significantly advanced automatic code generation in mainstream, high-resource, general-purpose programming languages. These models are trained on large instruction-code datasets with executable test environments, which can benchmark the performance of the outputs. However, they typical...
Vedad Misirlic, Kevin Innerebner, Gerald Stieglbauer et al.· Proceedings of the 35th ACM...· 0 citations
LoLBench is a multilingual benchmark of 100 tasks across 29 software systems in five domains that shows that both perception and implementation remain central challenges for coding agents in practical modular development on large software systems.