pith. sign in

arxiv: 2411.14484 · v1 · pith:DHPJGU6Snew · submitted 2024-11-20 · 💻 cs.CL · cs.AI

Robust Planning with Compound LLM Architectures: An LLM-Modulo Approach

classification 💻 cs.CL cs.AI
keywords frameworkoutputcompoundllm-moduloperformanceworkapproacharchitectures
0
0 comments X
read the original abstract

Previous work has attempted to boost Large Language Model (LLM) performance on planning and scheduling tasks through a variety of prompt engineering techniques. While these methods can work within the distributions tested, they are neither robust nor predictable. This limitation can be addressed through compound LLM architectures where LLMs work in conjunction with other components to ensure reliability. In this paper, we present a technical evaluation of a compound LLM architecture--the LLM-Modulo framework. In this framework, an LLM is paired with a complete set of sound verifiers that validate its output, re-prompting it if it fails. This approach ensures that the system can never output any fallacious output, and therefore that every output generated is guaranteed correct--something previous techniques have not been able to claim. Our results, evaluated across four scheduling domains, demonstrate significant performance gains with the LLM-Modulo framework using various models. Additionally, we explore modifications to the base configuration of the framework and assess their impact on overall system performance.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. End-to-end PDDL Planning with Hardcoded and Dynamic Agents

    cs.AI 2025-12 unverdicted novelty 5.0

    An end-to-end LLM framework refines natural language into valid PDDL domains and problems via hardcoded and dynamic agents, generates plans with standard engines, and returns readable output.