RRSI treats harness search as training, and its noise floor is the cheapest piece to copy
Two accounts of the same paper disagree on the held-out score but agree on the mechanism your prompt optimizer is probably missing.
Each component maps to a familiar regularizer
RRSI leaves the edit space fully open. The optimizer may change any prompt, tool or control-flow step. The constraint is on how the search moves, and Alejandro Saucedo maps its three core components onto classic regularizers:
- Annealed edit budget behaves like learning-rate decay. Search starts with bundled edits and ends with single edits, so late changes stay attributable.
- Diff critic is a leakage audit. It reads each diff before scoring and rejects edits that encode task names or benchmark-specific answers.
- Pruner works like an L1 penalty. It flags components whose removal does not lower the score, which keeps token cost flat.
TheSequence's summary lists three more pieces: evidence-aware proposals, a cost rule, and a noise-adjusted acceptance floor. The floor rejects any edit whose gain is smaller than the eval's own run-to-run variance. It is the easiest piece to copy. Rerun the unchanged configuration about five times, estimate the standard deviation, and accept only edits that beat roughly twice that.
The small gap is the finding
Beyond the headline score, the two accounts differ on these details:
| Detail | Saucedo's account | TheSequence's account |
|---|---|---|
| Evolve-set gain | Smallest of the runs compared | +4.0 across 3 suites |
| Token savings | About a third per trial | ~36% fewer policy tokens per trial |
| Base model | Not stated | Frozen Claude Opus 4.8 |
| Benchmark count | Not stated | Described as eight, though 3 + 6 = 9 |
On TheSequence's figures, held-out gain trails evolve-set gain by only 0.6 points. Saucedo adds that RRSI had the smallest evolve-set gain of the runs compared and the best held-out average. That pattern is what regularization is supposed to produce. Seeds, variance and the unregularized held-out score are not in either writeup, so pull the paper's tables before any number reaches a design review.
The production version of the same loop
Anthropic ran the same structure at product scale in an agent-assisted sprint on claude.ai, per Architecture Notes. Over two weeks, time until a user can type on a fresh page fell from 3.1s to 0.55s at p75. Agents iterated against a benchmark, each change was checked against real user latency, and kept wins became CI checks. Humans rejected changes whose complexity outweighed the milliseconds saved.
The mapping onto RRSI is direct. The benchmark is the evolve set and real-user latency is the held-out set. The CI check locks in each gain, and the human veto plays the cost rule. Only p75 is reported, with no sample size or tail percentiles. And 3.1s to 0.55s is about a 5.6x improvement, not the ‘3x’ in the headline, so the two figures probably measure different things.
Will Larson's Software Factory experiment points at the next step: an agent that reads live metrics to choose its work. No results are reported. Once an agent picks work by a metric, that metric becomes its evolve set, and Goodhart's law (a measure that becomes a target stops being a good measure) applies to the dashboards.
The smart move
For every optimizer in use, report evolve gain minus held-out gain beside the score. If a tuned harness's lead shrinks on unseen data, its reported gains were in-sample noise. The check costs about a day and protects every decision built on that harness.
What to do
Re-score your current auto-tuned harness and its base version this sprint on a fresh slice the optimizer never touched. Use at least three seeds and bootstrap confidence intervals, and report the evolve-minus-held-out gap.
Add a noise-adjusted acceptance floor and a diff check to your prompt optimizer this sprint. Rerun the unchanged config five times to estimate σ, accept only edits above about 2σ, and reject diffs that contain task IDs or gold answers.
This quarter, route agent-proposed changes on one latency- or quality-sensitive surface through shadow-traffic validation and a CI regression gate, with thresholds set from measured run-to-run variance.