Toward Generalist Autonomous Research via Hypothesis-Tree Refinement

TL;DR

Proposes Arbor framework with Hypothesis-Tree Refinement for autonomous research, achieving over 2.5× improvement across tasks.

cs.CL 🔴 Advanced 2026-06-10 44 views
Jiajie Jin Yuyang Hu Kai Qiu Qi Dai Chong Luo Guanting Dong Xiaoxi Li Tong Zhao Xiaolong Ma Gongrui Zhang Zhirong Wu Bei Liu Zhengyuan Yang Linjie Li Lijuan Wang Hongjin Qian Yutao Zhu Zhicheng Dou
autonomous research hypothesis tree long-horizon optimization AI system scientific automation

Key Findings

Methodology

Arbor integrates a persistent coordinator with short-lived executors, constructing a hypothesis tree as a long-term knowledge base. The coordinator manages global strategy, expanding, merging, and pruning the tree based on experimental evidence. Executors implement hypotheses in isolated environments, returning structured evidence. Nodes bind hypotheses, evidence, implementation references, and insights, enabling layered abstraction and information backpropagation. Experiments across six real research tasks demonstrate that Arbor surpasses baselines like Codex and Claude Code, with over 2.5× relative gains, and achieves 86.36% Medal on MLE-Bench Lite with GPT-5.5.

Key Results

  • In six tasks, Arbor achieved top validation scores, with an average over 2.5× gain compared to baselines. In model training, loss reduced by 6.32%, architecture improvements yielded 7.55% better performance. Data synthesis saw a 13% efficiency increase, and math reasoning scores improved by 19.79%. On MLE-Bench Lite, Arbor with GPT-5.5 scored 86.36% Medal, outperforming competitors. Ablation studies confirmed the importance of the hypothesis tree, evidence backpropagation, and strategic decision-making, validating the system's robustness.

Significance

This work advances autonomous scientific research by enabling long-term knowledge accumulation and hypothesis refinement, addressing the limitations of short-sighted, trial-based systems. It provides a scalable, transparent framework for AI-driven scientific discovery, with broad implications for fields like drug discovery, materials science, and data analysis. The approach bridges the gap between short-term automation and sustained scientific progress, paving the way for AI to act as a persistent, intelligent research partner.

Technical Contribution

Arbor introduces a persistent hypothesis tree structure, combining long-term coordination with isolated execution, enabling multi-path exploration, evidence integration, and strategic pruning. Its core algorithms include tree-based hypothesis refinement, evidence abstraction, and decision gates based on held-out validation. The open-source system facilitates reproducibility and further development, representing a significant step toward scalable, explainable autonomous research systems.

Novelty

This is the first system to embed a persistent, tree-structured hypothesis management mechanism into autonomous research. Unlike prior linear or shallow search methods, Arbor models the entire research process as a layered, multi-path exploration with evidence backpropagation, enabling continuous knowledge accumulation and long-term optimization. Its combination of a persistent coordinator and isolated executors offers a novel architecture for scalable, auditable scientific automation.

Limitations

  • The current system's efficiency drops in extremely high-dimensional or complex hypothesis spaces, due to combinatorial explosion. Computational costs are significant, especially for large models and datasets, limiting scalability. The hypothesis tree may become unwieldy in some tasks, requiring better pruning strategies. Future work should focus on adaptive tree management, resource optimization, and integrating multi-modal data to handle more complex scientific problems.

Future Work

Future directions include developing more efficient tree pruning and compression algorithms, integrating reinforcement learning for strategy optimization, and expanding to multi-modal scientific data. Enhancing scalability and robustness will be key to broader adoption. Additionally, incorporating human-in-the-loop mechanisms and domain-specific priors could further accelerate scientific discovery in real-world applications.

AI Executive Summary

