Research

MachinoAI Research

TRENDINGAI Agents

RRSI: Regularized Recursive Self-Improvement of Agent Harnesses

Regularize the search trajectory used to evolve an agent harness.

Peng Xia, Rujun Han, Zifeng Wang, Yanfei Chen, Yufan Zhang, Yoonho Lee, Chengsong Huang, Han Yu, Zhongying CuiZhu, Yifei Ming, Huaxiu Yao, Burak Gokturk, Tomas Pfister, Chen-Yu LeeSep 21, 2026arXiv preprint12 min read
AI Agentsagentsself-improvementharness engineeringevaluationgeneralizationefficiencyrecursive self-improvementregularizationagent harness

TL;DR

RRSI adds proposal-side sparsity, evidence-aware exploration, leakage screening, noise-aware acceptance, cost-aware acceptance and pruning; it improves held-out performance and reduces policy-token use.

Why It Matters

Agent capability increasingly depends on the system around the model, so harness optimization is a first-class production problem.

Research Brief

The shortest useful explanation.

RRSI adds proposal-side sparsity, evidence-aware exploration, leakage screening, noise-aware acceptance, cost-aware acceptance and pruning; it improves held-out performance and reduces policy-token use.

recursive self-improvementregularizationagent harnessOOD generalizationpolicy-token costagentsself-improvementharness engineering

Core Explanation

RRSI regularizes recursive improvement of LLM agent harnesses to reduce benchmark overfitting and improve transfer while lowering policy-token cost.

Why It Matters

Agent capability increasingly depends on the system around the model, so harness optimization is a first-class production problem.

RRSI proposal-side and selection-side regularization.

RRSI overview

Original paper figure.

Section 01

The Problem

01 THE PROBLEM

Agent behavior depends on prompts, control flow, tools, memory and context management. Manual tuning is slow; automated harness evolution can overfit the evolve set, chase noise and grow cost.

1Frozen backbone2Overfitting3Noise4Cost

Section 02

The Big Idea

02 THE BIG IDEA

RRSI regularizes the evolution process instead of restricting the reachable harness space: proposal-side controls constrain edits and selection-side controls constrain what persists.

1Proposal regularization2Selection regularization

Section 03

How It Works

03 HOW IT WORKS

Evaluate current harness, summarize feedback, propose candidates, screen for leakage, evaluate candidates, apply noise/cost gates and prune unproductive components; then test the final harness on held-out benchmarks.

1Evaluate2Propose3Screen4Select5Transfer

Section 04

The Math

04 THE MATH

The paper formalizes expected score and policy-token cost, an annealed edit budget, a noise-adjusted floor and a cost-aware acceptance inequality.

1S(H;D)2C(H;D)3b_t4noise floor5Delta S/Delta C

Section 05

Architecture

05 ARCHITECTURE

Frozen backbone plus editable harness, proposer/analyst, leakage critic, selection gates and held-out evaluation. The original Figure 2 shows the proposal-side and selection-side controls.

1Frozen policy2Harness3Proposer4Critic5Selection gates

Section 06

Experiments

06 EXPERIMENTS

Eight benchmarks: Terminal-Bench 2.1, SWE-bench Verified, Harvey LAB, JobBench, GDPval, APEX-Agents, EngDesign and Frontier-Eng. Reported gains include +6.0 Terminal-Bench, +4.9 EngDesign, +1.1 Harvey evolve, +1.8 SWE-bench Verified, +2.3 Harvey held-out, +3.5–4.7 JobBench/GDPval/APEX and +4.3 Medal points (24.3% relative) Frontier-Eng. Exact Table 1: H0 [89.4,86.9,36.0,48.8,34.2]; RRSI [90.5,89.2,40.7,52.3,37.9] for Harvey Evolve, Harvey ID Held-out, JobBench, GDPval, APEX.

18 benchmarks23 domains3Claude Opus 4.8 frozen policy4Held-out transfer

Section 07

What We Learned

07 WHAT WE LEARNED

RRSI improves held-out splits, with up to 4.7 points OOD and up to 22.9% over average prior baselines. The abstract reports 30% fewer policy tokens; the project page reports -36% tokens per trial. Naive evolution fails through benchmark fitting, noise chasing and complexity accumulation.

1Generalization2Cost control3Leakage prevention4Pruning

Section 08

What Came Next

08 WHAT CAME NEXT

The paper compares Meta-Harness, AHE, TTHE and HarnessX and cites prior harness-evolution and recursive-self-improvement work.

1Meta-Harness2AHE3TTHE4HarnessX

Section 09

Engineering Takeaways

ENGINEERING TAKEAWAYS

Keep evolution and evaluation separate; log harness diffs with score/cost deltas; add leakage checks; use conservative acceptance under stochastic evaluation; prune components whose contribution disappears. Watch memorization, noisy winners, tool bloat and rising token cost.

1Production2Trade-offs3Failure modes4Scaling

Formulas

Score and cost

S(H;mathcalD)=mathbbExsimmathcalDmathbbEtausimA(cdotmidx)[r(x,tau)],quadC(H;mathcalD)=mathbbExsimmathcalDmathbbEtausimA(cdotmidx)[c(tau)]S(H;\\mathcal{D})=\\mathbb{E}_{x\\sim\\mathcal{D}}\\mathbb{E}_{\\tau\\sim A(\\cdot\\mid x)}[r(x,\\tau)],\\quad C(H;\\mathcal{D})=\\mathbb{E}_{x\\sim\\mathcal{D}}\\mathbb{E}_{\\tau\\sim A(\\cdot\\mid x)}[c(\\tau)]

Expected task score and policy-token cost.

Aagent
Dtask set
Hharness
cpolicy-token cost
rreward
tautrajectory

Annealed edit budget

bt=leftlceilbmin+(bmaxbmin)cdottfrac12(1+cos(pit/T))rightrceilb_t=\\left\\lceil b_{min}+(b_{max}-b_{min})\\cdot\\tfrac12(1+\\cos(\\pi t/T))\\right\\rceil

Attributable edit budget decreases over rounds.

Ttotal rounds
tround
b_maxmaximum
b_minminimum

Cost-aware acceptance

DeltaC=frachatC(Hprime)hatC(Ht)hatC(Ht),qquadDeltaCleqbeta0+beta1DeltaS\\Delta C=\\frac{\\hat C(H^{\\prime})-\\hat C(H_t)}{\\hat C(H_t)},\\qquad \\Delta C\\leq\\beta_0+\\beta_1\\Delta S

Additional cost must be justified by score gain.

beta0base tolerance
beta1cost per gain
Delta Crelative cost change
Delta Sscore gain

Noise-adjusted floor

hatS(Hprime)geqSstardelta\\hat S(H^{\\prime})\\geq S^{\\star}-\\delta

Candidate must clear the empirical noise floor.

deltanoise band
S_starbest evolve score

Related Research

References