Pith. sign in

REVIEW 1 cited by

RePrompt: Planning by Automatic Prompt Engineering for Large Language Models Agents

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.11132 v2 pith:EYY4MAOV submitted 2024-06-17 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords agentspromptfinallanguagellmsperformancerepromptapproach
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In the past year, large language models (LLMs) have had remarkable success in domains outside the traditional natural language processing, and their capacity is further expanded into the so-called LLM agents when connected with external tools. In all domains, the prompt to the LLMs has been shown to make a big difference in what the LLM would generate and thus affect the performance of the LLM agents. Therefore, automatic prompt engineering (APE) has become an important question for many researchers and users of LLMs. However, previous works in APE rely on a final checker to evaluate the performance of the given prompt -- a requirement that is hard to meet in the case of LLM agents, where intermediate feedback is easier to obtain, and the final evaluation could be expensive, inaccurate, or even missing. In this paper, we propose a novel method, \textsc{RePrompt}, which does a ``gradient descent"-like approach to optimize the step-by-step instructions in the prompts given to LLM agents, based on the chat history obtained from interactions and reflections with LLM agents. By leveraging intermediate feedback, \textsc{RePrompt} can optimize the prompt without the need for a final solution checker. We evaluate our approach on PDDL generation, TravelPlanner, and Meeting Planning to show that our method could generally improve performance for different reasoning tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Iterative Deepening Sampling as Efficient Test-Time Scaling

    cs.CL 2025-02 conditional novelty 6.0 of 10

    ID-Sampling inserts self-correction trigger sentences at geometrically increasing token budgets during LLM generation, improving pass rates on MATH-500 and AIME over vanilla Best-of-N and majority voting.

Pith tools