This paper introduces Arbor, a novel framework for autonomous scientific research that models the process as a persistent hypothesis tree. Traditional AI systems for research often focus on short-term tasks, such as code generation or single-step optimization, but struggle to sustain progress over long horizons. Arbor addresses this by integrating a long-lived coordinator that manages a layered tree structure, representing hypotheses, evidence, and insights, with short-lived executors that implement specific experiments in isolated environments. The core innovation lies in Hypothesis Tree Refinement, which allows the system to accumulate knowledge, abstract lessons, and make strategic decisions about exploration, merging, or pruning. Experimental results across six real research tasks—including model training, hardware engineering, and data synthesis—demonstrate that Arbor consistently outperforms baseline systems like Codex and Claude Code, achieving more than 2.5 times the relative gains. Notably, on the MLE-Bench Lite benchmark, Arbor with GPT-5.5 reaches 86.36% Medal, the highest among evaluated methods. These findings highlight the potential of structured, evidence-based exploration for long-term autonomous research, significantly advancing AI's role in scientific discovery. The framework's open-source implementation provides a foundation for future enhancements, including more scalable tree management, multi-modal data integration, and reinforcement learning-based strategy optimization. Overall, Arbor paves the way for AI systems capable of sustained, self-directed scientific inquiry, promising transformative impacts across multiple disciplines.

Deep Analysis

Background

Scientific research has evolved from manual experimentation to automated AI-assisted discovery, with systems like AutoML, AI Scientist, and MARS pushing automation boundaries. However, these systems often lack long-term memory, multi-path exploration, and evidence integration, limiting their ability to conduct sustained, cumulative research. Recent advances in large language models enable code editing, tool invocation, and extended experimentation, but integrating these capabilities into a coherent, long-horizon research framework remains challenging. Existing systems tend to focus on isolated tasks or short-term optimization, unable to maintain a persistent research state that captures hypotheses, evidence, and insights over time. This gap motivates the development of a structured, evidence-based approach to autonomous research.

Core Problem

The core challenge is to design an AI system capable of managing multiple research hypotheses simultaneously, integrating evidence over long periods, and making strategic decisions about exploration, merging, or pruning. Traditional methods lack mechanisms for persistent memory and structured hypothesis management, leading to fragmented knowledge and inefficient search. Achieving reliable, verifiable progress requires a system that can maintain a long-term, auditable record of experiments, learn from failures, and transfer knowledge across tasks. Balancing exploration and exploitation while ensuring evidence validity and transferability is a fundamental difficulty that this work aims to address.

Innovation

The key innovations include: 1) Hypothesis Tree as a persistent, layered structure that encodes hypotheses, evidence, and insights, enabling multi-path exploration; 2) A long-term coordinator that manages the tree, guiding exploration, merging, and pruning based on validation metrics; 3) Evidence abstraction and insight backpropagation, which turn experimental results into reusable knowledge; 4) An open-source system that supports multi-task, long-horizon research. These elements collectively enable continuous knowledge accumulation, verifiable improvements, and scalable exploration, setting a new standard for autonomous scientific systems.

Methodology

  • �� Construct a hypothesis tree where each node contains a hypothesis, evidence, and insights, supporting layered exploration. • The coordinator observes the current tree, proposes new hypotheses, selects promising leaves, and dispatches executors. • Executors implement hypotheses in isolated environments, returning structured evidence, scores, and insights. • Evidence is written back to nodes, and insights are abstracted and propagated upward, updating the tree. • The coordinator evaluates candidate improvements using held-out metrics, merging or pruning branches accordingly. • The process iterates, expanding the tree, accumulating knowledge, and refining artifacts. • Experiments are conducted across six tasks, with metrics like loss reduction, accuracy, and validation scores, demonstrating effectiveness.

Experiments

The experimental setup involves six real-world research tasks: model training, hardware tuning, and data synthesis, with defined initial artifacts, objectives, and evaluation metrics. Baselines include Codex and Claude Code, with resource budgets matched. Hyperparameters such as tree depth, exploration strategies, and evidence abstraction methods are tuned. Ablation studies isolate the impact of hypothesis tree structure, evidence backpropagation, and strategic decision gates. Results show consistent performance improvements, with average gains exceeding 2.5×, validating the hypothesis tree's role in long-term knowledge retention and strategic exploration. The experiments also demonstrate robustness across diverse tasks, confirming the framework's generality.

Results

Arbor reduces model training loss by 6.32%, improves architecture scores by 7.55%, and enhances data synthesis efficiency by 13%. In math reasoning, scores increase by 19.79%. On MLE-Bench Lite, Arbor with GPT-5.5 achieves 86.36% Medal, outperforming all baselines. Ablation results confirm that hypothesis tree structure, evidence backpropagation, and strategic pruning are critical for performance. The system's ability to accumulate and transfer knowledge over long horizons results in sustained improvements, validating the core design principles. These results demonstrate that evidence-structured, multi-path exploration significantly outperforms traditional methods in complex scientific tasks.

