Toward Generalist Autonomous Research via Hypothesis-Tree Refinement
- URL: http://arxiv.org/abs/2606.11926v1
- Date: Wed, 10 Jun 2026 10:57:05 GMT
- Title: Toward Generalist Autonomous Research via Hypothesis-Tree Refinement
- Abstract summary: We introduce Arbor, a framework for autonomous research that combines a long-lived coordinator, short-lived executors, and Hypothesis Tree Refinement (HTR)<n>As results return, Arbor updates the tree, propagates reusable lessons, refines the search frontier, and admits verified improvements.
- Score: 150.99641031769633
- License: http://creativecommons.org/licenses/by-sa/4.0/
- Abstract: Scientific progress depends on a repeated loop of exploration, experimentation, and abstraction. Researchers test candidate directions, interpret the evidence, and carry the resulting lessons into later attempts. We study how an AI agent can run this loop autonomously over long horizons. We introduce Arbor, a general framework for autonomous research that combines a long-lived coordinator, short-lived executors, and Hypothesis Tree Refinement (HTR), a persistent tree that links hypotheses, artifacts, evidence, and distilled insights across time. The coordinator manages global research strategy over the tree, while executors implement and test individual hypotheses in isolated worktrees. As results return, Arbor updates the tree, propagates reusable lessons, refines the search frontier, and admits verified improvements. This design turns autonomous research from a sequence of local attempts into a cumulative process in which strategy, execution, and evidence are carried across time. We evaluate Arbor under Autonomous Optimization (AO), an operational setting where an agent improves an initial research artifact through iterative experimentation without step-level human supervision. Across six real research tasks in model training, harness engineering, and data synthesis, Arbor achieves the best held-out result on all six tasks, attaining more than 2.5x the average relative held-out gain of Codex and Claude Code under the same task interface and resource budget. On MLE-Bench Lite, Arbor reaches 86.36% Any Medal with GPT-5.5, the strongest result in our comparison.
Related papers
- Arbor: Tree Search as a Cognition Layer for Autonomous Agents [11.049500825171245]
Arbor is a multi-agent framework that introduces structured tree search as a cognition layer for autonomous agents.<n>Arbor generalizes to multiple generations of hardware platform, and run-to-run variance is within 2 percentage points demonstrating that the method is hardware-agnostic and reproducible.
arXiv Detail & Related papers (2026-06-10T18:14:56Z) - Act As a Real Researcher: A Suite of Benchmarks Evaluating Frontier LLMs and Agentic Harnesses in Research Lifecycle [16.040691949938203]
We propose the AARR (Act As a Real Researcher) benchmark series.<n>AARR focuses on whether agents can emulate the professionalism, thoroughness, and nuanced reasoning that characterize human researchers.<n>Our results indicate that developing researcher-like AI requires further exploration of research behavior.
arXiv Detail & Related papers (2026-06-05T17:13:36Z) - DuMate-DeepResearch: An Auditable Multi-Agent System with Recursive Search and Rubric-Grounded Reasoning [58.09293442211248]
Deep Research (DR) has emerged as a new agentic paradigm to tackle complex, open-ended research tasks.<n>This report presents DuMate-DeepResearch, a multi-agent DR framework built on the Qianfan Agent Foundry.
arXiv Detail & Related papers (2026-06-05T14:10:48Z) - AutoResearchClaw: Self-Reinforcing Autonomous Research with Human-AI Collaboration [175.74514061083195]
We present AutoResearchClaw, a multi-agent autonomous research pipeline built on five mechanisms.<n>On ARC-Bench, a 25-topic experiment-stage benchmark, AutoResearchClaw outperforms AI Scientist v2 by 54.7%.
arXiv Detail & Related papers (2026-05-19T15:49:51Z) - SynPlanResearch-R1: Encouraging Tool Exploration for Deep Research with Synthetic Plans [65.19021035010059]
Research Agents enable models to gather information from the web using tools to answer user queries.<n>We observe that agents often exhibit poor exploration behaviors, including premature termination and biased tool usage.<n>We propose SynPlanResearch-R1, a framework that synthesizes tool-use trajectories that encourage deeper exploration.
arXiv Detail & Related papers (2026-03-09T00:05:29Z) - TreePS-RAG: Tree-based Process Supervision for Reinforcement Learning in Agentic RAG [71.06073770344732]
Agentic retrieval-augmented generation (RAG) formulates question answering as a multi-step interaction between reasoning and information retrieval.<n>We present TreePS-RAG, an online, tree-based RL framework for agentic RAG that enables step-wise credit assignment while retaining outcome-only rewards.
arXiv Detail & Related papers (2026-01-11T14:07:30Z) - IterResearch: Rethinking Long-Horizon Agents via Markovian State Reconstruction [107.49922328855025]
IterResearch is a novel iterative deep-research paradigm that reformulates long-horizon research as a Markov Decision Process.<n>It achieves substantial improvements over existing open-source agents with average +14.5pp across six benchmarks.<n>It serves as an effective prompting strategy, improving frontier models by up to 19.2pp over ReAct on long-horizon tasks.
arXiv Detail & Related papers (2025-11-10T17:30:08Z) - Tree Search for LLM Agent Reinforcement Learning [23.7084695563981]
Tree-based Group Relative Policy Optimization (Tree-GRPO) is a grouped agent RL method based on tree search.<n>By sharing common prefixes, the tree search sampling increases the number of rollouts achievable.<n>We demonstrate that the objective of intra-tree level group relative policy optimization is equivalent to that of step-level direct preference learning.
arXiv Detail & Related papers (2025-09-25T14:37:09Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.