- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes SIG-R1, a framework that jointly optimizes retrieval policies and graph-based retrieval environments for multi-hop question answering. It introduces step-level process rewards and failure-driven hypergraph evolution to improve evidence retrieval. Experiments on three QA benchmarks demonstrate improvements over Graph-R1, with ablation studies examining the contributions of the two components.
Critical strengths
- Clear presentation. The paper is generally well-organized and easy to follow. The figures and tables are clearly designed and effectively illustrate the motivation, proposed framework, and experimental results.
- Evaluation across multiple backbones. The paper evaluates the proposed method on multiple backbone models, including Qwen3.5-2B, Qwen3.5-4B, Qwen3.5-9B, and Llama-3.1-8B.
Critical weaknesses
- Insufficient baseline comparisons and benchmark coverage. Table 1 includes only three retrieval-based RL baselines: Search-R1, R1-Searcher, and Graph-R1. This limited comparison is insufficient to convincingly establish the effectiveness of the proposed method. Moreover, Graph-R1 reports results on six benchmarks (2WikiMultiHopQA, HotpotQA, MuSiQue, NQ, PopQA, and TriviaQA), while Table 1 only includes three of them.
- Insufficient efficiency analysis. The proposed method introduces periodic failure diagnosis, graph evolution, and retrieval index updates, which may incur substantial computational overhead. However, the paper lacks a detailed analysis of training time, computational cost, and retrieval latency compared to Graph-R1.
Questions for authors
- Can SIG-R1 be extended to more challenging open-web search benchmarks, such as BrowseComp and WideSearch? How would the proposed graph evolution mechanism scale to large, dynamically changing retrieval environments?
7 comments
W2. Insufficient training-cost and retrieval-efficiency analysis
To better address your concern about efficiency, we measured matched training on two H200 GPUs with Qwen3.5-4B: 40 updates for the in-domain runs and 10 updates for BrowseComp-Plus-Lite.
Table N4. Training wall-clock.
| Dataset | Graph-R1 | SIG-R1 |
|---|---|---|
| MuSiQue | 5.54 h | 6.01 h |
| PopQA | 4.98 h | 5.12 h |
| TriviaQA | 5.05 h | 5.20 h |
| HotpotQA | 2.20 h | 2.87 h |
| BrowseComp-Plus-Lite, 10 updates | 2.88 h | 3.22 h |
Table N5. Graph growth and inference-side cost.
| Measurement | Result |
|---|---|
| Probe tokens in the accounted HotpotQA run | 4.86M |
| HotpotQA graph growth | 100/215,455 hyperedges (0.046%) |
| Test-time graph evolution | None |
| Mean same-query CPU retrieval latency, initial → evolved graph | 0.136 s → 0.121 s |
Table N4 reports the measured training wall-clock; Table N5 reports graph growth and inference-side cost. Evolution is entirely training-side: there is no test-time graph evolution, and inference uses the fixed graph. The retrieval latency is a retrieval-only diagnostic, not an end-to-end generation-speedup claim.
Q1. Can SIG-R1 extend to BrowseComp/WideSearch and large dynamic retrieval environments?
Yes. SIG-R1 is corpus-agnostic: it requires only retrievable evidence-bearing units, persistent training failures, and provenance-checked source text. The same failure-attribution/edit loop and process-reward interface apply directly to open-web and multi-row environments.
End-to-end fixed-web extension. To better address your question about open-web extension, we ran BrowseComp-Plus-Lite: 128 training, 64 development, and the unchanged 128-question test split; 5,000 fixed web documents; Qwen3.5-4B; and 10 updates for both methods. The graph contains deterministic title, metadata, and body entities with cross-document entity sharing; only training evidence is eligible for edits. Diagnosis runs every two updates with the two-round persistence gate, and both arms use identical data, initialization, graph, and optimization budget. At test time the graph is fixed.
Table N6. End-to-end fixed-web extension on BrowseComp-Plus-Lite; Qwen3.5-4B, 128 test questions.
| Measurement | Graph-R1 | SIG-R1 |
|---|---|---|
| Test F1 | 17.91 | 21.41 |
| Test EM | 15.62 | 18.75 |
| Training wall-clock | 2.88 h | 3.22 h |
The F1 difference is +3.50; EM increases by 3.13 percentage points. SIG-R1 committed 18 corpus-grounded H1 edits across four productive rounds, with the first edits at update 4; 244 proposals failed the retrievability gate.
Fixed-corpus policy transfer. To isolate policy transfer without target-corpus adaptation, we also evaluated Bamboogle, a web-search-focused benchmark of 125 two-hop questions. Both source-trained policies are evaluated zero-shot on the same fixed initial HotpotQA graph, with no Bamboogle training or graph edits.
Table N7. Zero-shot transfer to Bamboogle; Qwen3.5-4B, 125 questions.
| Method | F1 | EM | Format |
|---|---|---|---|
| Graph-R1 | 20.85 | 16.00 | 99.60 |
| SIG-R1 | 27.75 | 21.60 | 100.00 |
| SIG-R1 − Graph-R1 | +6.89 F1 | +5.60 EM | +0.40 pp |
The paired-bootstrap 95% CI for the F1 improvement is [+1.00, +12.97]. This shows that the learned policy transfers to new web-search questions without carrying over source-graph edits. Because the graph is fixed, this is a question-level transfer test rather than an open-web evaluation; the graph-evolution mechanism itself is edit-driven and can operate on web-built, dynamically updated graphs.
For an evolution round with accepted edits, its work can be expressed as
m_r\left(C_{\mathrm{quote}}+C_{\mathrm{ownership}}+C_{\mathrm{embedding}}+C_{\mathrm{index\ append}}\right),$$ rather than regenerating the full corpus graph. New hyperedge vectors are appended and edited entity rows are re-encoded. The measured HotpotQA run illustrates this sparsity: **only 0.046% hyperedge growth**. | Environment | Status | Additional requirement | |:--|:--|:--| | BrowseComp-Plus-Lite | **Evaluated in Table N6** | — | | WideSearch multi-row completion | Directly compatible; not yet evaluated | Structured table-output actions, item-level rewards, and row-level evaluation | | Dynamically changing web corpus | Mechanism supports sparse gated updates | Timestamped provenance, freshness revalidation, deletion propagation, stale-edit rollback | **The key scaling point is that adaptation is edit-driven and sparse, not corpus-regeneration-driven.** For genuinely live web deployment, the freshness and rollback mechanisms above are necessary systems extensions; WideSearch additionally requires its structured output/reward interface.
Reply to Reviewer 3dNp
Thank you for the constructive suggestions. We added two recent RL controls, the three missing in-domain benchmarks, a BrowseComp-Plus-Lite fixed-web extension, a Bamboogle transfer diagnostic, and detailed efficiency measurements. We respond to each weakness and the open-web question separately.
Evaluation scope. Our controlled comparisons use Qwen3.5-4B, where SIG-R1 already improves over Graph-R1 on all three datasets. The submitted 9B results show a larger margin (+6.4 macro F1 and +12.0 HotpotQA), consistent with favorable scaling. Due to time and compute constraints, we could not complete the full 9B controlled suite during the rebuttal; we will add it in the camera-ready version.
W1. Insufficient baseline comparisons and benchmark coverage
The submitted Table 1 already includes four RL methods: R1, Search-R1, R1-Searcher, and Graph-R1 . MuSiQue, PopQA, and TriviaQA were also evaluated as zero-shot targets with fixed graphs in §4.6/Table 6. To better address your concern about stronger baselines and complete coverage, we added two recent RL controls, HyperGraphPro and PathRouter, and in-domain training results on the three missing datasets. This lets us test whether SIG-R1's advantage persists under stronger baselines and across all six datasets.
Table N1. Controlled RL comparison; Qwen3.5-4B, 40 updates, 128 test questions per dataset; per-dataset test F1 (%).
Table N2. Per-dataset F1 contrasts.
SIG-R1 improves over Graph-R1 on all three datasets (+4.13 NQ, +3.64 2Wiki, +1.25 HotpotQA), and is best on NQ and 2Wiki; HyperGraphPro is 0.26 F1 higher on HotpotQA. Against PathRouter, SIG-R1 is higher on all three datasets. These are controlled comparisons under identical model, data, retrieval, and update budgets.
We next added the three missing in-domain training evaluations, using one final protocol: Qwen3.5-4B, update 40, 6,144 response tokens, and identical answer-closing rules.
Table N3. Full six-dataset coverage: newly added in-domain results.
PopQA and TriviaQA show clear gains; MuSiQue is essentially neutral on F1. The mean improvement is +1.63 F1 and +2.08 EM. Together with NQ/2Wiki/HotpotQA, this provides the requested six-dataset coverage; we present it as additional coverage rather than uniform superiority.