Skip to content

WebSwarm: Recursive Multi-Agent Orchestration for Deep-and-Wide Web Search

Jul 2026 · arXiv.org · Vol abs/2607.08662 · 0 citations · 32 references
Computer Science

TL;DR

This work proposes WebSwarm, a progressive recursive delegation framework that jointly constructs task decomposition, recursive expansion, and agent collaboration during inference and consistently outperforms single-agent and multi-agent baselines on deep, wide, and interleaved deep-and-wide tasks.

Abstract

Large language model (LLM)-based web search agents are transforming information seeking from simple factoid question answering into complex, deep-and-wide search and research-oriented tasks. A single ReAct-style agent is constrained by one long trajectory and limited context, making it difficult to handle depth and coverage simultaneously. Existing multi-agent systems improve search coverage through parallel execution and aggregation, but still exhibit clear limitations in recursive depth, collaboration adaptability, and evidence-grounded expansion. We propose WebSwarm, a progressive recursive delegation framework that jointly constructs task decomposition, recursive expansion, and agent collaboration during inference. WebSwarm dynamically instantiates agentic search nodes, each coupling a local objective with a search mode that specifies how the node should organize search and collaboration. Each node can either solve its objective itself or further delegate child nodes; after solving, it returns evidence and results upward, enabling parent nodes to further expand, revise, or aggregate the search process. To guide this process, WebSwarm first probes how task-relevant information is organized on the web to ground subsequent node expansion, and reuses process-level experience across homogeneous sibling nodes. Experiments on BrowseComp-Plus, WideSearch, DeepWideSearch, and GISA show that WebSwarm consistently outperforms single-agent and multi-agent baselines on deep, wide, and interleaved deep-and-wide tasks. Further analyses of ablation, task difficulty, web tool efficiency, and model generalization explain WebSwarm's effectiveness and provide insights for multi-agent search systems.

View source

Similar papers

Jul 2026

SearchOS-V1: Towards Robust Open-Domain Information-Seeking Agent Collaboration

This work introduces SearchOS, a system-level multi-agent framework that turns fragile, implicit search progress into explicit, persistent, and shared state, and introduces a Search Tool Middleware Harness that intercepts model and tool interactions to record grounded evidence and react to stalls or budget exhaustion.

Yuyao Zhang, Junjie Gao, Zheng-Xian Wu et al. · 0 citations
Open access 2026

Enhancing Web Search Agents With Self-Play Contrastive Fine-Tuning

This paper proposes TAPE (Trajectory Alignment and exPerience pool Evolution), a novel self-evolving fine-tuning framework designed to enhance the generalization and robustness of web search agents without requiring large-scale human annotation.

Minjae Rhee, Jitong Zou, Tianjun Mo et al. · 3 citations
Jul 2026

AgentRadio: Passive Awareness for Long-Horizon Multi-Agent Collaboration

AgentRadio is presented, an asynchronous message-passing layer that equips coding-agent harnesses with three primitives: threads, messages, and waiting for mentions that shows the gain growing with task difficulty, consistent with mid-course correction as the underlying mechanism.

Xinxing Ren, Qianbo Zang, Ziyan Wang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Inference-Time Graph Engineering for Multi-Agent LLM Workflows

Recent multi-agent LLM systems increasingly rely on graph-structured communication to coordinate specialized agents. We revisit multi-agent orchestration from a graph-engineering perspective: rather than optimizing a static topology, we synthesize a task-conditioned temporal workflow graph that jointly specifies agent connectivity and edge-level communication semantics. We introduce ReActNet, a training-free framework that compiles a query and a set of role-specialized agents into a sequence of directed communication graphs. Each graph snapshot corresponds to one reasoning stage, and each edge carries a natural-language instruction specifying the message that a source agent should provide to a target agent. The compiled temporal graph is then executed through structured message passing: agents update their reasoning states by integrating their previous states with messages from controller-assigned neighbors, and a final aggregator synthesizes the resulting states into the answer. This design separates graph compilation from graph execution, making multi-agent coordination explicit, inspectable, and task-conditioned without requiring reinforcement learning or gradient-based topology optimization. Across knowledge reasoning, mathematical problem solving, code generation, and GAIA-style assistant tasks, ReActNet consistently improves over fixed-topology and learned-topology baselines while maintaining competitive inference cost. These results suggest that effective multi-agent orchestration depends not only on which agents communicate, but also on engineering executable workflow graphs that encode when, why, and how information should flow during reasoning.

Katherine Tieu, Dongqi Fu, Yinglong Xia et al. · 0 citations
Preprint Aug 2026

EASy: Towards Efficient LLM-Based Agentic System

EASy is proposed, a trainable agentic framework that jointly optimizes task performance and computational efficiency through reinforcement learning and consistently achieves stronger performance-efficiency trade-offs than strong agentic baselines.

Junnan Liu, Linhao Luo, Thuy-Trang Vu et al. · 0 citations
Preprint Aug 2026

Semantic Uncertainty-Guided Orchestration in Hierarchical Multi-Agent Systems

A semantic-uncertainty-guided orchestration approach, HASSUM is introduced as a general framework for uncertainty-aware coordination in multi-agent systems and suggests that semantic uncertainty is a practical and general-purpose signal for improving robustness and trustworthiness in agentic AI systems.

John Knowlton, Aritra Guha, Risto Miikkulainen · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.