Skip to main content

byEmulated

Autoresearch
Bench

Evaluating language model agents
on long-horizon autonomous research

Autoresearch Bench

A benchmark for agents that run experiments, learn from feedback, and keep improving a solution.

Ryan
Emulated
Sid Patllollu
Emulated
Joseph Wang
Emulated
Amit Prakash
Emulated
Lalithadithya N
Emulated

Background

Many research problems are solved through a series of experiments. You change a solution, measure what happened, and use the result to decide what to try next. A good result often leads to another experiment rather than a clear finish. For example, making a model faster does not end when one implementation beats a baseline. A researcher can profile the new bottleneck, change the system again, and measure another improvement. There may be no known best implementation or obvious point at which the problem is solved.

Autoresearch Bench, or AR Bench, tasks agents with research problems that have this structure. Each task provides a prepared workspace, a measurable objective, and tools for running experiments. The agent can evaluate a solution, learn from the result, and continue improving it. A separate verifier grades the final artifact. No model judge is used in the reward path.

The tasks span scientific research, inference, training, optimization, AI safety, interpretability, and data. These views can overlap. A task about attribution, for example, can count toward both interpretability and optimization.

The suite builds on work that evaluates agents in executable software and machine-learning environments, including SWE-bench, MLE-bench, RE-Bench, and PaperBench [1, 2, 3, 4]SWE-bench: Can Language Models Resolve Real-World GitHub Issues?Carlos E. Jimenez, John Yang, Alexander Wettig, et al.arxiv.orgMLE-bench: Evaluating Machine Learning Agents on Machine Learning EngineeringJun Shern Chan, Neil Chowdhury, Oliver Jaffe, et al.arxiv.orgRE-Bench: Evaluating Frontier AI R&D Capabilities of Language Model Agents Against Human ExpertsHjalmar Wijk, Tao Lin, Joel Becker, et al.arxiv.orgPaperBench: Evaluating AI's Ability to Replicate AI ResearchGiulio Starace, Oliver Jaffe, Dane Sherburn, et al.arxiv.org.

Leaderboard

Results are reported for the model and agent harness together. Use the selector to view the overall ranking or a particular area of the benchmark.

Results for
Pareto frontier
Qwen
Qwen
Qwen
Figure 1. Performance and cost improve along different paths. Each point is a model release, and lines connect releases in the same model family by date. Larger markers distinguish families without relying on color alone. The dashed line is the Pareto frontier: no cheaper model has an equal or higher score.

The chart shows the tradeoff between result quality and the cost of obtaining it. Family lines show how related model releases move over time. The frontier highlights the models that offer the strongest score at a given cost. The leaderboard below gives the corresponding values and ranking directly.

Results for
1

Claude Fable 5

Claude Code0.742$21.635
2

Claude Opus 5

Claude Code0.731$11.845
3

GPT-5.6 Sol

Codex0.719$6.465
4

GLM-5.3

Claude Code0.697$3.995
5

Gemini 3.7 Flash

Gemini CLI0.684$2.185
6

Claude Opus 4.8

Claude Code0.672$13.525
7

GPT-5.6 Luna

Codex0.661$0.615
8

Kimi K3

Kimi CLI0.649$4.655
9

Claude Sonnet 5

Claude Code0.638$5.425
10

GPT-5.6 Terra

Codex0.626$2.945
11

Gemini 3.6 Flash

Gemini CLI0.614$1.655
12

GPT-5.5

Codex0.601$7.235
13

Grok 4.6

Grok CLI0.588$5.505
14

Grok 4.5

Grok CLI0.571$4.825
15

GLM-5.2

Claude Code0.556$3.215
16

Claude Opus 4.7

Claude Code0.542$14.475
17

Claude Sonnet 4.6

Claude Code0.529$4.185
18

Gemini 3.1 Pro

Gemini CLI0.514$3.765
19

Qwen3.8 Max

Qwen Code0.498$3.185
20

Qwen3.8 27B

Qwen Code0.479$1.125
21

Qwen3.6 Plus

