- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2(+1)
- Soundness
- 2
Read review
Paper summary
This paper proposes PHyRR, a RL framework for QA, which combines planning and retrieval and is optimized through RL. Experiments with Qwen2.5-1.5B and 3B show improvements over baselines on both single-hop and multi-hop QA tasks, while ablation studies examine the contributions of planning and the reward design.
Critical strengths
- The overall design of PHyRR is reasonable, which first decomposes complex questions into sub-goals and then uses the plan to guide retrieval and reasoning.
- The experimental results show promising improvements over the evaluated baselines across four datasets and two model sizes.
Critical weaknesses
- The presentation of this paper is not good enough. Related work is placed in the appendix. There is no model diagram to help readers understand the framework. Figures 1–3 are overly compressed and difficult to read.
- Some important baselines are missing. For example, GraphRAG-R1 is closely related to this work and is cited, but it is not included in the experiments.
- The proposed mechanism needs more evidence. Ablation studies does not examine planning without the extra rewards, making it hard to separate their effects.
Questions for authors
- How does your work compare to GraphRAG-R1?
- Could you add an ablation that keeps sub-goal decomposition but disables additional rewards to directly support the performance gains of the proposed mechanism?
We thank the reviewer for the constructive feedback. We address each point below.
Question1:
We thank the reviewer for pointing this out. GraphRAG-R1 trains a GraphRAG agent with GRPO, but differs from PHyRR in three ways: it has no explicit plan, while PHyRR generates a plan before reasoning that also guides retrieval (Eqs. 6–8); it requires an SFT stage on data generated by another LLM to address cold start, while PHyRR is trained with RL only and the plan itself mitigates cold start, and this removes both the cost of generating SFT data with an external LLM and the cost of a separate training stage. Finally, its rewards control the number of retrieval calls, while PHyRR’s rewards target grounding and plan consistency. We did not include GraphRAG-R1 as a baseline because it uses a different setting from ours: it retrieves pairwise triplets combined with text passages rather than hypergraphs, and it requires an additional SFT stage with externally generated data. A fair comparison would therefore require re-implementing both its retrieval and its training pipeline in our setting. Instead, we selected one representative method per setting (Table 3). We chose Graph-R1 for RL-based graph retrieval because, like PHyRR, it retrieves from a knowledge hypergraph and is trained only with RL, making it the most directly comparable method. Due to the limited rebuttal period, we could not complete a fair comparison with GraphRAG-R1 under our setting.
Question2:
Thank you for this suggestion. We added the requested ablation (HG + PL, no MR) in Table 2. Planning improves average F1 over the modified hypergraph compared with the hypergraph-only model.
About Presentation: We agree and have revised the paper accordingly: (i) a related work section is now in the main text (Section 2); (ii) we added a framework figure (Figure 1 in Section 4) showing the full pipeline and its components; (iii) the former Figures 1–3 (now Figures 2–4) are enlarged so that labels and legends are readable.