针对多跳问答的复杂语义,提出自适应图学习框架提升检索准确性。
Question-Adaptive Graph Learning for Multi-hop Retrieval Augmented Generation
- 构建多层级知识图谱,按信息粒度建模问题理解
- 问答自适应图神经网络使高跳数问答准确率提升33.8%
- 适合需要精准多步推理的问答系统研发者
检索增强生成(RAG)通过引入外部知识源提升了大语言模型的能力。然而,涉及多步推理的复杂问题对现有RAG系统构成挑战,因其难以充分理解复杂语义结构,并在多目标检索中易受无关噪声干扰。为此,本文提出一种新型多跳问题检索的图表示学习框架。首先构建多信息层级知识图(Multi-L KG),以更全面地建模多跳问题的信息层次。在此基础上,设计问答自适应图神经网络(Quest-GNN),采用层内与层间消息传递机制,且每轮聚合由问题引导,实现细粒度信息整合并显著降低噪声影响。为增强鲁棒性表征能力,进一步提出两种合成数据生成策略用于预训练Quest-GNN。大量实验表明,该框架在多跳场景下效果显著,尤其在高跳数问题上性能提升达33.8%。代码已开源:https://github.com/Jerry2398/QSGNN。
原文摘要 · Abstract (English)
Retrieval-augmented generation (RAG) has demonstrated its ability to enhance Large Language Models (LLMs) by integrating external knowledge sources. However, multi-hop questions, which require the identification of multiple knowledge targets to form a synthesized answer, raise new challenges for RAG systems. Under the multi-hop settings, existing methods often struggle to fully understand the questions with complex semantic structures and are susceptible to irrelevant noise during the retrieval of multiple information targets. To address these limitations, we propose a novel graph representation learning framework for multi-hop question retrieval. We first introduce a Multi-information Level Knowledge Graph (Multi-L KG) to model various information levels for a more comprehensive understanding of multi-hop questions. Based on this, we design a Question-Adaptive Graph Neural Network (Quest-GNN) for representation learning on the Multi-L KG. Quest-GNN employs intra/inter-level message passing mechanisms, and in each message passing the information aggregation is guided by the question, which not only facilitates multi-granular information aggregation but also significantly reduces the impact of noise. To enhance its ability to learn robust representations, we further propose two synthesized data generation strategies for pre-training the Quest-GNN. Extensive experimental results demonstrate the effectiveness of our framework in multi-hop scenarios, especially in high-hop questions the improvement can reach 33.8\%. The code is available at: https://github.com/Jerry2398/QSGNN.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。