Qwen Code0.458$0.825
22

DeepSeek V4 Pro

Claude Code0.437$2.345
23

Kimi K2.6

Kimi CLI0.416$2.585
24

Kimi K2.5

Kimi CLI0.391$1.915
25

Composer 2.5

Cursor CLI0.362$10.205

The full leaderboard ranks every model on the tasks with graded runs, by mean or best reward, and can be filtered by area.

Results

Figure 2 shows 39 development episodes across the eleven competition environments. These runs show how agents used feedback and changed their solutions. They are separate from the model results summarized in the leaderboard.

Benchmark
opus-4.8, baseline loopopus-5, baseline loopopus-5, git loop and clock
reward floor, no trainingbudget
Figure 2. Agents improve a solution through three different feedback signals. Choose a task and a signal. Local validation is the agent's own experimental measure. The public score is feedback from a scored submission. The private score is hidden and determines reward. Steps mark submissions that improved the running public best; crosses mark submissions that did not. The pooled view uses each task's floor-to-ceiling normalization because the raw metrics are not comparable. GNSS local validation is unavailable because that campaign was recovered without its agent workspace.

The three signals often disagree. The agent has to decide which local result to trust, when to spend a submission, and whether a public improvement is likely to hold on the hidden split.

Tasks

Tasks are listed below with their area and the best graded run so far. They include research-code optimization, model inference, model training, and scientific problems in biology, medicine, climate, geospatial modeling, and computer vision. Some tasks also appear in additional leaderboard views when they measure more than one capability.

Attribution sweep speedup

Make the backward sweep of our circuit-tracing library substantially faster on CPU, with every attribution graph exactly unchanged.

Optimization
avg 0.72 · best 0.95Claude Opus 4.8

Exact speculative decoding speedup

Make Qwen3.5-9B decode substantially faster with its own multi-token-prediction head, without changing a single emitted token.

Inference
avg 0.77 · best 0.80Claude Opus 4.8

DBSCAN clustering speedup

Build a fast torch-native 2D DBSCAN from a written spec, with hidden datasets matched exactly against a reference engine.

Optimization
avg 0.60 · best 1.00Claude Fable 5

Triton training-kernel speedup

Make a training codebase measurably faster by writing Triton kernels for its hot paths, without changing what it computes.

Optimization
avg 0.83 · best 1.00Claude Opus 4.8

Degraded-document OCR

Train an OCR model for degraded text from scratch on CAPTCHA corpora generated inside the offline environment.

Classical ML
avg 0.60 · best 0.64Claude Opus 5

Diffusion checkpoint reconstruction

Reconstruct a hidden Stable Diffusion checkpoint by merging three given checkpoints to match its image-generation behavior.

LLM training
avg 0.17 · best 0.25Claude Opus 5

rav1d decoder performance

Close the decode-performance gap between the memory-safe Rust AV1 decoder and its hand-optimized C original.

Optimization
avg 0.56 · best 0.82Claude Opus 5

Cell instance segmentation

Build a model that predicts a mask for every cell in light-microscopy images, graded on a sealed private split with a submission quota.

Scientific ML
avg 0.34 · best 0.47Claude Opus 5

Pasture biomass regression

Predict five dry-biomass components from top-view pasture photos.

Scientific ML
avg 0.61 · best 0.65Claude Opus 5

Copy-move forgery detection

Classify images as authentic or manipulated and segment every duplicated region.

Scientific ML
avg 0.60 · best 0.62Claude Opus 5

Smartphone GNSS positioning

Recover a phone's driving track from raw multi-constellation GNSS measurements.

Scientific ML
avg 0.57 · best 0.61Claude Opus 5

Freezing-of-gait detection

Detect freezing-of-gait events at every timestep of lower-back accelerometer recordings.

Scientific ML
avg 0.38 · best 0.39Claude Opus 5

Contrail segmentation

Segment aviation contrails in nine-channel infrared satellite frames.

Scientific ML
avg 0.60 · best 0.62Claude Opus 5

Single-cell modality prediction

Predict one single-cell measurement modality from another.

