Flash-Searcher: Fast and Effective Web Agents via DAG-Based Parallel Execution

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Qin, Tianrui, Chen, Qianben, Wang, Sinuo, Xing, He, Zhu, King, Zhu, He, Shi, Dingfeng, Liu, Xinxin, Zhang, Ge, Liu, Jiaheng, Jiang, Yuchen Eleanor, Gao, Xitong, Zhou, Wangchunshu
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912615549108224
author Qin, Tianrui
Chen, Qianben
Wang, Sinuo
Xing, He
Zhu, King
Zhu, He
Shi, Dingfeng
Liu, Xinxin
Zhang, Ge
Liu, Jiaheng
Jiang, Yuchen Eleanor
Gao, Xitong
Zhou, Wangchunshu
author_facet Qin, Tianrui
Chen, Qianben
Wang, Sinuo
Xing, He
Zhu, King
Zhu, He
Shi, Dingfeng
Liu, Xinxin
Zhang, Ge
Liu, Jiaheng
Jiang, Yuchen Eleanor
Gao, Xitong
Zhou, Wangchunshu
contents Large language models (LLMs) have demonstrated remarkable capabilities in complex reasoning tasks when equipped with external tools. However, current frameworks predominantly rely on sequential processing, leading to inefficient execution particularly for tasks requiring extensive tool interaction. This paper introduces Flash-Searcher, a novel parallel agent reasoning framework that fundamentally reimagines the execution paradigm from sequential chains to directed acyclic graphs (DAGs). Flash-Searcher decomposes complex tasks into subtasks with explicit dependencies, enabling concurrent execution of independent reasoning paths while maintaining logical constraints. Through dynamic workflow optimization, our framework continuously refines the execution graph based on intermediate results, effectively integrating summary module. Comprehensive evaluations across multiple benchmarks demonstrate that Flash-Searcher consistently outperforms existing approaches. Specifically, it achieves 67.7% accuracy on BrowseComp and 83% on xbench-DeepSearch, while reducing agent execution steps by up to 35% compared to current frameworks. Furthermore, when distilling this parallel reasoning pipeline into single models, we observe substantial performance gains across diverse backbone architectures, underscoring the generalizability of our methodology. Our work thus represents a significant advance in agent architecture design, offering a more scalable and efficient paradigm for complex reasoning tasks.
format Preprint
id arxiv_https___arxiv_org_abs_2509_25301
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Flash-Searcher: Fast and Effective Web Agents via DAG-Based Parallel Execution
Qin, Tianrui
Chen, Qianben
Wang, Sinuo
Xing, He
Zhu, King
Zhu, He
Shi, Dingfeng
Liu, Xinxin
Zhang, Ge
Liu, Jiaheng
Jiang, Yuchen Eleanor
Gao, Xitong
Zhou, Wangchunshu
Artificial Intelligence
Computation and Language
Large language models (LLMs) have demonstrated remarkable capabilities in complex reasoning tasks when equipped with external tools. However, current frameworks predominantly rely on sequential processing, leading to inefficient execution particularly for tasks requiring extensive tool interaction. This paper introduces Flash-Searcher, a novel parallel agent reasoning framework that fundamentally reimagines the execution paradigm from sequential chains to directed acyclic graphs (DAGs). Flash-Searcher decomposes complex tasks into subtasks with explicit dependencies, enabling concurrent execution of independent reasoning paths while maintaining logical constraints. Through dynamic workflow optimization, our framework continuously refines the execution graph based on intermediate results, effectively integrating summary module. Comprehensive evaluations across multiple benchmarks demonstrate that Flash-Searcher consistently outperforms existing approaches. Specifically, it achieves 67.7% accuracy on BrowseComp and 83% on xbench-DeepSearch, while reducing agent execution steps by up to 35% compared to current frameworks. Furthermore, when distilling this parallel reasoning pipeline into single models, we observe substantial performance gains across diverse backbone architectures, underscoring the generalizability of our methodology. Our work thus represents a significant advance in agent architecture design, offering a more scalable and efficient paradigm for complex reasoning tasks.
title Flash-Searcher: Fast and Effective Web Agents via DAG-Based Parallel Execution
topic Artificial Intelligence
Computation and Language
url https://arxiv.org/abs/2509.25301