- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes SynerGate-RAG, a framework for multi-hop question answering that combines graph-grounded and text-based process rewards. It constructs continuous graph-utility labels and trains a graph process reward model, then uses an adaptive gate to combine graph and text feedback for PPO training. Experiments on three multi-hop QA benchmarks demonstrate improved answer quality over chosen baselines.
Critical strengths
- The method achieves strong results across three multi-hop QA benchmarks.
- The controlled reward ablations and independent evaluations of the PRM and gate provide useful empirical evidence.
Critical weaknesses
- The method is overly complicated and relies heavily on heuristic design choices. In particular, the graph-utility target based on the product of citation matching and relevance rates, and the gate trained to predict the graph-utility value, lack sufficiently convincing justification. Moreover, treating unavailable graph evidence as neutral does not fundamentally address the challenge of verifying reasoning under incomplete KGs.
- The overall contribution is difficult to disentangle from the complexity of the system, which involves multiple supervision stages and reward models. While the experiments demonstrate effectiveness, it remains unclear whether the benefits justify this complexity. The presentation is also a little bit difficult to follow, making the central methodological contribution harder to appreciate.
Questions for authors
- What is the end-to-end training and evidence-preparation cost of the complete pipeline, including teacher annotation and PRM training? This would help assess whether the improvements justify the additional system complexity.
- Can the authors provide comparisons with relevant methods that you introduced in related works such as Search-R1 and GraphRAG-R1, or clarify why these baselines are not directly comparable?
2 comments
Thank you for the detailed rebuttal and the additional experiments. I appreciate the new analyses, baseline comparisons, and cost breakdown, which help clarify and strengthen the empirical evaluation. However, my main concern about the method relies on a complex pipeline with several heuristic design choices, still remain. Thus, I would like to maintain my original rating.
Thank you for recognizing the answer-quality improvements and the controlled evaluations. We appreciate your concern that the contribution and its practical cost should be easier to assess. The revision connects each design choice to a control and adds resource and related-system comparisons.
1. Design choices and the central contribution.
The method learns signed process utility from incomplete source evidence and uses it for stepwise graph-text reward allocation during reader training. Appendix H.1 maps its components to existing ablations: macro F1 is 56.6 for the full method, versus 49.0 for direct graph rules, 50.8 for a hard-label PRM, 49.9 for fixed mixing, and 52.6 for terminal-only reward placement. These controls distinguish learned scoring, continuous supervision, adaptive allocation, and temporal credit assignment.
We also agree that the product target and gate require more than an intuitive explanation. Table H5 finds product-positive/joint-zero cases in 0.62% of 5,997 eligible steps (37 cases). In Table H6, product and joint targets yield reader macro F1 of 57.1 and 56.8, with slightly better process metrics for the joint target. We present this as sensitivity to the target choice, not an optimality claim. The gate predicts ∣zt∣ rather than signed utility, preserving both supportive and contradictory feedback. Table H7 adds a development-tuned constant: learned allocation achieves 85.1% ranking accuracy and 69.4% top-1 EM, versus 82.1% and 67.0%. Table H8 separately examines channel error.
2. What the method addresses under incomplete graphs.
Your scope concern is well taken. The mechanism prevents a missing relation alone from creating a negative supervision target; it does not reconstruct missing facts. When no admissible source slot remains, graph weight becomes zero and textual feedback remains available. Negative offline targets require accepted contradiction witnesses. The revised discussion frames this as selective process supervision under incomplete evidence, and the Limitations section explains the boundaries imposed by coverage, linking, and weak-label quality.
3. End-to-end preparation and training cost (Q1).
Tables H9-H11 separate the pipeline stages. Shared index/source preparation costs 21.4 GPU-hours and question-specific evidence preparation costs 8.6, totaling 30.0. Reader SFT, graph PRM training, gate features/fitting, and PPO/replay cost 12.8, 8.1, 2.3, and 41.7 GPU-hours, totaling 64.9; development evaluation adds 4.3. The overall recorded GPU budget is 99.2 GPU-hours. Teacher generation uses 11,842,000 input and 3,914,000 output API tokens; semantic annotation uses 7,906,000 input and 986,000 output tokens. Stage wall times are reported separately, without treating their sum as end-to-end elapsed time.
Table H10 now agrees with this full-method ledger. Updated baseline cost totals were not supplied, so we leave them unreported rather than infer a cost ratio. The supplemental answer-quality comparison is 57.1 macro F1 for the full method, 50.2 for fixed mixture, and 40.6 for answer-only; these differ from the main-table three-run means. Deployment requires no reward-model calls. Table H11 reports full-method median latency of 6.30 s cold and 4.66 s warm, versus 6.02/4.39 s for answer-only and 6.19/4.55 s for fixed mixture. Figure 3(b) measures rollout-budget efficiency, excluding offline preparation and supervision costs.
4. Search-R1 and GraphRAG-R1 (Q2).
We agree that both are relevant comparisons; the existing R1-Searcher row is not a substitute. Table H12 now reports macro F1 of 57.1 for SynerGate-RAG, 54.4 for Search-R1, and 55.5 for GraphRAG-R1. Both Search-R1 and GraphRAG-R1 use Qwen2.5-7B, while SynerGate-RAG uses Llama-3-8B-Instruct. We distinguish these system-level results from Table 2's matched reward ablations: backbones, retrieval policies, and system configurations can contribute to the gaps, whereas Table 2 fixes evidence, initialization, and rollout budget to isolate reward design. This distinction allows the additional comparisons to inform practical performance without attributing every system-level difference to our reward mechanism.