Applications

Arbor can be applied to drug discovery, materials science, automated data analysis, and other research-intensive fields requiring multi-stage hypothesis testing. Its ability to manage long-term knowledge and verify artifact improvements makes it suitable for complex, multi-faceted problems. The framework can be integrated into existing AI-assisted research pipelines, enhancing their capacity for sustained, verifiable progress. Long-term, it envisions AI systems acting as persistent scientific partners, accelerating innovation cycles, and reducing human workload in experimental design and analysis.

Limitations & Outlook

Current limitations include scalability issues in extremely high-dimensional hypothesis spaces, where the tree may grow exponentially. Computational costs remain high, especially for large models and datasets, limiting real-world deployment. The system's effectiveness depends on well-designed hypotheses and evidence abstraction, which may require domain expertise. Future work should focus on adaptive pruning, resource-efficient algorithms, and multi-modal data integration to handle more complex scientific problems and improve scalability.

Plain Language Accessible to non-experts

想象你在经营一家餐厅。你需要设计菜单、采购食材、装修店铺,还要不断试做菜肴。每次试菜后,你会总结经验,比如“这道菜受欢迎”或“味道不够好”,然后根据这些经验调整菜单。以前,你可能每次都从头试起,失败了就算了,但效率很低。现在,如果你用一本笔记,把每次试菜的想法、结果和改进方案都记下来,就像在画一棵“菜谱树”。每次试验后,你会在树上标记,告诉自己“这个方向有效”或“这个不行”。这样,你就能更聪明地选择下一步,逐步让餐厅变得更棒。这种方法让你像个聪明的厨师,不断学习、优化,最终做出最受欢迎的菜肴。

ELI14 Explained like you're 14

想象你在做一个超级复杂的学校项目,比如设计一个机器人。你会先想到一些大点子,比如“让机器人跑得快”,然后一步步细化,比如“用更轻的材料”、“改进马达”。每次试验后,你会看到效果,然后决定下一步怎么做。以前,你可能每次都从头开始,失败了就算了,但这样太慢了。现在,如果你用一本笔记,把每个想法、试验结果、学到的教训都记下来,就像在画一棵“想法树”。每次试验后,你会在树上标记,告诉自己“这个方向有效”或“这个不行”。这样,你就能更聪明地选择下一步,慢慢让机器人变得更厉害。这个方法就像是用智慧的笔记,帮你把所有的尝试都整理好,最终让你的机器人变得超级棒!

Glossary

Hypothesis Tree (假设树)

一种持久的树状结构,用于存储科研假设、证据和洞察,支持多路径探索和信息回传。

在Arbor中,假设树作为核心研究状态,管理假设、证据和决策。

Autonomous Optimization (自主优化)

一种无需人工干预,通过连续试验和证据积累,优化科研对象的过程。

论文将AO定义为系统自主改进研究成果的核心任务。

Evidence-Structured Research (证据结构化研究)

以证据和洞察为基础,系统管理科研假设和实验结果的过程。

Arbor利用证据结构化推动长远科研探索。

Hypothesis Refinement (假设细化)

通过树状结构逐层优化和合并假设,提升科研效率。

系统在假设树上进行细化与合并,逐步逼近最优解。

Research Coordinator (研究协调器)

负责管理假设树、策略决策和全局探索的长存实体。

协调器调度执行器,维护整体研究流程。

Open Questions Unanswered questions from this research

  • 1 如何在极端复杂或高维空间中保持探索效率?目前假设树在大规模任务中可能膨胀,影响搜索速度。未来需研究更高效的剪枝与压缩策略,以应对更复杂的科研场景。

Applications

Immediate Applications

自动化科研平台

结合Arbor框架,提升药物设计、材料发现等科研任务的自动化水平,实现持续优化与知识积累。

Long-term Vision

智能科研助理

未来AI能像科学家一样,持续探索未知领域,自动提出假设、设计实验、总结经验,极大缩短创新周期。

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.

cs.CL cs.AI