通过结构化推理路径提升图RAG的准确率与效率
HELP: HyperNode Expansion and Logical Path-Guided Evidence Localization for Accurate and Efficient GraphRAG
- 用超节点扩展构建连贯推理链,捕捉复杂依赖关系
- 基于预计算相关性定位证据,实现最高28.8倍提速
- 适合需要多跳推理且对响应速度敏感的应用场景
大语言模型在知识密集型任务中常受限于固有知识边界和幻觉问题,影响可靠性。尽管检索增强生成(RAG)可缓解此问题,但通常忽略多跳推理所需结构关联。基于图的RAG虽尝试弥补,却常面临准确率与效率的权衡,如图遍历成本高、LLM摘要引入语义噪声。本文提出HELP框架,通过两大策略平衡准确性与实用性:1)超节点扩展(HyperNode Expansion),迭代将知识三元组串联为抽象的超节点,形成连贯推理路径,以捕获复杂结构依赖并保障检索精度;2)逻辑路径引导的证据定位(Logical Path-Guided Evidence Localization),利用预计算的图-文本相关性,将路径直接映射至语料库,实现高效定位。该方法避免了昂贵的随机游走与语义失真,维持知识完整性的同时显著降低检索延迟。大量实验表明,HELP在多个单跳与多跳问答基准上表现优异,相比领先图RAG基线最快提升28.8倍。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。