DuoDiscover

Scaling autonomous discovery
beyond the evaluation bottleneck.

Google UC Berkeley Stanford University

DuoDiscover’s three mechanisms

FIRST
Co-discover a target
and its yardstick
each agent picks what to optimize and builds a proxy that scores an edit in seconds
SECOND
Keep the yardstick honest
fidelity tests invalidate a yardstick once it stops ranking edits like the true objective; every gain is confirmed on the true evaluation
THIRD
Scale as a bottom-up fleet
a lightweight orchestrator spawns, terminates, and briefs agents, and seeds new agents with others’ confirmed work

Abstract

Evaluation has been central to advances in AI, and it is equally critical to autonomous discovery. Yet scaling autonomous discovery to real-world engineering challenges faces a fundamental bottleneck: the cost of evaluating progress. In real settings, a single true evaluation, such as a full benchmark or serving trace, can take hours, so a search can afford only a handful of true evaluations. We present DuoDiscover, a search system that jointly discovers what to optimize and how to evaluate progress efficiently, through three mechanisms. First, each worker in a fleet of coding agents co-discovers an optimization target and a fast, tailored proxy evaluator, which we call a yardstick. The agent then hill-climbs the yardstick rather than the true evaluation. Second, since search can exploit gaps between a yardstick and the true objective, fidelity tests continually recheck each yardstick’s ranking and invalidate any that drift. Third, the fleet is bottom-up, with no central decomposition of the problem. A lightweight orchestrator spawns and terminates agents, briefs running ones, and seeds new agents with others’ confirmed work. DuoDiscover enables autonomous optimization from software to chip architecture.

Highlights

#1
NVIDIA’s B200 leaderboard
121 of 235 kernels*
0.00×
real Python repos · 15 min per true eval
human experts: 6.90×
0.00×
~85 min per true eval
Claude Code: 1.07×
+0.0%
up to 28 h per true eval
best human design: +3.5%
0.00×
~70 min per true eval
Claude Code: 1.05× · merged PR ↗
0.0×
faster than Claude Code
same score · 2.8 h vs 8 h
13 vs 76 evals · $80 vs $309

* Leaderboard standings as of Sep 10, 2026.

Authors

Shubham Agarwal★1,2, Akshat Gupta★1,2, Mike Heddes★1, Dilara Soylu★1,3
Rui Meng1, Patrick Tser Jern Kon1, Jiefeng Chen1, Mert Cemri1,2, Shu Liu2, Abe Gonzalez1, Akanksha Jain1, Bhavana Dalvi Mishra1, Linfeng Song1, Vilobh Meshram1, Xiangru Tang1, Jinsung Yoon1, Aditya Parameswaran2, Ion Stoica2, Vahab Mirrokni1, Burak Gokturk1, Parthasarathy Ranganathan1, Tomas Pfister1
Nanyun Peng◆1 and Chun-Liang Li◆1
1Google  ·  2UC Berkeley  ·  3Stanford University
★Equal contribution, ordered alphabetically. ◆Co-last authors.

BibTeX

@misc{duodiscover2026,
  title         = {DuoDiscover: Scaling Autonomous Discovery Beyond the Evaluation Bottleneck},
  author        = {Shubham Agarwal and Akshat Gupta and Mike Heddes and Dilara Soylu and Rui Meng and Patrick Tser Jern Kon and Jiefeng Chen and Mert Cemri and Shu Liu and Abe Gonzalez and Akanksha Jain and Bhavana Dalvi Mishra and Linfeng Song and Vilobh Meshram and Xiangru Tang and Jinsung Yoon and Aditya Parameswaran and Ion Stoica and Vahab Mirrokni and Burak Gokturk and Parthasarathy Ranganathan and Tomas Pfister and Nanyun Peng and Chun-Liang Li},
  year          = {2026},
  url           = {https://arxiv.org/abs/2610.17184},
  note          = {Dilara Soylu*, Mike Heddes*, Akshat Gupta*, Shubham Agarwal* contributed equally to this work.}
}