Knowledge Editing with Dynamic Knowledge Graphs for Multi-Hop Question Answering
Yifan Lu, Yigeng Zhou, Jing Li, Yequan Wang, Xuebo Liu, Daojing He, Fangming Liu, Min Zhang
TL;DR
The paper tackles the challenge of multi-hop question answering when knowledge becomes outdated by introducing KeDkg, a knowledge-editing framework that uses a dynamic knowledge graph as an external, editable knowledge source. It separates question decomposition from the base model and employs a fine-grained retrieval mechanism with entity and relation detectors to fetch edited facts, while a conflict-detection module handles secondary edits. The approach achieves state-of-the-art performance on the MQUAKE benchmarks, showing substantial improvements in hop-wise and multi-hop accuracy, and even matching or surpassing some black-box models with a relatively small open-model base. The work demonstrates the practicality and robustness of dynamic knowledge graphs for maintaining accurate, up-to-date reasoning in MHQA scenarios, with broad applicability to open-source and opaque LLMs alike.
Abstract
Multi-hop question answering (MHQA) poses a significant challenge for large language models (LLMs) due to the extensive knowledge demands involved. Knowledge editing, which aims to precisely modify the LLMs to incorporate specific knowledge without negatively impacting other unrelated knowledge, offers a potential solution for addressing MHQA challenges with LLMs. However, current solutions struggle to effectively resolve issues of knowledge conflicts. Most parameter-preserving editing methods are hindered by inaccurate retrieval and overlook secondary editing issues, which can introduce noise into the reasoning process of LLMs. In this paper, we introduce KEDKG, a novel knowledge editing method that leverages a dynamic knowledge graph for MHQA, designed to ensure the reliability of answers. KEDKG involves two primary steps: dynamic knowledge graph construction and knowledge graph augmented generation. Initially, KEDKG autonomously constructs a dynamic knowledge graph to store revised information while resolving potential knowledge conflicts. Subsequently, it employs a fine-grained retrieval strategy coupled with an entity and relation detector to enhance the accuracy of graph retrieval for LLM generation. Experimental results on benchmarks show that KEDKG surpasses previous state-of-the-art models, delivering more accurate and reliable answers in environments with dynamic information.
