- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes LiftRAG, which models every extracted relation as a graph vertex carrying its evidence-sentence embedding, turning the knowledge graph into its line graph. In addition, this paper proposes a multi-round beam search over entity-relation trajectories to replace per-query LLM guidance with fixed constants. This paper also conducts extensive experiments to show the effectiveness of the proposed method.
Critical strengths
- The idea behind transforming KGs into line graph is interesting.
- This paper proposes a training-free method, which may reduce the cost for solving questions.
- Extensive experiments demonstrate the effectiveness of the proposed method.
Critical weaknesses
- The technique novelty behind this paper appears limited, as line graph transformation and multi-round beam search may borrowed from existing methods. It would be beneficial to clarify the difference.
- It may lack some recent state-of-the-art baseline methods for multi-hop question answering, such as LinearRAG [1], GFM-RAG [2].
- It would be beneficial to include a comprehensive comparison of graph construction costs, inference time to show the advantage of training-free method.
- It would be beneficial to polish the manuscripts to improve the readability. For example, put the critical experimental results in the main manuscripts instead of placing the conclusion and increase the font size in the figure 2.
[1] Zhuang, Luyao, et al. "Linearrag: Linear graph retrieval augmented generation on large-scale corpora." International Conference on Learning Representations. Vol. 2026. 2026. [2] Luo, Linhao, et al. "GFM-RAG: graph foundation model for retrieval augmented generation." Advances in Neural Information Processing Systems 38 (2026): 36371-36405.
Questions for authors
Please refer to the weaknesses of the paper. Main concerns involve the limited technique novelty and presentation of manuscripts.
3 comments
Thank you for your response. It mainly addresses my concerns, and I will increase the rating to 3.
We are very glad that our work has been recognized by you. Wish you all the best in your academic work.
We would like to share a set of additional experiments that we ran in response to a request from another reviewer, because we believe they are relevant to your assessment as well.
The reviewer asked whether our gains come from the graph mechanism or simply from searching a larger candidate pool. We therefore matched the candidate-pool size in characters across methods and re-ran the comparison, and we also added dense top-100 retrieval followed by a strong cross-encoder reranker under the same 8,000-character budget. At matched pool size our pool-level recall is at parity with dense retrieval and within two points of HippoRAG 2, while our context recall and our conversion from pool to context are the highest on all three datasets. Against dense retrieval with the reranker we lead by 8.2 and 5.1 accuracy points on 2WikiMQA and MuSiQue and tie on HotpotQA, where the dense pool is 1.2 to 2.5 times ours. A coverage analysis further shows that the two kinds of pool reach different evidence, which is the complementarity the paper identifies as future work.
We believe these results further support the novelty and potential of the method, and they may affect your view of it. The full tables (R1 to R4) are in our response to Reviewer Ap7P. We hope this resolves the remaining concerns at once, and we are happy to clarify any number.