arXiv:cs.CL· Elias Lumer, Sahil Sen, Vamse Kumar Subbiah, Kevin Paul·· 11 小时前
反思式提示词优化如何提升 Deep-Research Agent 的迁移增益并揭示提示词级过拟合
Reflective Prompt Optimization of a Deep-Research Agent: A Topic-Disjoint, Multi-Seed Protocol for Measuring Transferable Gains and Prompt-Level Overfitting
AI 导读
研究者将反思式提示词进化(GEPA)用于多智能体 deep-research agent 的两个系统提示词,在主题不相交划分下,留出引用奖励从 0.702 升至 0.781,提升 0.079,bootstrap 95% 置信区间为 [0.051, 0.107],并在三个随机种子上复现(均值 0.107)。
正文
Abstract:Prompt optimization is an attractive alternative to reinforcement learning for adapting language-model agents, since it is cheap and produces human-readable artifacts. On factual tasks, however, it carries a failure mode that scalar-reward reinforcement learning does not. An optimizer that reads the training examples can write their answers into the prompt, so an in-distribution gain may be memorization rather than transferable behaviour. We apply reflective prompt evolution (GEPA) to the two system prompts of a multi-agent deep-research agent and evaluate it under a topic-disjoint split in which no topic is shared across train, validation, and test. Held-out citation reward rises by 0.079, from 0.702 to 0.781, with a bootstrap 95\% confidence interval of [0.051, 0.107], and the gain replicates across three seeds (mean 0.107). Nearly half of the winning prompt is a memorized answer key, yet a controlled ablation shows this content earns no reward even on the exact training questions it encodes. The large validation-minus-held-out gap is therefore small-sample selection under a noisy judge, not memorization. Varying the verifier isolates what makes the gain transfer. Decomposed per-dimension feedback is the causal ingredient, and collapsing it to a single scalar reward makes held-out transfer negative. The gain persists under an out-of-family judge and is largely reproduced by a hand-written version of the discovered recipe. Credible evaluation of prompt optimizers therefore requires held-out topics, multiple seeds, and verifier ablations. We release the candidate prompts, lineage diffs, figures, tables, and analysis.
| Subjects: | Computation and Language (cs.CL) |
| Cite as: | arXiv:2610.12601 [cs.CL] |
| (or arXiv:2610.12601v1 [cs.CL] for this version) | |
| https://doi.org/10.48550/arXiv.2610.12601 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Sahil Sen [view email]
[v1]
Thu, 8 Oct 2026 18:23:23 UTC (77 KB)
来源:arXiv:cs.CL · arxiv.org