用传播激活算法提升知识图谱增强型检索生成系统的多跳推理能力
Leveraging Spreading Activation for Improved Document Retrieval in Knowledge-Graph-Based RAG Systems
- 基于自动构建的异构知识图谱,用传播激活机制检索文档
- 在多跳问答任务中比基线方法提升39%答案正确率
- 无需依赖高质量知识图谱或大模型引导,适合小模型部署
尽管已有多种架构取得初步成功,检索增强生成系统在复杂推理任务中仍难以可靠获取并关联多步证据。现有RAG框架通常认为所有检索信息具有同等可靠性,忽视了大规模文本语料中信息的可信度差异与关联性。GraphRAG通过引入知识图谱结构化信息、捕捉实体关系并支持多步逻辑遍历,提供潜在改进。然而,其性能受限于高质量图表示,而这类表示往往依赖昂贵的人工维护知识图谱,或不可靠的自动化构建流程。此外,主流方法依赖大语言模型引导图遍历与证据检索。本文提出一种新RAG框架,利用传播激活算法从由自动构建的异构知识图谱连接的文档集合中检索信息。该方法减少对语义知识图谱的依赖(后者常因信息抽取过程中的损失而不完整),避免使用大语言模型引导图遍历,并显著提升多跳问答性能。实验表明,本方法在多个SOTA RAG方法中表现更优或相当,可作为即插即用模块集成至不同迭代式RAG流水线中。结合思维链迭代检索时,相比基础RAG,在答案正确率上实现最高达39%的绝对提升,且仅使用小型开源语言模型即可达成。
原文摘要 · Abstract (English)
Despite initial successes and a variety of architectures, retrieval-augmented generation systems still struggle to reliably retrieve and connect the multi-step evidence required for complicated reasoning tasks. Most of the standard RAG frameworks regard all retrieved information as equally reliable, overlooking the varying credibility and interconnected nature of large textual corpora. GraphRAG approaches offer potential improvement to RAG systems by integrating knowledge graphs, which structure information into nodes and edges, capture entity relationships, and enable multi-step logical traversal. However, GraphRAG is not always an ideal solution, as it depends on high-quality graph representations of the corpus. Such representations usually rely on manually curated knowledge graphs, which are costly to construct and update, or on automated graph-construction pipelines that are often unreliable. Moreover, systems following this paradigm typically use large language models to guide graph traversal and evidence retrieval. In this paper, we propose a novel RAG framework that uses a spreading activation algorithm to retrieve information from a corpus of documents connected by an automatically constructed heterogeneous knowledge graph. This approach reduces reliance on semantic knowledge graphs, which are often incomplete due to information loss during information extraction, avoids LLM-guided graph traversal, and improves performance on multi-hop question answering. Experiments show that our method achieves better or comparable performance to several state-of-the-art RAG methods and can be integrated as a plug-and-play module with different iterative RAG pipelines. When combined with chain-of-thought iterative retrieval, it yields up to a 39% absolute improvement in answer correctness over naive RAG, while achieving these results with small open-weight language models.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。