研究剖析 Agent Harness 优化收益:是激发能力还是扩展上限
Elicitation or Expansion? Demystifying Gains from Agent Harness Optimization
一篇把 harness 优化收益拆开来量的论文,结论挺反直觉:小预算下赢了更强模型,预算放大后可能翻车,做 agent 工程的可以看看。
这篇 arXiv 论文(编号 2610.27889)借鉴强化学习中 pass@k 的分析方法,对比优化前后 harness 的表现差异。研究发现 harness 优化带来的 pass@1 优势在更大尝试预算下可能被更强的模型和更多推理算力反超,且整体收益掩盖了在困难任务上的短板。作者据此区分了"激发"(elicitation)与"扩展"(expansion)两种收益,并指出这一区分对递归自我改进和进化搜索至关重要。
Elicitation or Expansion? Demystifying Gains from Agent Harness Optimization
Recent studies in harness optimization have shown substantial performance gains in language model agents without updating model weights. A well-designed harness more effectively leverages the underlying model's capabilities by shaping context, tool use, and execution workflows. However, naïve success rates alone do not fully characterize whether optimized harness yields more reliable success on tasks already within reach (elicitation) or a broader range of solvable tasks (expansion). This distinction is crucial for recursive self-improvement and evolutionary search, as expansion may provide a broader range of successful experiences to push the capability boundaries. Despite the growing significance, this distinction remains underexplored in harness optimization. We conduct a systematic analysis to study the effect of gains from harness optimization. Building on pass@k analyses in the reinforcement learning (RL) literature that compare models before and after RL training, we compare optimized harnesses with their pre-optimization counterparts. Specifically, we assess changes in reachable task coverage, compare harness optimization with model scaling and increased inference-time compute, and examine how gains vary with task difficulty. Across static prediction and dynamic tasks, we find that pass@1 advantages of harness over stronger interventions can reverse at larger attempt budgets and aggregate gains conceal shortfalls on hard tasks, underscoring the need for a fine-grained diagnosis.