mlsanityData to 7 Oct 2026

Holistically Guided Monte Carlo Tree Search for Intricate Information Seeking

arXiv 2502.04751 ↗First posted 7 Feb 2025cs.IR cs.CLcited by 3

Not on the map. Why?

Abstract (arXiv)

In the era of vast digital information, the sheer volume and heterogeneity of available information present significant challenges for intricate information seeking. Users frequently face multistep web search tasks that involve navigating vast and varied data sources. This complexity demands every step remains comprehensive, accurate, and relevant. However, traditional search methods often struggle to balance the need for localized precision with the broader context required for holistic understanding, leaving critical facets of intricate queries underexplored. In this paper, we introduce an LLM-based search assistant that adopts a new information seeking paradigm with holistically guided Monte Carlo tree search (HG-MCTS). We reformulate the task as a progressive information collection process with a knowledge memory and unite an adaptive checklist with multi-perspective reward modeling in MCTS. The adaptive checklist provides explicit sub-goals to guide the MCTS process toward comprehensive coverage of complex user queries. Simultaneously, our multi-perspective reward modeling offers both exploration and retrieval rewards, along with progress feedback that tracks completed and remaining sub-goals, refining the checklist as the tree search progresses. By striking a balance between localized tree expansion and global guidance, HG-MCTS reduces redundancy in search paths and ensures that all crucial aspects of an intricate query are properly addressed. Extensive experiments on real-world intricate information seeking tasks demonstrate that HG-MCTS acquires thorough knowledge collections and delivers more accurate final responses compared with existing baselines.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Feb 2025.

Builds on

0 of 0 references.

No references here yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 1.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Scent of Knowledge: Optimizing Search-Enhanced Reasoning with Information Foraging
  2. 2025Unifying Tree Search Algorithm and Reward Design for LLM Reasoning: A Survey
  3. 2025InfoMosaic-Bench: Evaluating Multi-Source Information Seeking in Tool-Augmented Agents
  4. 2025LLM-First Search: Self-Guided Exploration of the Solution Space
  5. 2024Think&Cite: Improving Attributed Text Generation with Self-Guided Tree Search and Progress Reward Modeling
  6. 2025InfoDeepSeek: Benchmarking Agentic Information Seeking for Retrieval-Augmented Generation
  7. 2026SearchOS-V1: Towards Robust Open-Domain Information-Seeking Agent Collaboration
  8. 2025MCTS-KBQA: Monte Carlo Tree Search with Information Gain Rewards for Knowledge Base Question Answering