BrowseMaster: Towards Scalable Web Browsing via Tool-Augmented Programmatic Agent Pair

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Pang, Xianghe, Tang, Shuo, Ye, Rui, Du, Yuwen, Du, Yaxin, Chen, Siheng
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866916894044323840
author Pang, Xianghe
Tang, Shuo
Ye, Rui
Du, Yuwen
Du, Yaxin
Chen, Siheng
author_facet Pang, Xianghe
Tang, Shuo
Ye, Rui
Du, Yuwen
Du, Yaxin
Chen, Siheng
contents Effective information seeking in the vast and ever-growing digital landscape requires balancing expansive search with strategic reasoning. Current large language model (LLM)-based agents struggle to achieve this balance due to limitations in search breadth and reasoning depth, where slow, serial querying restricts coverage of relevant sources and noisy raw inputs disrupt the continuity of multi-step reasoning. To address these challenges, we propose BrowseMaster, a scalable framework built around a programmatically augmented planner-executor agent pair. The planner formulates and adapts search strategies based on task constraints, while the executor conducts efficient, targeted retrieval to supply the planner with concise, relevant evidence. This division of labor preserves coherent, long-horizon reasoning while sustaining broad and systematic exploration, overcoming the trade-off that limits existing agents. Extensive experiments on challenging English and Chinese benchmarks show that BrowseMaster consistently outperforms open-source and proprietary baselines, achieving scores of 30.0 on BrowseComp-en and 46.5 on BrowseComp-zh, which demonstrates its strong capability in complex, reasoning-heavy information-seeking tasks at scale.
format Preprint
id arxiv_https___arxiv_org_abs_2508_09129
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle BrowseMaster: Towards Scalable Web Browsing via Tool-Augmented Programmatic Agent Pair
Pang, Xianghe
Tang, Shuo
Ye, Rui
Du, Yuwen
Du, Yaxin
Chen, Siheng
Artificial Intelligence
Effective information seeking in the vast and ever-growing digital landscape requires balancing expansive search with strategic reasoning. Current large language model (LLM)-based agents struggle to achieve this balance due to limitations in search breadth and reasoning depth, where slow, serial querying restricts coverage of relevant sources and noisy raw inputs disrupt the continuity of multi-step reasoning. To address these challenges, we propose BrowseMaster, a scalable framework built around a programmatically augmented planner-executor agent pair. The planner formulates and adapts search strategies based on task constraints, while the executor conducts efficient, targeted retrieval to supply the planner with concise, relevant evidence. This division of labor preserves coherent, long-horizon reasoning while sustaining broad and systematic exploration, overcoming the trade-off that limits existing agents. Extensive experiments on challenging English and Chinese benchmarks show that BrowseMaster consistently outperforms open-source and proprietary baselines, achieving scores of 30.0 on BrowseComp-en and 46.5 on BrowseComp-zh, which demonstrates its strong capability in complex, reasoning-heavy information-seeking tasks at scale.
title BrowseMaster: Towards Scalable Web Browsing via Tool-Augmented Programmatic Agent Pair
topic Artificial Intelligence
url https://arxiv.org/abs/2508.09129