Rethinking the Evaluation of Harness Evolution for Agents

Paper · arXiv 2607.12227
Agent Harness

We revisit the evaluation of automatic harness evolution for LLM agents. Existing harness evolution methods use unit test cases to search for harness configurations and then report final performance on the same public benchmark. This protocol raises two fundamental concerns. First, harness evolution is itself an iterative search procedure that repeatedly evaluates and revises candidate harnesses using task feedback. As in agentic test-time scaling, it should therefore be compared with simple task-level search baselines under matched feedback and inference budgets to determine whether its gains arise from improved harness design or from additional search alone. Second, because the search and the final evaluation share the same benchmark, the reported gains risk overfitting to that specific task set. To address these concerns, we conduct an extensive evaluation comparing harness evolution with simple test-time scaling and discovery baselines under comparable feedback and inference budgets, and also evaluate evolved harnesses on held-out tasks to assess whether the discovered improvements generalize.

Introduction. Large language model (LLM) agents increasingly rely on external harnesses to interact with complex environments [Yang et al., 2024, Merrill et al., 2026]. A harness defines the prompts, tools, memory, verification routines, and control logic through which a model observes tasks and acts [Lopopolo, 2026]. Prior work shows that harness engineering can substantially affect agent performance even with a fixed model [Trivedy, 2026], yet it remains largely manual: developers inspect trajectories, diagnose failures, and revise the harness. This has motivated automatic harness evolution, in which agents improve external harnesses [Lee et al., 2026, Lin et al., 2026, Zhang et al., 2026]. These methods typically follow a search loop: analyze prior trajectories, scores, and failures; propose modifications; evaluate them on benchmark tasks; and repeat [Lee et al., 2026, Zhang et al., 2026]. However, the evaluation of harness evolution needs further consideration.

Discussion / Conclusion. To understand where the gains and limits of automatic harness evolution come from, we take a closer look at the trajectories produced by Harness Evolution and Harness Scaling. Specifically, we examine what the meta agent modifies at each iteration, which changes are kept or rolled back, and which failure classes the changes target. We find that while the meta agent makes rational, well motivated edits across the prompt, middleware, and tool layers, a stable core of hard tasks remains unaffected, and the resulting improvements stay limited beyond simple test-time discovery baselines. Despite the breadth of these modifications, the overall improvement remains limited relative to test-time discovery baselines. The core issue is that most edits memorize fixes rather than distilling strategies. Much of this information is precisely what a competent agent can rediscover through exploration within a single rollout, so persisting it in the harness saves time on tasks the agent could already solve but rarely converts failures into successes.

Lines of inquiry this paper opens 24

Research framings built by reading the notes related to this paper — the questions it feeds into.

How does objective evolution guide discovery better than fixed planning? Do harness improvements transfer across model scales or memorize shortcuts? Does externalizing cognitive work and state improve agent reliability? How can AI agents autonomously learn and transfer skills across tasks? How should personalization be implemented to improve AI assistant effectiveness? How should systems govern persistent agent-generated code in shared infrastructure? Can single-axis benchmarks accurately predict agent deployment success? How do multi-agent systems achieve genuine cooperation and reasoning?