- Rating
- 3
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Argus, a Searcher–Navigator framework for deep research agents. Independent Searchers collect information through ReAct trajectories, while a Navigator organizes the retrieved findings into a shared evidence graph, identifies missing or conflicting information, and requests targeted follow-up searches. The Navigator then synthesizes a final answer using the assembled graph instead of the complete search histories. The Searcher and Navigator are trained separately, with the Navigator optimized through SFT and RL. Experiments across eight benchmarks show consistent improvements over a standalone Searcher. Additional analyses demonstrate the benefits of graph-based synthesis, targeted verification, and transfer across different Searcher backbones.
Critical strengths
- Strong empirical performance. Argus consistently improves over the standalone Searcher across eight benchmarks, achieving average gains of 5.5 points in Solo mode and 12.7 points in Parallel mode.
- Well-motivated evidence assembly framework. The shared evidence graph integrates findings from independent Searchers and guides targeted verification, providing a structured approach to multi-agent coordination.
- Meaningful component ablations. The paper evaluates Navigator training, targeted follow-up searches, and graph representations. Notably, the full graph improves BrowseComp accuracy by 5.2 points over text-only synthesis using identical Searcher rollouts.
- Strong transferability across backbones. The same trained Navigator improves performance with different Searcher models, including DeepSeek and Seed-2.0-Pro, without additional training.
Critical weaknesses
- Unclear source of performance gains. Argus achieves substantial improvements, but the total inference budgets are not matched with the baselines. It remains unclear whether the gains primarily come from the proposed Searcher–Navigator architecture or simply from additional test-time computation.
- Missing evaluation of broad information seeking. The evaluation primarily focuses on deep, answer-oriented search tasks such as BrowseComp and GAIA. However, Argus is designed to coordinate parallel Searchers and assemble evidence from multiple sources. A benchmark such as WideSearch would be particularly relevant for evaluating information coverage, completeness, and aggregation across many independent findings.
- Redundant parallel exploration. Independent Searchers may retrieve overlapping evidence, wasting computation. The paper lacks analysis of evidence redundancy and marginal information gain.
Questions for authors
- Inference budget fairness. Could the authors clarify how much of the performance improvement comes from the proposed architecture rather than additional search computation? How would Argus compare with existing approaches under matched inference budgets?
- Broad information seeking. Have the authors considered evaluating Argus on WideSearch? This benchmark would better assess whether the proposed evidence assembly framework can improve information coverage and completeness across parallel searches.
- Parallel search efficiency. How much evidence overlap exists among Searchers, and how does unique evidence coverage scale with the number of Searchers?
2 comments
Thank you for your reply. I have no other questions. I maintain my score.
Response to Reviewer aeTT
Thank you for identifying the broad-search evaluation as a useful test of the framework. We now report WideSearch results, then address compute attribution and evidence overlap.
A1. New evaluation on WideSearch
We evaluated the full WideSearch evaluation set with the same model backbone, tools, and scorer for the standalone Searcher and Argus:
Evaluation uses the official WideSearch implementation and corresponding LLM judge, with the same evaluation configuration for both methods. The reported metric is Item F1 (
f1_by_item). This extends the evaluation beyond deep, single-answer search to broad information collection, with a 6.9-point gain.A2. Evidence organization versus additional computation
As you noted, Table 4 holds Searcher rollouts fixed. All three variants also use the same synthesis model, input-length limit, and truncation settings. The full graph obtains 74.5%, versus 72.0% for the bare graph and 69.3% for text-only input. The 5.2-point gain therefore requires neither additional retrieval nor a stronger synthesis model. It supports the structured representation, including relations and claim annotations, rather than topology alone.
Table 2 adds a search-allocation control: replacing targeted follow-ups with independent exploration reduces accuracy from 74.50% to 70.33% over three 200-question inference runs. Table 3 tests transfer of the same Navigator without retraining: Argus-Parallel exceeds K=8 LLM aggregation by 18.0, 9.5, and 8.6 points across the three Searcher backbones.
These controls support design benefits, but neither they nor the standalone-versus-K=8 WideSearch comparison establish matched-total-compute superiority. Figure 4 is within-system scaling evidence: black labels count cumulative Searcher tokens, and green labels count final graph-based synthesis input plus output only, excluding earlier Navigator processing and graph maintenance. The current “final graph context” wording needs correction; the green values are not total Navigator cost or graph-input length alone.
A3. Parallel overlap and marginal evidence gain
Initial Searchers explore independently and can retrieve overlapping material. The Navigator consolidates their returns and uses unresolved requirements or conflicts to guide subsequent searches. Consolidating records for synthesis cannot recover computation already spent on overlapping exploration.
The new WideSearch result supports broad-search output quality, while overlap and marginal evidence gain remain unmeasured; neither that result nor Figure 4 is presented as a redundancy analysis.
We hope the requested broad-search evaluation and the complementary controls strengthen the empirical case for the framework within these stated limits.