Benchmarking Large Language Models as AI Research Agents
Qian Huang, Jian Vora, Percy Liang, Jure Leskovec
OpenReview ground truth
TL;DR — we propose MLAgentBench, the first benchmark for evaluating AI research agents capable of open-ended decision-making on ML research tasks, as well as a prototype LLM-based research agent.
Abstract
Human researchers can perform scientific experimentation loops – planning, experimenting, observing the results, and generating inferences. Can we build AI research agents to perform the same? To take a step towards building and evaluating research agents capable of such open-ended decision-making, we focus on the problem of having agents perform machine learning (ML) tasks given a research problem description and dataset. In this paper, we propose MLAgent- Bench, a suite of ML tasks for benchmarking AI research agents. Agents can perform actions like file system operations, executing code, and inspecting outputs. With these actions, agents could run experiments, analyze the results, and modify the code of entire machine learning pipelines, such as data processing, architecture, training processes, etc. The benchmark then automatically evaluates the agent’s performance objectively over various metrics related to performance and efficiency. We also design an LLM-based research agent to automatically perform experimentation loops in such an environment. Empirically, we find that a GPT-4- based research agent can feasibly build compelling ML models over many tasks in MLAgentBench, displaying highly interpretable plans and actions. However, the success rates vary considerably; they span from almost 90% on well-established older datasets to as low as 10% on recent Kaggle Challenges – unavailable during the LLM model’s pretraining – and even 0% on newer research challenges like BabyLM. Finally, we identify several key challenges for LLM-based research agents such as long-term planning and hallucination. Our code is released at https://anonymous.4open.science/r/MLAgentBench/.
Author context
Most prolific author: 7 submissions (credibility 1.00).
No mass-submission penalty for this paper (authors within normal submission volume).
Aggregate statistics only — no individual author rankings.
Ranking trajectory
Percentile by tournament round — convergence indicates rating stability.
Battle history — 34 comparisons
Ranked above opponent in 41% of matchups.
- ▼ lost to Coupling Fairness and Pruning in a Single … ×6
- ▼ lost to BWS: Best Window Selection Based on Sample… ×6
- ▼ lost to Consistency Models as a Rich and Efficient… ×6
- ▼ lost to The LLM Surgeon ×4
- ▼ lost to WebArena: A Realistic Web Environment for … ×4
Judge assessments
Mean overall score 0.0 ± 0.0 (n = 34)