← 返回时间线

paper

AgentGrad: Intervention-guided Prompt Optimization for Multi Agent Systems

arXiv ↗
ID
2609.08572
分类
—
首次捕获
2026-09-11
状态
unread
作者
Jaewon Chu, Jinwoo Seo, Jaewon Cho, Jeehye Na, Yunyang Xiong, Youngdae Kim, Hyunwoo J. Kim
信号
🔥 93

信号历史

  • 2026-09-11HF Daily Papers · 🔥89
  • 2026-09-12HF Daily Papers · 🔥90
  • 2026-09-13HF Daily Papers · 🔥92
  • 2026-09-14HF Daily Papers · 🔥93
暂无信号数据

摘要

Large language model (LLM)-based multi-agent systems (MAS) achieve strong performance by employing specialized multiple agents, yet their performance depends on the prompt design of each agent. For MAS prompt optimization, textual gradient methods that guide prompt updates using natural-language feedback have emerged as a leading paradigm. In this paper, we identify limitations in two stages of existing textual gradient approaches: gradient extraction and gradient aggregation. In gradient extraction, previous works select a target prompt without verifying whether modifying it resolves the failure, and derive gradients without agent-level supervision over the corresponding agent's intermediate output. In gradient aggregation, individual gradients are randomly grouped and concatenated, often mixing unrelated failure modes and producing prompts that fail to generalize. To address these limitations, we propose AgentGrad, a prompt optimization framework for multi-agent systems based on sequential intervention and semantic textual gradient abstraction. For each failure, sequential intervention modifies the behavior of one agent at a time to identify the target agent whose modification resolves the failure. The modified output of the target agent then serves as agent-level supervision for extracting a fine-grained gradient. Semantic textual gradient abstraction clusters semantically similar gradients to prevent mixing unrelated failure modes, and abstracts each cluster into a generalized gradient that captures the shared corrective pattern. Experimental results show that AgentGrad achieves state-of-the-art performance across five MAS benchmarks and reduces wall-clock optimization time by 2.5times on average compared to the next-fastest baseline.

我的笔记

还没有笔记。

在 GitHub 上写笔记 ↗(新建 content/notes/2609.08572.md,PR 合并后本页自动更新)