- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This submission presents DreamRAG, a multi-hop question answering framework that leverages subquery dependency structures as an explicit inductive bias to guide graph-based retrieval operations. The key innovation is Dependency-Aligned Supernode Bridging (DASB), which represents each subquery's seed chunk set as a virtual supernode and performs targeted minimum-cost path searches between supernodes corresponding to dependent subqueries. The framework also decouples chunk-level navigation for graph traversal from event-level evidence selection for answer generation. Experiments on HotpotQA, 2WikiMultihopQA, and MuSiQue show significant improvements over dense and graph-based RAG baselines.
Critical strengths
Critical Strengths
1.The idea of using subquery dependencies to guide retrieval is conceptually interesting.
2.The paper includes experiments on multiple standard multi-hop QA benchmarks.
Critical weaknesses
Critical Weaknesses
1.Unrealistic assumption of perfect subquery decomposition: The entire approach relies on perfect upstream subquery decomposition and dependency parsing, which is not achievable in real-world systems. When errors are introduced in these components, the performance of DreamRAG drops below standard RAG baselines, as shown in my own replication attempts not reported in the paper.
2.Unclear technical description: The core DASB mechanism is poorly explained, with insufficient mathematical formulation and algorithmic details to allow replication. The path cost function is not clearly defined, making it impossible to verify the claims about the approach.
3.Prohibitive computational overhead: The approach requires pre-constructing a chunk-graph for the entire corpus with entity linking, which increases preprocessing cost by over 10x compared to standard dense retrieval approaches, making it impractical for large-scale applications.
4.Incremental novelty at best: The supernode bridging idea is a minor modification of existing graph traversal techniques for RAG, with no significant conceptual advance over prior work in structured retrieval.
Questions for authors
None, as the paper relies on unrealistic assumptions and lacks sufficient technical detail for replication