Papers
arxiv:2602.06724

Table-as-Search: Formulate Long-Horizon Agentic Information Seeking as Table Completion

Published on Feb 6
ยท Submitted by
Tian Lan
on Feb 9
ยท AIDC-AI AIDC-AI
Authors:
,
,
,
,
,
,
,
,

Abstract

Table-as-Search framework reformulates information seeking tasks as table completion problems, improving long-horizon search robustness through structured state management.

AI-generated summary

Current Information Seeking (InfoSeeking) agents struggle to maintain focus and coherence during long-horizon exploration, as tracking search states, including planning procedure and massive search results, within one plain-text context is inherently fragile. To address this, we introduce Table-as-Search (TaS), a structured planning framework that reformulates the InfoSeeking task as a Table Completion task. TaS maps each query into a structured table schema maintained in an external database, where rows represent search candidates and columns denote constraints or required information. This table precisely manages the search states: filled cells strictly record the history and search results, while empty cells serve as an explicit search plan. Crucially, TaS unifies three distinct InfoSeeking tasks: Deep Search, Wide Search, and the challenging DeepWide Search. Extensive experiments demonstrate that TaS significantly outperforms numerous state-of-the-art baselines across three kinds of benchmarks, including multi-agent framework and commercial systems. Furthermore, our analysis validates the TaS's superior robustness in long-horizon InfoSeeking, alongside its efficiency, scalability and flexibility. Code and datasets are publicly released at https://github.com/AIDC-AI/Marco-Search-Agent.

Community

Paper author Paper submitter

Table-as-Search is a production-ready agent framework designed to tackle deep and wide information seeking tasks that require both:

  • ๐Ÿ” Deep reasoning over multi-hop retrieval
  • ๐ŸŒ Wide-scale information collection across multiple entities

This framework significantly outperforms Single-Agent, Multi-Agent ReAct baselinse in challenging Deep and Wide Info-Seeking. The framework implements a hierarchical multi-agent architecture with specialized agents for different search strategies, making it suitable for real-world applications like market analysis, competitive intelligence, and business development research.

Sign up or log in to comment

Models citing this paper 0

No model linking this paper

Cite arxiv.org/abs/2602.06724 in a model README.md to link it from this page.

Datasets citing this paper 0

No dataset linking this paper

Cite arxiv.org/abs/2602.06724 in a dataset README.md to link it from this page.

Spaces citing this paper 0

No Space linking this paper

Cite arxiv.org/abs/2602.06724 in a Space README.md to link it from this page.

Collections including this paper 0

No Collection including this paper

Add this paper to a collection to link it from this page.