ParallelMuse: Agentic Parallel Thinking for Deep Information Seeking
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909874037719040 |
|---|---|
| author | Li, Baixuan Zhang, Dingchu Wu, Jialong Yin, Wenbiao Tao, Zhengwei Zhao, Yida Zhang, Liwen Shen, Haiyang Fang, Runnan Xie, Pengjun Zhou, Jingren Jiang, Yong |
| author_facet | Li, Baixuan Zhang, Dingchu Wu, Jialong Yin, Wenbiao Tao, Zhengwei Zhao, Yida Zhang, Liwen Shen, Haiyang Fang, Runnan Xie, Pengjun Zhou, Jingren Jiang, Yong |
| contents | Parallel thinking expands exploration breadth, complementing the deep exploration of information-seeking (IS) agents to further enhance problem-solving capability. However, conventional parallel thinking faces two key challenges in this setting: inefficiency from repeatedly rolling out from scratch, and difficulty in integrating long-horizon reasoning trajectories during answer generation, as limited context capacity prevents full consideration of the reasoning process. To address these issues, we propose ParallelMuse, a two-stage paradigm designed for deep IS agents. The first stage, Functionality-Specified Partial Rollout, partitions generated sequences into functional regions and performs uncertainty-guided path reuse and branching to enhance exploration efficiency. The second stage, Compressed Reasoning Aggregation, exploits reasoning redundancy to losslessly compress information relevant to answer derivation and synthesize a coherent final answer. Experiments across multiple open-source agents and benchmarks demonstrate up to 62% performance improvement with a 10--30% reduction in exploratory token consumption. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_24698 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | ParallelMuse: Agentic Parallel Thinking for Deep Information Seeking Li, Baixuan Zhang, Dingchu Wu, Jialong Yin, Wenbiao Tao, Zhengwei Zhao, Yida Zhang, Liwen Shen, Haiyang Fang, Runnan Xie, Pengjun Zhou, Jingren Jiang, Yong Computation and Language Artificial Intelligence Parallel thinking expands exploration breadth, complementing the deep exploration of information-seeking (IS) agents to further enhance problem-solving capability. However, conventional parallel thinking faces two key challenges in this setting: inefficiency from repeatedly rolling out from scratch, and difficulty in integrating long-horizon reasoning trajectories during answer generation, as limited context capacity prevents full consideration of the reasoning process. To address these issues, we propose ParallelMuse, a two-stage paradigm designed for deep IS agents. The first stage, Functionality-Specified Partial Rollout, partitions generated sequences into functional regions and performs uncertainty-guided path reuse and branching to enhance exploration efficiency. The second stage, Compressed Reasoning Aggregation, exploits reasoning redundancy to losslessly compress information relevant to answer derivation and synthesize a coherent final answer. Experiments across multiple open-source agents and benchmarks demonstrate up to 62% performance improvement with a 10--30% reduction in exploratory token consumption. |
| title | ParallelMuse: Agentic Parallel Thinking for Deep Information Seeking |
| topic | Computation and Language Artificial Intelligence |
| url | https://arxiv.org/abs/2510.24698 |