提出优先级排序法,直接评估优化器的每步决策能力。
Towards Direct Evaluation of Harness Optimizers via Priority Ranking

- 让优化器对组件排序,判断其改进或损害潜力。
- 排序结果与真实多步优化效果高度相关,验证有效性。
- 基于182个人工验证场景,低成本实现精准评估。
Harness优化通过优化器代理迭代更新目标代理的框架,实现自动化代理生成。现有研究仅通过目标代理性能提升间接评估优化器,忽略了中间步骤中常出现的错误行为。因此,难以判断优化是源于智能决策还是盲目试错。为解决此问题,本文提出一种低成本直接评估方法——优先级排序:要求优化器根据组件(如工具)在更新时改善或损害代理性能的潜力进行排序。该方法无需昂贵的回放或人工检查,即可量化优化器在每一步的决策能力。更重要的是,排序表现与实际多步优化中的改进能力高度相关,证明其作为优化能力预测器的可靠性。优先级排序依托于Shor数据集,包含182个跨领域、跨设计、跨时间阶段的人工验证优化场景。代码与数据见https://github.com/k59118/Harness_Optimizer_Evaluation。
原文摘要 · Abstract (English)
Harness optimization enables automated agent creation by having an optimizer agent iteratively update the harness of target agents. Despite its success, current studies evaluate optimizers solely by observing target agents' performance gains. This indirect end-improvement evaluation neglects optimizers' actions at intermediate steps, which are often erroneous and hinder agent performance. Therefore, it is unclear whether harness optimization is driven by optimizers' informed update actions or simply trial-and-error. This necessitates direct evaluation of harness optimizers. However, evaluating harness optimizers directly is non-trivial and costly due to the lack of oracle harnesses. To address this, we present a simple, low-cost design to directly evaluate them, namely priority ranking. By asking harness optimizers to rank components (e.g., tools) in a given harness by their potential to improve/hinder agent performance when updated, our design quantifies optimizer ability at the step level without expensive rollouts or manual examination. More importantly, optimizers' ranking performance correlates with their ability to improve agents in actual multi-step harness optimization, establishing priority ranking as a reliable predictor of optimization ability. Priority ranking is enabled by Shor, a collection of 182 human-verified optimization scenarios spanning across domains, designs, and time stages. Codes and data can be found at https://github.com/k59118/Harness_Optimizer_Evaluation.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。