Learning the ARTS of Search for Automated Discovery
cs.AI, cs.CL
Submitted: 2026-06-20
Updated: 2026-08-26
Code: https://github.com/InternScience/MLEvolve
Project page: https://auto-discovery.github.io/arts
License: http://creativecommons.org/licenses/by/4.0/
The gist: Scientific discovery can be formulated as an iterative search process over the space of hypotheses and experiments.
Terminology
Abstract
Scientific discovery can be formulated as an iterative search process over the space of hypotheses and experiments. Contemporary methods navigate this space using heuristics such as MCTS. These algorithms conflate the merit of a hypothesis with the quality of its experimental execution. A promising hypothesis with preliminary execution is therefore ranked below a modest hypothesis whose execution is refined. Moreover, prior methods prune the search logs as the search progresses because the accumulated history outgrows the context window. We propose Agentic Reasoning for Tree Search (ARTS), where we deploy a reasoning language model to navigate this space. The model inspects prior execution logs, diagnoses whether earlier failures arose from faulty implementations or bad hypotheses, and selects the hypothesis to build on next. To mitigate challenges with context length, ARTS uses test-time training to instill the knowledge of search tree in the model weights. Across 22 tasks from MLGym and MLEBench, we show that ARTS outperforms leading algorithms, with over 15.3% relative improvement in the normalized score. With test-time training we show that a Qwen3-4B agent can match performance with closed-source frontier models like Gemini-3 Pro and GPT o3-reasoning with upto 5x lower inference cost. We further observe that on partially observable RL tasks, the test-time trained Qwen3-4B scientist surpasses ARTS with the o3 scientist by rediscovering the human-best recurrent-memory solution that heuristic methods prune away.
Sources
- Understanding LoRA as Knowledge Memory: An Empirical Analysis
- OpenAI Gym
- MLE-bench: Evaluating Machine Learning Agents on Machine Learning Engineering
- MARS: Modular Agent with Reflective Search for Automated AI Research
- SELA: Tree-Search Enhanced LLM Agents for Automated Machine Learning
- ARC Prize 2024: Technical Report
- FrontierMath: A Benchmark for Evaluating Advanced Mathematical Reasoning in AI
- Accelerating scientific discovery with Co-Scientist
- LLM-First Search: Self-Guided Exploration of the Solution Space
- RULER: What's the Real Context Size of Your Long-Context Language Models?
- AIDE: AI-Driven Exploration in the Space of Code
- ShinkaEvolve: Towards Open-Ended And Sample-Efficient Program Evolution
- The AI Scientist: Towards Fully Automated Open-Ended Scientific Discovery
- AlphaEvolve: A coding agent for scientific and algorithmic discovery
- GPQA: A Graduate-Level Google-Proof Q&A Benchmark
- Reflexion: Language Agents with Verbal Reinforcement Learning
- Towards Execution-Grounded Automated AI Research
- Learning to (Learn at Test Time): RNNs with Expressive Hidden States
- Amplifying human performance in combinatorial competitive programming
- Group-Evolving Agents: Open-Ended Self-Improvement via Experience Sharing
Related papers
- MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
- Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
- Agents' Last Exam
- The Clinician's Veto: Navigating Trust, Liability, and Uncertainty in Autonomous AI Prescribing
- MindHelper: Closed-Loop Embodied Mental-State Reasoning for Precision Intervention
- Incumbent Advantage: Brand Bias and Cognitive Manipulation Dynamics in LLM Recommendation Systems