@patpcj: Thanks again for your interest in our work! Links here so they don’t get buried under “show more”: Paper : https://arxi…
Summary
Harness-1 is a 20B search agent trained with reinforcement learning using a stateful search harness, achieving strong results on retrieval benchmarks and outperforming other open search subagents.
View Cached Full Text
Cached at: 06/09/26, 08:57 AM
Thanks again for your interest in our work! Links here so they don’t get buried under “show more”: Paper : https://arxiv.org/abs/2606.02373 Code : https://github.com/pat-jj/harness-1… Model : https://huggingface.co/pat-jj/harness-1…
Everything is open. Feel free to star the github repo to bookmark it for later
Harness-1: Reinforcement Learning for Search Agents with State-Externalizing Harnesses
Source: https://arxiv.org/abs/2606.02373 View PDF
Abstract:Search agents are often trained as policies over growing transcripts: the model must decide how to search while also remembering what it has seen, which evidence is useful, which constraints remain open, and which claims have actually been checked. We argue that this formulation puts too much routine state management inside the policy: reinforcement learning is forced to optimize both semantic search decisions and recoverable bookkeeping that the environment can maintain more reliably. We introduce Harness-1, a 20B search agent (retrieval subagent) trained with reinforcement learning inside a stateful search harness. The harness maintains environment-side working memory, including a candidate pool, an importance-tagged curated set, compact evidence links, verification records, compressed and deduplicated observations, and budget-aware context rendering. The policy retains the semantic decisions: what to search, which documents to keep or discard, what to verify, and when to stop. Across eight retrieval benchmarks spanning web, finance, patents, and multi-hop QA, Harness-1 achieves 0.730 average curated recall, outperforming the next strongest open search subagent by +11.4 points and remaining competitive with much larger frontier-model searchers. Its gains are especially strong on held-out transfer benchmarks, suggesting that reinforcement learning over explicit search state can produce retrieval behaviors that generalize beyond the training domains. Our code is available atthis https URL.
Submission history
From: Pengcheng Jiang [view email] **[v1]**Mon, 1 Jun 2026 15:21:41 UTC (6,831 KB)
Similar Articles
Harness-1: Reinforcement Learning for Search Agents with State-Externalizing Harnesses
Introduces Harness-1, a 20B open search agent trained with state-externalizing harnesses, achieving strong retrieval performance and outperforming larger frontier models on several benchmarks.
Harness-G: A Graph-Structured Harness for Search Agents
This paper introduces Harness-G, a graph-structured retrieval framework that reformulates free-form query generation as finite action selection to reduce retrieval aliasing in RL-powered search agents. Across six QA benchmarks, Harness-G outperforms the strongest baseline Graph-R1 by 10.74 points at 1.5B and 3.98 points at 3B scale.
@omarsar0: Build your own harness, folks. This is absolute banger paper from NVIDIA on self-evolving agent harnesses. (bookmark it…
The paper introduces SoL-Pi, an automated harness discovery method that reduces token usage by nearly half and cuts API costs by about a third while maintaining performance on benchmarks using models like GPT-5.6 Sol and Opus 5.
@dair_ai: // State-Externalizing Harnesses // A new paradigm is emerging on how to effectively build agents and harnesses. If the…
Harness-1 introduces a state-externalizing harness that separates routine bookkeeping from policy decisions in search agents, enabling a 20B model to outperform larger frontier searchers across multiple benchmarks.
@dair_ai: Great paper on self-evolving agent harnesses. Self-evolving agent harnesses have two practical problems: 1. Search is s…
The paper proposes Ecdysis, a framework for training runtime harnesses for LLM agents that identifies recurring failure patterns to improve efficiency and accuracy, achieving 1.84x faster training and 18.56% higher reasoning accuracy.