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

Atharva Gundawar, Karthik Valmeekam, Mudit Verma, Subbarao Kambhampati
11/20/2024
cs.CLcs.AI

No official code found. Best implementation: Atharva-Gundawar/LLM-Modulo-prompts (12 stars, last commit 2024-11-17).

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.

View on arXivView PDF

Code Implementations(1)

Prompt structures and examples used in "Robust Planning with Compound LLM Architectures: An LLM-Modulo Approach"

121Nov 17, 20241 years ago

Similar Papers

Cite this paper

@article{gundawar2024robust,
  title  = {Robust Planning with Compound LLM Architectures: An LLM-Modulo Approach},
  author = {Atharva Gundawar and Karthik Valmeekam and Mudit Verma and Subbarao Kambhampati},
  year   = {2024},
  eprint = {2411.14484},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.14484v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.14484.svg)](https://codeofpaper.com/paper/2411.14484)

Discussion