【KR】harness RSI 别盲搜:Samsung HGM-Dual,相对最强基线最高 +14.45%
【KR】harness RSI 别盲搜:Samsung HGM-Dual,相对最强基线最高 +14.45%
View PDF HTML (experimental) Abstract: Harness optimization, which improves an agent's prompts, tools, and workflows, is an increasingly effective way to enhance agents built on frozen or closed-source LLMs. Leading approaches such as the Darwin--Godel Machine and the...
HGM-Dual (arXiv:2610.30042)
“View PDF HTML (experimental) Abstract: Harness optimization, which improves an agent's prompts, tools, and workflows, is an increasingly eff”
Abstract:Harness optimization, which improves an agent's prompts, tools, and workflows, is an increasingly effective way to enhance agents built on frozen or closed-source LLMs. Leading approaches such as the Darwin--Godel Machine and the Huxley--Godel Machine (HGM) rely on recursive self-improvement and were developed mainly for coding, where the competence needed to improve the agent coincides with the competence being improved. Planning tasks, in which an agent must produce a sequence of tool calls that jointly satisfies interacting constraints, break this alignment. There, open-ended self-modification repeatedly explores ineffective changes and consumes substantial evaluation budgets. We introduce HGM-Dual, a diagnostic-guided framework for budget-efficient harness evolution for planning agents. First, HGM-Dual represents agent evolution as lineage-aware context. This context records what each ancestor changed, which behaviors improved or regressed, and which modifications were ineffective, giving the editor explicit edit-outcome attribution instead of an unstructured archive of past agents. Second, HGM-Dual introduces error-conditioned dual-path child generation. For each selected parent, it generates a general child that preserves open-ended exploration and specialized children that target the harness components most likely responsible for the parent's highest-ranked constraint violations. HGM-Dual outperforms the strongest baseline by up to 14.45% relative improvement in case accuracy while matching HGM variants' final performance with 2x-4x fewer evaluation budget.
| Subjects: | Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Neural and Evolutionary Computing (cs.NE) |
| Cite as: | arXiv:2610.30042 [cs.AI] |
| (or arXiv:2610.30042v1 [cs.AI] for this version) | |
| https://doi.org/10.48550/arXiv.2610.30042 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Pengrui Quan [view email]
[v1]
Wed, 21 Oct 2026 17:02:28 UTC (208 KB)
Source: Agent Control Flash News · arxiv.org
Related Products & Analysis
Cursor Agent 架构全景拆解:从影子工作区到多文件推演引擎
全面剖析 Cursor 在 Agent 模式下的底层技术实现,解析影子分支隔离、LSP 上下文剪枝以及预测性补全的核心架构细节与工程实践经验。
Vercel v0 推出全新多 Agent 协作画布与实时全栈部署预览
动态速评:v0 正在从单一组件生成器演进为全栈应用搭建协作台,尤其是与 Neon/Postgres 的直连极大降低了全栈原型验证成本。