检索说明
- 查询:GraphRAG evidence retrieval
- 年份过滤:2025-
- 单查询上限:20
- 发现日期:2026-11-12
Semantic Scholar 候选元数据
- 作者:Yu-Qing Huang, Ning Liao, Kai Yang, An-Ning Hu, Sheng-Chao Hu, Xiao-Xing Wang, Jun-Chi Yan
- 年份:2026
- Venue:arXiv.org
- DOI:10.48550/arXiv.2602.20926
- arXiv:2602.20926
- S2 citationCount(当前快照):1
- 来源线索:https://doi.org/10.48550/arXiv.2602.20926
摘要(未核验)
Large Language Models (LLMs) often struggle with inherent knowledge boundaries and hallucinations, limiting their reliability in knowledge-intensive tasks. While Retrieval-Augmented Generation (RAG) mitigates these issues, it frequently overlooks structural interdependencies essential for multi-hop reasoning. Graph-based RAG approaches attempt to bridge this gap, yet they typically face trade-offs between accuracy and efficiency due to challenges such as costly graph traversals and semantic noise in LLM-generated summaries. In this paper, we propose HyperNode Expansion and Logical Path-Guided Evidence Localization strategies for GraphRAG (HELP), a novel framework designed to balance accuracy with practical efficiency through two core strategies: 1) HyperNode Expansion, which iteratively chains knowledge triplets into coherent reasoning paths abstracted as HyperNodes to capture complex structural dependencies and ensure retrieval accuracy; and 2) Logical Path-Guided Evidence Localization, which leverages precomputed graph-text correlations to map these paths directly to the corpus for superior efficiency. HELP avoids expensive random walks and semantic distortion, preserving knowledge integrity while drastically reducing retrieval latency. Extensive experiments demonstrate that HELP achieves competitive performance across multiple simple and multi-hop QA benchmarks and up to a 28.8$\times$ speedup over leading Graph-based RAG baselines.
转为正式文献前的核验清单
- [ ] 从论文、出版社、会议、ACL Anthology、OpenReview 或 arXiv 页面核对标题、作者、年份和版本。
- [ ] 核对 DOI、venue、正式链接和是否存在撤稿/版本变化。
- [ ] 阅读正文后补充方法、证据边界、结果和与现有研究的关系。
Semantic Scholar 记录用于发现候选,不是正式一手引文,也不支持对结果覆盖范围或研究质量的穷尽性判断。