Authors: Thomas Simon Foster, Bassel Al Omari, Tingchen Fu, Thomas Mann, Carl Domond, Lucia Cipolina-Kun, Bhavul Gauri, Muna Aghamelu, Alexander D. Goldie, Eryk Helenowski, Jean-Christophe Gagnon-Audet, Alberto Pepe, Saba Nazir, Daniel Izcovich, Noam Levi, Rishi Hazra, Karen Hambardzumyan, Nicolas Baldwin, Xian Li, Martin Josifoski, Paris Giampouras, Masoud Jalili Sabet, Anya Sims, Hela Momand, Tatiana Shavrina, Despoina Magka, Jason Weston, Yulin Wang, Anirudh Goyal, João Henriques, Yoram Bachrach, Emily McMilin, Jakob Nicolaus Foerster
Organizations: FAIR at Meta · University of Oxford · University College London
AI research agents (AIRA) can now carry machine learning experiments from proposal through implementation and evaluation. Yet progress on frontier tasks is throttled by the cost of evaluations that can consume days of GPU time. When an agent can propose far more candidates than it can afford to run, progress depends on its research preference: how it allocates a fixed execution budget across many candidates. We introduce AI Research Preference Models (RPMs) that predict which candidate solution is most promising, without paying the cost of running them all. We build RPMs from frozen pretrained language models in two variants: an inference-only model that reasons over candidate plans, code, and previously executed solutions, and an agentic model that additionally runs small-scale pilot experiments. Integrated into the AIRA-dojo research agent and evaluated on the machine learning research benchmark AIRS-Bench, the two variants increase the average normalized score from 0.684 to 0.711 and 0.729, respectively. Both reach the unguided agent's 24-hour performance in roughly 15 hours, using less than two-thirds of its execution budget, and together yield new state-of-the-art results on two AIRS-Bench tasks.
Figures & tables
Figure 1: Overview of an AI research agent with Research Preference Model (RPM) augmented child creation. Each node represents a solution within the search tree, labeled with its evaluation score. The agent (1) selects a promising parent node from the active tree, (2) generates a batch of candidate child solutions, (3) utilizes the RPM to select the most promising candidate, using the full context of previously executed solutions and (4) executes and scores only the selected candidate to expand the tree, to reduce the compute overhead of running unpromising candidates ( Section 3.3 ).
Figure 2: Evaluation of RPM-augmented AIRA-dojo. Average normalized scores over time (left) and final performance (right) for AIRA-dojo with RPM-augmented child selection on AIRS-Bench , with error bars indicating the 95% confidence intervals. Dashed lines indicate the No-RPM baseline and immediate validation or test oracles. The Inference-only RPM (orange) yields steady gains over the baseline (yellow). While per-step proxy experiments slow its early trajectory, the Agentic RPM (green) leverages this compute overhead to surpass other methods.
Figure 3: Offline evaluation of Inference-only RPM scaling properties. Increasing search-tree context provided gives improved predictive accuracy (left). Allocating a higher reasoning budget yields better selection (middle). Expanding the candidate suggestion pool reliably improves both the oracle-selection limit and the RPM’s selection performance (right), measured by the average difference between the selected solution’s score and the average score of all candidates.
Figure 4: What strategy the Agentic RPM uses. The Agentic RPM frequently runs simplified versions of the original candidates. Agents save time by running reduced cross-validation split counts (left) and sub-sampling the training data (middle). Both agents employ similar training adaptations, such as removing ensembling, reducing epochs and lowering the batch size.
Figure 5: How the Agentic RPM’s strategy affects performance. Increasing the time budget leads to better performance, but with diminishing returns (leftmost). Using more cross-fold validation splits does not correlate with better selection accuracy (middle left). Using full data brings an advantage over using sub-sampled data (middle right). Most training adaptations improve selection accuracy, except for the removal of the learning rate scheduler and simplification of the data augmentation approach (rightmost).
Appendix figures & tables7 assets
Supplementary material from the paper’s appendix.
Appendix
Model
Accuracy (%)
GPT-5
64.66
Claude Opus 4.8
67.44
Gemini 3.1 Pro
67.40
Ensembling (majority vote)
68.04
Ensembling (arbiter, Claude 4.8)
69.35
Appendix
Table 1: Selection accuracy of the Inference-only RPM across different LLM backbones and ensembling configurations
Figure 9: Reasoning category frequency and selection accuracy impact. Mention frequency of reasoning categories across reasoning traces (left) and resulting selection accuracy when mentioned versus omitted (right). Citing correctness, pretrained backbones, or prior evidence improves accuracy, whereas citing architecture alone degrades performance.
Figure 10: Context citation frequency and selection accuracy impact. Mention frequency of distinct context metrics across reasoning traces (left) and resulting selection accuracy across citation counts (right). Selection accuracy increases monotonically as more context metrics are cited.
Figure 11: The performance of three ablation variants at offline evaluation using GPT-5 (leftmost) and their average tool calling count of bash (middle left), python (middle right), submit_solution (rightmost). bash is seldom used by any variant. The w/o feedback variant calls python and submit_solution more frequently than other variants.
Figure 12: The average execution time distribution of pilot experiments across offline evaluations. Compared with w/o overstating variant (left) and w/o feedback variant (middle), the original Agentic RPM produces more time-consuming pilot experiments. Without GPU access (right), the average execution time is further increased.
Figure 16: Selection Advantage vs. Final Normalized Score. Final normalized score plotted against step-wise selection advantage across individual seed runs. Large diamonds denote mean values ( ±95% CI). Selection advantage strongly correlates with end-to-end performance (Pearson r=0.55,p=0.0007 ; Spearman ρ=0.56,p=0.0004 ), with Agentic RPM achieving both higher selection advantage and final score than Inference-only RPM and Random selection.
Figure 18: Final Node Selection performance across candidate pool sizes. Average normalized test score as a function of the top- N validation candidate pool size. Inference-only RPM judges (GPT-5 and Qwen3.6-27B) beat random selection but degrade as N increases, becoming progressively worse than the Validation Oracle (AIRA-dojo’s default selection strategy). The Inference-only RPM with the stronger GPT-5 LLM backbone outperforms that with the Qwen backbone.
AI research agents automate the cycle of proposing, implementing, and evaluating experiments, opening a path toward recursive self-improvement. Yet their ability to propose experiments outpaces their capacity to execute them in real environments, making outcome prediction a key capability for sustained self-improvement under limited experimental budgets. We investigate language models as Research World Models (RWMs), which predict the outcomes of candidate interventions across research environments. Our evaluation draws on over 2,600 experimental records from nine research environments spanning pretraining, post-training, and inference, representing more than 171,000 H100 GPU-hours of experimentation. Research knowledge acquired from real experimental experience improves RWM predictions of unseen interventions within the same environment (Spearman +0.27), and can be reused across environments. For example, using only pretraining experience from OLMo3, Marin, and Nanochat, an RWM reduces selection regret in the Qwen3 environment by 78% compared with zero-experience setting. These benefits extend to multi-round Autoresearch under a fixed selection budget: RWMs with in-env and cross-env research knowledge increase the best gain achieved by 15.8% and 11.6%, respectively. Ablations across 13 language models used as RWMs show that adding research knowledge can improve intervention ranking more than changing models or increasing reasoning effort alone. These findings support language models as RWMs and motivate accumulating experimental data for future RWM training.
Existing research has identified three structural performance bottlenecks in AI research agents: (1) synchronous single-GPU execution constrains sample throughput, limiting the benefit of search; (2) a generalization gap where validation-based selection causes overfitting and performance to degrade over extended search horizons; and (3) the limited capability of fixed, single-turn LLM operators imposes a ceiling on search performance. We introduce AIRA2, which addresses these bottlenecks through three architectural choices: an asynchronous multi-GPU worker pool that increases experiment throughput linearly; a Hidden Consistent Evaluation protocol that delivers a reliable evaluation signal; and ReAct agents that dynamically scope their actions and debug interactively. On MLE-bench-30, AIRA2† achieves a mean Percentile Rank of 81.5% at 24 hours and 83.1% at 72 hours, outperforming the strongest baseline, which achieves 72.7%. On AIRS-Bench, AIRA2 exceeds human state-of-the-art on 6 out of 20 diverse research tasks. Ablations confirm that each architectural component is necessary, that performance follows a predictable scaling law that transfers across LLM backbones, and that the "overfitting" reported in prior work was driven by evaluation noise rather than true data memorization.
Karen Hambardzumyan, Nicolas Baldwin, Edan Toledo +22
FAIR at Meta · University College London · University of Oxford
Evaluating research ideas generated by LLMs is difficult because their scientific value cannot be fully determined by objective criteria, and no single reference answer specifies what counts as a good idea. To address this challenge, we introduce Ideation Arena, a battle style platform that evaluates research ideas through pairwise human assessment. Ideation Arena evaluates ideas generated by 14 frontier LLMs and 5 research agent architectures built on 2 base models. To ensure a common starting point, Ideation Arena builds shared literature contexts from papers familiar to the participating researchers and provides the same contexts to all LLMs and agents. We collect over 6,000 double blind pairwise comparisons from 105 active computer science researchers and construct an Elo rating leaderboard of proposal-stage expert preferences in computer science under a shared closed-context protocol. We validate the rankings through interrater agreement and robustness analyses, showing that the leaderboard remains stable under changes in annotator composition and domain coverage. Our results show substantial variation in agent effectiveness, with some frameworks improving ideation quality over their backbones and others offering little benefit or even underperforming their base models. We further construct Ideation Arena Eval, a benchmark for assessing whether automated evaluators align with human preferences in research ideation. Experiments with current LLM judges show that they still cannot reliably reproduce expert preferences, with the best judge reaching 72.56% Soft Accuracy on Overall Quality. Our code, data, and leaderboards are available at https://github.com/foss12138/Research-Ideation-Arena.
Zhiyu Chen, Keyu Zhao, Jigao Fu +8
1Fudan University · 3Tsinghua University · 4Zhongguancun Institute of Artificial Intelligence +1