arXiv:2410.02052cs.CLcs.CV2024-10ICLR被引 62

让AI Agent学会边执行边探索,提升复杂任务表现

ExACT: Teaching AI Agents to Explore with Reflective-MCTS and Exploratory Learning

  • 用反思式MCTS动态优化搜索路径,提升探索效率
  • 在VisualWebArena上比现有方法最高提升30%,且可迁移到模型本身
  • 适合研究智能体自主决策与测试时学习的学者

自主智能体在自动化多步骤决策任务中展现巨大潜力,但即使最先进的视觉语言模型(如GPT-4o)在复杂网页环境和长程任务中仍远未达到人类水平。为此,我们提出ExACT,结合测试时搜索与自学习,构建类o1的智能体应用。首先引入反思式蒙特卡洛树搜索(R-MCTS),通过对比反思机制使智能体从过往交互中学习,动态提升搜索效率,并利用多智能体辩论实现可靠状态评估。其次提出探索性学习策略,使智能体在推理时无需外部搜索算法即可自主探索。在挑战性VisualWebArena基准上,基于GPT-4o的R-MCTS代理在各类任务中相对性能提升6%至30%。此外,测试时搜索所获知识可通过微调有效回传至GPT-4o。经过探索性学习后,GPT-4o不仅能自主探索、评估状态并回溯失败路径,还能达到R-MCTS 87%的性能,且计算开销显著更低。本工作还揭示了训练(数据收集)与测试时的计算可扩展性,为增强视觉语言模型的智能体能力提供了新方向。

原文摘要 · Abstract (English)

Autonomous agents have demonstrated significant potential in automating complex multistep decision-making tasks. However, even state-of-the-art vision-language models (VLMs), such as GPT-4o, still fall short of human-level performance, particularly in intricate web environments and long-horizon tasks. To address these limitations, we present ExACT, an approach to combine test-time search and self-learning to build o1-like models for agentic applications. We first introduce Reflective Monte Carlo Tree Search (R-MCTS), a novel test time algorithm designed to enhance AI agents' ability to explore decision space on the fly. R-MCTS extends traditional MCTS by 1) incorporating contrastive reflection, allowing agents to learn from past interactions and dynamically improve their search efficiency; and 2) using multi-agent debate for reliable state evaluation. Next, we introduce Exploratory Learning, a novel learning strategy to teach agents to search at inference time without relying on any external search algorithms. On the challenging VisualWebArena benchmark, our GPT-4o based R-MCTS agent achieves a 6% to 30% relative improvement across various tasks compared to the previous state-of-the-art. Additionally, we show that the knowledge and experience gained from test-time search can be effectively transferred back to GPT-4o via fine-tuning. After Exploratory Learning, GPT-4o 1) demonstrates the ability to explore the environment, evaluate a state, and backtrack to viable ones when it detects that the current state cannot lead to success, and 2) matches 87% of R-MCTS's performance while using significantly less compute. Notably, our work demonstrates the compute scaling properties in both training - data collection with R-MCTS - and testing time. These results suggest a promising research direction to enhance VLMs' capabilities for agentic applications via test-time search and self-learning.

智能体探索学习MCTSGPT-4o

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。