用语言模型直接生成知识图谱子图,提升对话相关性。
Generative Subgraph Retrieval for Knowledge Graph-Grounded Dialog Generation
- 基于语言模型生成子图的令牌序列,避免信息压缩瓶颈。
- 在OpenDialKG和KOMODIS上达到当前最佳性能。
- 适合需要精准知识检索的对话系统研究者。
知识图谱增强对话生成需从知识库中检索与对话相关的子图,并与对话历史融合。以往方法通常使用外部编码器(如图神经网络)对图进行表示,基于三元组与对话历史的单向量相似度进行检索,但这类编码器难以利用预训练语言模型的丰富知识,且因对话历史被抽象为单一向量导致信息瓶颈。本文提出对话生成中的生成式子图检索方法(DialogGSR),通过语言模型直接生成子图的令牌序列实现检索。为实现有效生成式检索,引入两项关键技术:(i) 基于自监督图特定标记的结构感知图线性化;(ii) 利用基于图结构邻近性的实体信息度评分进行图约束解码,确保生成结果合法且相关。DialogGSR在OpenDialKG和KOMODIS数据集上均取得当前最优性能。
原文摘要 · Abstract (English)
Knowledge graph-grounded dialog generation requires retrieving a dialog-relevant subgraph from the given knowledge base graph and integrating it with the dialog history. Previous works typically represent the graph using an external encoder, such as graph neural networks, and retrieve relevant triplets based on the similarity between single-vector representations of triplets and the dialog history. However, these external encoders fail to leverage the rich knowledge of pretrained language models, and the retrieval process is also suboptimal due to the information bottleneck caused by the single-vector abstraction of the dialog history. In this work, we propose Dialog generation with Generative Subgraph Retrieval (DialogGSR), which retrieves relevant knowledge subgraphs by directly generating their token sequences on top of language models. For effective generative subgraph retrieval, we introduce two key methods: (i) structure-aware knowledge graph linearization with self-supervised graph-specific tokens and (ii) graph-constrained decoding utilizing graph structural proximity-based entity informativeness scores for valid and relevant generative retrieval. DialogGSR achieves state-of-the-art performance in knowledge graph-grounded dialog generation, as demonstrated on OpenDialKG and KOMODIS datasets.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。