Self-evolving Agent Harness
Self-evolving Agent Harness is a 66-page survey and theory paper on revising an agent's scaffolding (prompts, memory, workflows, tools, code, plugins) while model weights stay fixed. It frames search as evolutionary optimization and uses continual PAC-learning to derive a generalization bound, a retention bound and a high-probability admission rule with fresh validation data. It separates selection, activation, attribution and improvement as evaluation claims, and covers applications and governance. Code is at github.com/zgcagi/Harness-RSI.
What it claims
The paper defines harness self-evolution as a feedback-driven loop. Revisions to an agent's scaffolding are proposed, admitted or rejected, and accepted ones persist across later runs while model weights stay fixed. Its most usable contribution for practitioners is a four-part test for any reported gain from a self-evolving harness:
- Selection: whether the estimate is independent of the search, or corrects for it.
- Activation: whether the accepted update actually ran in the scored runs.
- Attribution: whether the update caused the difference under controlled conditions.
- Improvement: whether the difference holds beyond the tasks that produced it.
The authors argue that held-out performance, component use and retained gains each need different evidence.
How it works
The framework treats what is updated separately from how changes are proposed and admitted. It sorts update targets into four kinds:
- Interpreted state: instructions, memory and workflow specifications read by fixed components.
- Executable tools and code.
- Repository-level control logic.
- Plugin composition.
flowchart LR
R[Agent runs] --> F[Execution feedback]
F --> P[Propose revision]
P --> A{Admission check on fresh validation data}
A -- accept --> H[Persisted harness]
A -- reject --> P
H --> RSearch is modelled as evolutionary optimization. Continual PAC-learning gives three results under stated assumptions: an expected generalization bound, a retention bound that depends on historical regression budgets, and a high-probability admission rule. The admission rule requires fresh, independent validation data. Illustrative cases come from prior work and cover model-harness co-design, distributed execution and plugin reuse.
How to use it
The page lists no models or datasets linked to the paper. The text is available through the Hugging Face CLI:
hf papers read 2610.18813To install the CLI:
curl -LsSf https://hf.co/cli/install.sh | bashThe repository at github.com/zgcagi/Harness-RSI is described as continuously updated. Closely related 2026 work recommended on the page includes VERSE (a verified self-evolving optimizer for agent harnesses), Harness Continual Learning, AgentEvolver and "Safety Must Survive Self-Improvement".
Limits
The fetched page holds only the abstract and an author note. It gives no bound expressions, assumptions, algorithms or experimental numbers. The theoretical guarantees hold only under the paper's explicit assumptions. Admission also depends on validation data that the search has not touched. The authors state that reliable deployment needs continual revalidation as task distributions and evaluators change. They also call for independent safeguards on learning, runtime privileges and consequential actions.
Organisations named here
Technologies named here
- Harness-RSI
- Hugging Face CLI
- LLM
Techniques named here
- Harness self-evolution
- Evolutionary optimization of harnesses
- Continual PAC-learning analysis
- Four-claim evaluation of reported gains
- Update-target taxonomy
Related in agents



