- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper tries to address dependency modeling in multi-hop questions, reuse of retrieved facts, and credit assignment for intermediate search actions. It maps these goals to a QDMR-style dependency graph, a control-token retrieval/memory loop, and a PQPO process-quality advantage. The experiments cover seven QA benchmarks with Qwen3.5-4B and Qwen3.5-9B, reaching average scores of 41.29 and 48.91. Ablations support memory and decomposition, but the three parallel problem lines leave the central research story unfocused.
Critical strengths
- The modules form an understandable process. QDMR-style decomposition, topological execution, post-retrieval memory writes, Conclusion compression, and later Memory reads form a complete within-trajectory loop.
- The evaluation is broad. Two model sizes, seven datasets, several search-RL baselines, component ablations, and PQPO sensitivity experiments provide a substantial engineering evaluation.
Critical weaknesses
- The research question is too broad and the solution lacks a clear priority. Dependency graphs, persistent memory, and PQPO could each support a separate paper, but the main text presents them as parallel contributions. It is therefore difficult to tell whether the real new problem is dependency modeling, memory reuse, or process-level RL.
- The central solution is not closed by the experiments, and no anonymous source link is provided. The memory is mainly a bounded recency buffer within a single question trajectory; cross-question persistence appears only as an optional initialization. PQR may also use later trajectory information, while the main results lack clear multi-seed variance and component-level attribution. The paper provides no anonymous source or run-repository link for independently checking training, retrieval, PQR, and baseline reproduction.
Questions for authors
- Can you add a true cross-question persistent-memory setting in which earlier questions write memory and later questions read it under no-retrieval or restricted-retrieval budgets, comparing long-term gains, error accumulation, and capacity eviction against clearing memory for every question? If not, should the title and contributions be changed to within-episode memory?
- Do q_dec, q_ret, and q_mem require the complete trajectory or final answer to compute? Please give an online definition that does not use future information, report annotation reliability, and compare against reward-only GRPO, fixed process rewards, and alternative weights.
- Can you report independent seeds, training data and steps, compute budgets, and per-dataset variance for all major methods, together with baseline-reproduction logs? Please also provide links to anonymous source code, training configurations, and reproduction logs.