hiw3c AI 日报
MarkTechPost RSS 全文

谷歌研究开放源RSSI:人工智能代理可以在不过度匹配的情况下改善自己的工作空间

原文标题 · Google Research Open-Sources RRSI: AI Agents That Improve Their Own Harness Without Overfitting

谷歌云人工智能研究中心开放了开源的RSSI,这是一个框架,可以让LLM代理重写自己的提示、工具和内存,同时模型权重保持冻结。它添加了泄漏批评者、噪音下限、成本规则和修剪,以便收益能够延续到新任务中。Claude Opus 4.8,Terminal-Bench 2.1从74.2%上升到80.2%,所有6个搁置的分裂都有所改善。谷歌研究开放源RSSI:在不过度匹配的情况下改善自己的工作空间的人工智能代

来源:MarkTechPost · www.marktechpost.com

正文为英文,可一键机器翻译(仅首次需要等待)

Google Cloud AI Research, with UNC-Chapel Hill, Stanford and Washington University in St. Louis, has released RRSI (Regularized Recursive Self-Improvement). It lets an LLM agent rewrite its own harness: prompts, tools, memory, control flow and sub-agents. Model weights never change. RRSI constrains the improvement loop itself, so gains hold on benchmarks the agent never optimized against.

Deployable? Yes, as a research framework. The code is Apache 2.0, needs Python 3.10+, and accepts any LiteLLM model string. Defaults assume Claude Opus 4.8 on Vertex AI.

Why Self-Improving Harnesses Overfit

Harness evolution loops propose edits, score them on a fixed evolve set and keep the winner. The same tasks are reused every round, so the loop can memorize them. The RRSI research names 3 failure modes: benchmark-specific fitting, noise chasing and complexity accumulation. Each one widens the gap between evolve-set scores and real transfer.

How RRSI Works

RRSI keeps every harness component editable. It regularizes how the search moves instead.

Proposal side

  • Annealed edit budget: a cosine schedule lets early rounds bundle several edits. Late rounds allow a single attributable change.
  • Evidence-aware credit: each candidate is logged with its component, hypothesis, diff, score change and cost change. The proposer reads this ledger, so falsified ideas are not retried.
  • Structured exploration: when progress stalls inside the noise band, budget shifts to components the run never touched.

Selection side

  • Leakage critic: rejects task names, entities, answers or benchmark-specific logic before any scoring.
  • Noise-adjusted floor: gains must clear the variance measured on the unchanged base harness.
  • Cost rule: extra inference tokens must be paid for by measured gain.
  • Pruning: components that stop producing gains become deletion targets.

The research team frame these as analogies to classic regularizers. The edit budget maps to L0, pruning to Lasso (L1) and the cost rule to Ridge (L2).

Results Across 8 Benchmarks

All 6 held-out splits improved. With Gemini 3.5 Flash as the policy, Terminal-Bench 2.1 rose from 64.6 to 78.7. SWE-bench Verified rose from 76.8 to 79.0.

The harness is also lighter. On the agentic workspace instance, RRSI uses 2.42M policy tokens per trial. Unregularized evolution uses 3.80M. The abstract reports this as 30% fewer; the project page says 36%.

RRSI vs Closest Competitors

Scores come from Table 1 of the RRSI research paper. All methods share the same starting harness, policy, evolve split and candidate budget.

FeatureRRSIMeta-HarnessAHETTHEHarnessX
Core ideaRegularized proposal and selectionAgentic proposer over code, scores and traces of all prior candidatesObservability-driven loop; edits paired with verified predictionsEvolves harness during test time, no gold labelsModular typed primitives, trace-driven adaptation
Model weightsFrozenFrozenFrozenFrozenFrozen
Cost rule and pruningYesNo*No*No*No*
Harvey LAB evolve score90.593.090.791.191.8
OOD average (H0 = 39.7)43.640.639.238.039.7

*Per the RRSI research team. OOD average is the mean of JobBench, GDPval and APEX-Agents, computed from Table 1.

Meta-Harness leads on the Harvey LAB evolve split. RRSI has the smallest evolve gain but the only OOD average more than 1 point above H0.

Interactive Explainer

How RRSI Regularizes Agent Self-Improvement

The model stays frozen. The harness (prompts, tools, memory, control flow) evolves, but every edit must pass the regularizers.
1. Run a round 2. Edit budget 3. Acceptance gate 4. Results
Pick a candidate edit, then press Run. Watch where RRSI stops it.
Generic tool fix Hardcoded task name Gain inside noise Token-hungry gain Stale component ▶ Run
ProposerReads full edit ledger, shrinking edit budget
Leakage criticScreens diff before scoring
EvaluateRun on evolve set
GateNoise floor + cost rule
Harness Ht+1Accepted, then pruning check
Candidates are illustrative. The rules they hit are the ones described in the RRSI paper.
// edit ledger: component | hypothesis | Δscore | Δcost | verdict
bt = ⌈ bmin + (bmax − bmin) · ½(1 + cos(πt / T)) ⌉
bmax (edits per candidate, early) 5 bmin (edits per candidate, late) 1 T (rounds) 16 Early rounds may bundle coordinated edits to find a mechanism. Late rounds get single, attributable changes.
round 0round T−1
Cosine schedule from the paper (Eq. 4). Slider values are for exploration; the paper lists its own settings in Appendix D.
ΔS, score gain vs incumbent (pts) 2.0 ΔC, token cost change (%) 20 δ, noise band from repeated base runs (pts) 1.5 β0 + β1ΔS cost allowance: β1 (% per pt) 8
?Noise-adjusted floor: score must not drop more than δ below the best so far
?Clear gain: ΔS > δ, otherwise the paper’s within-band rule applies
?Cost rule: ΔC ≤ β0 + β1ΔS
…
Illustrative thresholds (β0 fixed at 5% here). In RRSI, δ is estimated on the unchanged base harness and β values are tuned on the evolve set, then frozen.
All 8 benchmarks vs prior methods Token cost
Data: RRSI paper · GitHub · project pageBuilt by Marktechpost
&