Scientific ML
avg 0.37 · best 0.38Claude Fable 5

RNA 3D structure prediction

Predict five candidate 3D structures per RNA sequence, scored best-of-five.

Scientific ML
avg 0.33 · best 0.48Claude Opus 5

ECG image digitization

Reconstruct twelve ECG traces from a photographed or scanned printout.

Scientific ML
avg 0.12 · best 0.13Claude Opus 5

Scientific image forgery detection

Find and segment copy-moved regions in biomedical research images.

Scientific ML
avg 0.36 · best 0.46Claude Opus 5

Each task links to a page with its background, task contract, evaluation, results, and available experiment curves.

Evaluation and methodology

Each task uses a direct measure of the work, such as speedup, predictive accuracy, or positioning error. Where correctness or output fidelity is essential, those checks must pass before performance contributes to the score. Each task page documents its exact metric, gates, normalization, and selection rule.

The agent works in an isolated workspace on an external dev box, where it can edit its solution, run experiments, and compute its own local score as often as the task allows. It sees the task contract, the local benchmark, and the required output format. It has no general internet access, and hardware and wall-clock limits are fixed per task and recorded with every result.

The run ends with a saved artifact. A separate verifier grades that artifact after the fact, using hidden data and the task's versioned grading contract. Hidden grading changes the seeds, fixtures, or dataset split, but never introduces new requirements, and no model judge sits anywhere in the reward path. Competition-style tasks add one more signal: a public split the agent can submit against during the run for visible feedback. The private split is never shown to the agent and determines the final result.

Many tasks do not have a known best solution. A strong reference solution calibrates the score but does not act as a ceiling, so improvements above it remain distinguishable.

How to interpret scores

The aggregate score supports comparison, but it does not replace per-task results. These environments measure whether an agent can execute an iterative research process inside a prepared problem. They do not measure research-question selection, literature review, or whether a question is worth pursuing.

A score belongs to the model and agent harness together. Each result should include the number of runs, aggregation rule, per-task scores, compute environment, verifier receipts, and any result-specific caveats.

Acknowledgements and citation

We thank the task authors and environment contributors who turned research problems into reproducible evaluations. We also thank the maintainers of the open-source libraries, models, and datasets on which the task environments depend. Their work makes it possible to evaluate agents against direct, domain-specific measures rather than model-based judgments.

If you use Autoresearch Bench, cite this post as:

bibtex
@misc{emulated2026autoresearchbench,
  title        = {Autoresearch Bench: Evaluating Agents on Iterative Research Tasks},
  author       = {{Emulated}},
  year         = {2026},
  howpublished = {Autoresearch Bench},
  url          = {https://github.com/Hyperfocal-AI-Miscellaneous/singularity-bench-v1}
}
@misc{emulated2026autoresearchbench,
  title        = {Autoresearch Bench: Evaluating Agents on Iterative Research Tasks},
  author       = {{Emulated}},
  year         = {2026},
  howpublished = {Autoresearch Bench},
  url          = {https://github.com/Hyperfocal-AI-Miscellaneous/singularity-bench-v1}
}

References

  1. Carlos E. Jimenez, John Yang, Alexander Wettig, et al. (2024). SWE-bench: Can Language Models Resolve Real-World GitHub Issues?. ICLR 2024. arxiv.org/abs/2310.06770
  2. Jun Shern Chan, Neil Chowdhury, Oliver Jaffe, et al. (2024). MLE-bench: Evaluating Machine Learning Agents on Machine Learning Engineering. ICLR 2025. arxiv.org/abs/2410.07095
  3. Hjalmar Wijk, Tao Lin, Joel Becker, et al. (2024). RE-Bench: Evaluating Frontier AI R&D Capabilities of Language Model Agents Against Human Experts. ICML 2025. arxiv.org/abs/2411.15114
  4. Giulio Starace, Oliver Jaffe, Dane Sherburn, et al. (2025). PaperBench: Evaluating AI's Ability to Replicate AI Research. arXiv:2504.01848. arxiv.org/abs/2504.01848