- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
WideSeek-R1 uses a lead agent to divide broad search tasks among parallel subagents and combine their results. The agents share model parameters and are trained together with a GRPO-based objective. The authors also construct 20,000 synthetic training tasks. On WideSearch, Item F1 improves from 29.6 to 40.0 compared with the base model in the same multi-agent framework.
Critical strengths
-
The gain over the base model is substantial: Item F1 increases from 29.6 to 40.0 in the same framework. This is useful evidence that RL training helps the system.
-
Using the trained model only as the lead agent raises Item F1 to 34.7, while using it only as the subagents raises it to 34.2. The role-assignment experiment therefore shows gains from updating either role.
Critical weaknesses
-
The lead agent handles task decomposition, further delegation, and final answer generation. Replacing it with the trained model changes all of these at once. Table 5 shows more subagents and tool calls after training, but does not measure the quality of the plans or searches. The paper would be more convincing with a test that separates these effects, such as comparing retrieval on the same subtasks or answer generation from the same retrieved results.
-
Figure 4 compares turn limits and subagent counts without matching actual resource use. The depth curve also uses the base model rather than the trained SingleSeek-R1. In Table 5, WideSeek-R1 uses 51,104 response tokens, compared with 19,837 for the base multi-agent model. SFT uses even more tokens and scores lower, so token count alone does not explain the results. Still, a comparison at similar token and tool-call budgets is needed to assess the advantage of width scaling. Reporting elapsed time would also clarify the benefit of parallel execution.
Questions for authors
-
At similar token and tool-call budgets, does WideSeek-R1 still outperform the base multi-agent model and SingleSeek-R1?
-
What evidence shows that task decomposition improves? Can you separate this from changes in further delegation and final answer generation?
Thank you for your constructive comments and questions! We appreciate your thorough review and hope the following responses address your concerns.
We manually compared the base model and WideSeek-R1 on the same questions, examining both task decomposition and final aggregation. The trained model more consistently produced self-contained subtasks that could actually run in parallel. The base model frequently placed dependencies within a batch, for example, "subtask 2: use the result of subtask 1 to ...". Because agents in the same batch run independently and return together, the second agent cannot obtain the first agent's result during execution.
Task decomposition and further delegation are closely related parts of the orchestration policy. Within a batch, assignments must be independent; across turns, the lead agent can use completed findings to formulate the next batch. WideSeek-R1 better respects this distinction, allowing parallel execution to gather useful information instead of assigning subtasks with unresolved dependencies.
For final aggregation, our manual analysis found that both the base and trained lead agents generally assembled accurate, sufficient subagent findings correctly. Cases where the evidence was correct but the lead agent failed to incorporate it were rare. The more prominent differences in the inspected trajectories were therefore the quality of decomposition and information gathering.
Our study examines how learning enables agents to translate additional test-time computation into better answers. Tables 1, 3, and 5 report the corresponding quality and resource usage:
These are WideSearch measurements using online Serper/Jina tools; tokens and calls are per-query averages across the system. WideSeek-R1-4B improves Item F1 by 10.4 points over the base multi-agent model. Compared with WideSeek-SFT-4B, it gains 8.5 points while generating fewer response tokens and making more access calls. The SFT comparison highlights that generating more text alone does not explain the gain.
We further investigated single-agent scaling in three settings:
In these tests, extra turns and context compression do not sustain gains; even fully RL-trained SingleSeek-R1-para5 trails WideSeek-R1 by 9.3 points. This supports scaling through isolated contexts and learned delegation.
Figure 4 first compares single- and multi-agent execution with the same base Qwen3-4B: width scaling improves performance beyond the plateau of depth scaling. MARL then further unlocks multi-agent width scaling, sustaining gains as the number of parallel subagents increases.
Elapsed time also depends on GPU parallelism, serving configuration, and variable online API delays. We therefore use measured tokens and tool calls to characterize resource use; the central finding is improved answer quality through learned parallel orchestration.
We sincerely appreciate your thoughtful and detailed review. We have carefully addressed each of your concerns and believe these clarifications strengthen our contribution. We hope you will consider adjusting your rating accordingly.