Can agent harnesses be automatically optimized across many environments?
Explores whether scaling auto-research loops across diverse harness environments can discover mechanisms that reduce token use without sacrificing task performance, and whether such discoveries generalize.
SoL-Pi treats the agent harness, not the model or the serving stack, as the object of automated search. The authors scale "auto-research loops across increasingly numerous and diverse environments for harness rollouts" and report that four mechanisms "survive selection": action execution, context compaction, observation handling, and delegated reading. On the 51-task EdgeBench evaluation the assembled stack reaches performance comparable to the Pi harness on both GPT-5.6 Sol and Opus 5, while recorded token traffic falls by 44.7–49.0% and API cost by about one third. The best individual candidates are reported to improve model performance by 5.3–12.8% and token efficiency by 9.8–18.2%.
The paper's reasoning is that long unattended coding-agent trajectories make token use "a first-order systems concern," and that existing efficiency work (faster kernels, quantization, cheaper models) leaves the harness untouched. Harness-level optimization is framed as orthogonal to those, since it needs no additional model training. The scale argument is the distinctive part: harness artifacts found in one setting tend not to generalize, and the authors take their cross-model consistency as "preliminary evidence" that exposing the harness to many tasks and updating it from the resulting trajectories mitigates this. They call the long-term direction "pretraining the harness" and state it as a hypothesis, not a result.
Against the neighbors, this is a search-discovered counterpart to hand-designed harness efficiency. Can explicit behavior maps help weaker planners compete with stronger models? also cuts planner tokens through harness structure, but by a human-specified representation, where here the mechanisms are selected by the loop. It is consistent with Does raw token spending actually predict agent performance?: if raw tokens explain little of success, then removing nearly half of them at comparable performance is what that account would allow. It also gives Where does agent reliability actually come from? a cost-side datum, since the gains sit in the harness layer. Two model families are a thin test of the claim in Do stronger models always evolve harnesses better?, which is about who writes and who uses updates, and this excerpt does not vary either role.
The excerpt does not establish how selection works, how many environments or loop iterations were run, or what each of the four mechanisms does beyond its name. It gives no ablation showing which mechanism carries the savings, and it does not define "comparable" statistically. The dollar savings are described as "estimated." Generalization is claimed only "within the evaluated setting," so transfer to other benchmarks, harnesses or weaker models is untested here. The defensible reading is that a scaled harness search found a large token saving without a visible performance loss on one benchmark, not that harnesses can now be reliably pretrained.
Inquiring lines that read this note 34
This note is a source for these research framings, grouped by the broader line of inquiry each explores. Scan the bold lines of inquiry; follow any specific question forward.
What fundamental constraints limit how effectively agents can improve themselves?- Can autonomous research agents outperform hand-tuned hyperparameter search?
- Can agents learn to compress verified evidence and unresolved constraints into a compact improvement state?
- How can agent data flywheels improve task quality iteratively?
- Do task-level outcomes provide sufficient supervision for harness evolution?
- What makes an agent mechanism reusable versus benchmark-specific?
- Can context management be optimized for an agent without retraining or changing the model?
- Can runtime behavior mapping help localize harness deficiencies?
- How do evolved harness edits generalize across different benchmark domains?
- Can harness edits distill reusable strategies or mostly memorize task-specific fixes?
- How much realized agent capability comes from the harness versus the model?
- Can harness edits trained on one batch transfer to new tasks?
- How do prompt optimization and code harnesses compare for capability transfer?
- What safety relations does a domain supply that a harness must capture?
- How do agentic systems hide harness failures from benchmarks?
- What makes a harness low-friction for model strategy?
- Which domains see models exceed human harness design quality?
- Why do useful harness updates often disappear during model evolution?
- How much does executor choice change a harness's actual performance?
- Do models co-adapt their harnesses to specific executor strengths?
- Can mid-tier models benefit more from harness improvements than frontier models?
- Does harness scaling represent a fundamentally different path than model scaling?
- How much does harness design contribute to reported model capability scores?
- How does harness structure affect planner token efficiency compared to model size?
- What role does effective feedback compute play in agent harness scaling?
- Does harness optimization generalize across different benchmarks and agent architectures?
- Can harness evolution gains be distinguished from test-time search improvements on matched budgets?
Related concepts in this collection 4
This note in its neighbourhood — explore the map, then jump to a related concept in the list below.
Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph
-
Can explicit behavior maps help weaker planners compete with stronger models?
Explores whether organizing harness repositories around runtime behavior—rather than relying on model inference—can narrow the capability gap between weaker and stronger planning models, and whether this reduces computational overhead.
another harness-level route to fewer planner tokens, hand-designed rather than found by a search loop
-
Does raw token spending actually predict agent performance?
Standard measures of agent effort—tokens, tool calls, operations—may not capture what makes inference-time scaling work. This explores what actually drives performance gains when agents spend more compute.
raw token counts predict success poorly, which fits a large token cut at comparable performance
-
Where does agent reliability actually come from?
Exploring whether LLM agent performance depends on larger models or on thoughtful system design choices like memory, skills, and protocols that shift cognitive work outside the model.
supports locating gains in the harness layer, here measured as token and cost savings
-
Do stronger models always evolve harnesses better?
We explore whether base model capability predicts both the ability to write useful harness updates and the ability to benefit from them. The answer reshapes how we should allocate capability in self-evolving agent systems.
same self-evolving harness setting, but that note varies model tier and this excerpt varies only two models
Related papers in this collection 8
Papers most semantically related to this note, ranked by cosine similarity in the embedding space.
- SoL-Pi: Recursively Scaling Auto-Research Loops for Efficient Agent Harness
- Rethinking the Evaluation of Harness Evolution for Agents
- Scaling Laws for Agent Harnesses via Effective Feedback Compute
- Harness Updating Is Not Harness Benefit: Disentangling Evolution Capabilities in Self-Evolving LLM Agents
- Prime Agent: A Self-Improving RLM Harness
- HarnessDev: Can LLMs Create and Evolve Their Own Agent Harness?
- AutoLab: Can Frontier Models Solve Long-Horizon Auto Research and Engineering Tasks?
- ModularRSI: Modular and Generalizable Recursive Harness Self-Improvement
Original note title
scaling auto-research loops across many harness environments yields mechanisms that cut token traffic nearly half at comparable performance