AutoPDL: Automatic Prompt Optimization for LLM Agents

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Spiess, Claudio, Vaziri, Mandana, Mandel, Louis, Hirzel, Martin
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914133019983872
author Spiess, Claudio
Vaziri, Mandana
Mandel, Louis
Hirzel, Martin
author_facet Spiess, Claudio
Vaziri, Mandana
Mandel, Louis
Hirzel, Martin
contents The performance of large language models (LLMs) depends on how they are prompted, with choices spanning both the high-level prompting pattern (e.g., Zero-Shot, CoT, ReAct, ReWOO) and the specific prompt content (instructions and few-shot demonstrations). Manually tuning this combination is tedious, error-prone, and specific to a given LLM and task. Therefore, this paper proposes AutoPDL, an automated approach to discovering good LLM agent configurations. Our approach frames this as a structured AutoML problem over a combinatorial space of agentic and non-agentic prompting patterns and demonstrations, using successive halving to efficiently navigate this space. We introduce a library implementing common prompting patterns using the PDL prompt programming language. AutoPDL solutions are human-readable, editable, and executable PDL programs that use this library. This approach also enables source-to-source optimization, allowing human-in-the-loop refinement and reuse. Evaluations across three tasks and seven LLMs (ranging from 3B to 70B parameters) show consistent accuracy gains ($9.21\pm15.46$ percentage points), up to 67.5pp, and reveal that selected prompting strategies vary across models and tasks.
format Preprint
id arxiv_https___arxiv_org_abs_2504_04365
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle AutoPDL: Automatic Prompt Optimization for LLM Agents
Spiess, Claudio
Vaziri, Mandana
Mandel, Louis
Hirzel, Martin
Machine Learning
Artificial Intelligence
Programming Languages
The performance of large language models (LLMs) depends on how they are prompted, with choices spanning both the high-level prompting pattern (e.g., Zero-Shot, CoT, ReAct, ReWOO) and the specific prompt content (instructions and few-shot demonstrations). Manually tuning this combination is tedious, error-prone, and specific to a given LLM and task. Therefore, this paper proposes AutoPDL, an automated approach to discovering good LLM agent configurations. Our approach frames this as a structured AutoML problem over a combinatorial space of agentic and non-agentic prompting patterns and demonstrations, using successive halving to efficiently navigate this space. We introduce a library implementing common prompting patterns using the PDL prompt programming language. AutoPDL solutions are human-readable, editable, and executable PDL programs that use this library. This approach also enables source-to-source optimization, allowing human-in-the-loop refinement and reuse. Evaluations across three tasks and seven LLMs (ranging from 3B to 70B parameters) show consistent accuracy gains ($9.21\pm15.46$ percentage points), up to 67.5pp, and reveal that selected prompting strategies vary across models and tasks.
title AutoPDL: Automatic Prompt Optimization for LLM Agents
topic Machine Learning
Artificial Intelligence
Programming Languages
url https://arxiv.org/abs/2504.04365