用图神经网络和大模型结合,让问答系统能推理缺失知识。
Leveraging LLM-GNN Integration for Open-World Question Answering over Knowledge Graphs

- 先用图神经网络找候选答案,再用大模型结合结构与语义推理
- 在不完整知识图谱上测试,准确率提升38%,最高达53.3%
- 无需微调或检索,适合需要动态推理的开放世界场景
面向不完整或动态演化知识图谱的开放世界问答(OW-QA)旨在回答无法完全依赖图谱中存在的信息的问题。传统知识图谱问答假设封闭世界,答案必须存在于图谱中,限制了实际应用。而开放世界问答需基于图结构和上下文推断缺失知识。大语言模型(LLM)擅长语言理解但缺乏结构化推理能力;图神经网络(GNN)能建模图拓扑但难以处理语义。现有系统虽整合了LLM与GNN或图检索器,但仍依赖结构嵌入而无语义支撑,且多假设路径可观测或图谱完整,难以应对缺链或多跳推理。本文提出GLOW,一种融合预训练GNN与LLM的混合系统:GNN从图结构预测前k个候选答案,将其与相关KG事实序列化为结构化提示(如三元组和候选),输入给LLM进行联合推理。该方法无需检索或微调,可协同符号与语义信号。为评估泛化能力,我们构建了涵盖多个领域的1,000题不完整知识图谱基准集GLOW-BENCH。实验表明,GLOW在标准基准和GLOW-BENCH上均优于现有系统,最高准确率达53.3%,平均提升38%。代码与数据已开源。
原文摘要 · Abstract (English)
Open-world Question Answering (OW-QA) over knowledge graphs (KGs) aims to answer questions over incomplete or evolving KGs. Traditional KGQA assumes a closed world where answers must exist in the KG, limiting real-world applicability. In contrast, open-world QA requires inferring missing knowledge based on graph structure and context. Large language models (LLMs) excel at language understanding but lack structured reasoning. Graph neural networks (GNNs) model graph topology but struggle with semantic interpretation. Existing systems integrate LLMs with GNNs or graph retrievers. Some support open-world QA but rely on structural embeddings without semantic grounding. Most assume observed paths or complete graphs, making them unreliable under missing links or multi-hop reasoning. We present GLOW, a hybrid system that combines a pre-trained GNN and an LLM for open-world KGQA. The GNN predicts top-k candidate answers from the graph structure. These, along with relevant KG facts, are serialized into a structured prompt (e.g., triples and candidates) to guide the LLM's reasoning. This enables joint reasoning over symbolic and semantic signals, without relying on retrieval or fine-tuning. To evaluate generalization, we introduce GLOW-BENCH, a 1,000-question benchmark over incomplete KGs across diverse domains. GLOW outperforms existing LLM-GNN systems on standard benchmarks and GLOW-BENCH, achieving up to 53.3% and an average 38% improvement. GitHub code and data are available.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。