ArcRAG:面向知识图谱的智能体组合式检索
ArcRAG: Agentic Compositional Retrieval over Knowledge Graphs
AI总结:
ArcRAG通过推理时生成查询局部图接口,实现跨构建方式的知识图谱检索,解决现有GraphRAG检索策略与图谱构建绑定的问题,提升检索可移植性。
摘要:
基于图的检索增强生成(GraphRAG)通过对从语料库构建的知识图谱进行检索来回答问题。然而,现有检索策略是围绕其自身构建流程产生的结构设计的,且很少测试其在构建方式改变时是否仍能有效工作。本文研究这种跨构建可移植性:即一种检索程序在不针对特定构建的模式、关系名称或重新调整的情况下,当图谱构建方式不同时是否仍保持有效。我们提出ArcRAG,它在推理时生成查询局部图接口(问题所命名实体可访问的节点标签、关系描述符和属性键),规划针对该接口的多跳遍历,并将其作为Cypher语句执行与修复。我们将MuSiQue、HotpotQA和TriviaQA三个语料库分别构建为模式引导图谱(带类型节点、封闭关系集、来源出处)和开放信息抽取图谱(无类型节点、自由文本关系),且在两种图谱上固定检索器配置。我们与构建无关的Direct-Cypher智能体对比,在两种图谱上针对重试和通过预算对各阶段进行消融实验,并与现有GraphRAG系统的结果对比,多数现有系统将检索与自身图谱构建共同设计。在两种构建方式下,我们发现检索无需与图谱共同设计:查询时接口生成可使构建无关的检索器在构建改变时保持有效,尽管构建仍会影响绝对准确率。
英文摘要:
Graph-based retrieval-augmented generation (GraphRAG) answers questions by retrieving over a knowledge graph built from a corpus. Yet retrieval strategies are designed around the structure their own construction pipeline produces, and whether they survive a change of construction is rarely tested. We study this cross-construction portability: whether one retrieval procedure, with no construction-specific schema, relation names, or retuning, stays effective when the graph is built differently. We introduce ArcRAG, which induces a query-local graph interface at inference time (the node labels, relation descriptors, and property keys reachable from the entities a question names), plans multi-hop traversals against it, and executes and repairs them as Cypher. We build each of the MuSiQue, HotpotQA, and TriviaQA corpora as a schema-guided graph (typed nodes, a closed relation set, source provenance) and as an open-information-extraction graph (untyped nodes, free-text relations), with the retriever's configuration fixed across them. We compare against a construction-agnostic Direct-Cypher agent, ablate each stage across retry and pass budgets on both graph families, and compare with results reported for prior GraphRAG systems, most of which design retrieval together with their own graph construction. Across the two constructions, we find that retrieval need not be co-designed with the graph: query-time interface induction keeps a construction-agnostic retriever effective when the construction changes, although construction still shapes absolute accuracy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。