Paper Overview
Field: NLP Authors: 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 Lee Published: 2026-09-21 arXiv: 2609.24972
Background
An LLM agent's capability is largely magnified by its *harness* — the prompts, control flow, tooling, memory, and context management surrounding the frozen backbone model. Recent methods increasingly automate this process by iteratively proposing and selecting component-wise edits of an agent harness, practically establishing a form of recursive self-improvement (RSI) at the agent-system level.
The Problem
Such recursive evolution may overfit by memorizing the training tasks, showing large in-distribution gains that shrink or even vanish on out-of-distribution benchmarks.
The RRSI Method
RRSI incorporates the principles of regularization into harness self-improvement by constraining the evolution candidate proposal and selection process:
- Proposer: uses a time-annealed budget that limits the number of edits candidates can bundle, and encourages exploration of untaken paths based on evolution history.
- Selector: is equipped with a *critic* that filters benchmark-specific proposals, and a *pruner* that removes changes that are too small, too expensive, or no longer useful.
- Up to 14.1 points improvement on splits targeted by evolution
- Up to 4.7 points improvement on five out-of-distribution benchmarks
- Harnesses consume 30% less policy tokens than unregularized evolution
Together, these constraints favor reusable agent mechanisms over benchmark-specific ones or noise.
Results
Across eight benchmarks spanning coding, agentic workspace, and engineering design tasks:
Resources
Code: https://github.com/google-research/rrsi
---
*Auto-collected on 2026-09-23*