Bilevel Autoresearch: Meta-Autoresearching Itself
Yaonan Qu, Meng Lu

TL;DR
This paper introduces Bilevel Autoresearch, an LLM-based framework that autonomously optimizes its own search mechanisms, leading to significant improvements in autoresearch tasks without human intervention.
Contribution
It presents a novel bilevel framework where an outer LLM loop meta-optimizes the inner autoresearch loop by generating code, enabling autonomous discovery of effective search strategies.
Findings
5x improvement on GPT pretraining benchmark
Outer loop discovers mechanisms like optimization and bandits autonomously
Meta-autoresearch outperforms standard inner loop without human-designed mechanisms
Abstract
If autoresearch is itself a form of research, then autoresearch can be applied to research itself. We take this idea literally: we use an autoresearch loop to optimize the autoresearch loop. Every existing autoresearch system -- from Karpathy's single-track loop to AutoResearchClaw's multi-batch extension and EvoScientist's persistent memory -- was improved by a human who read the code, identified a bottleneck, and wrote new code. We ask whether an LLM can do the same, autonomously. We present Bilevel Autoresearch, a bilevel framework where an outer loop meta-optimizes the inner autoresearch loop by generating and injecting new search mechanisms as Python code at runtime. The inner loop optimizes the task; the outer loop optimizes how the inner loop searches. Both loops use the same LLM -- no stronger model is needed at the meta level. On Karpathy's GPT pretraining benchmark, the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScientific Computing and Data Management · Machine Learning in Materials Science · Machine Learning and Algorithms
