Multi-hop Question Answering under Temporal Knowledge Editing

Keyuan Cheng, Gang Lin, Haoyang Fei, Yuxuan zhai, Lu Yu +3 more
3/30/2024
cs.CLcs.AIcs.LG

No confident code implementation found for this paper. 9 possible matches can be shown below.

Abstract

Multi-hop question answering (MQA) under knowledge editing (KE) has garnered significant attention in the era of large language models. However, existing models for MQA under KE exhibit poor performance when dealing with questions containing explicit temporal contexts. To address this limitation, we propose a novel framework, namely TEMPoral knowLEdge augmented Multi-hop Question Answering (TEMPLE-MQA). Unlike previous methods, TEMPLE-MQA first constructs a time-aware graph (TAG) to store edit knowledge in a structured manner. Then, through our proposed inference path, structural retrieval, and joint reasoning stages, TEMPLE-MQA effectively discerns temporal contexts within the question query. Experiments on benchmark datasets demonstrate that TEMPLE-MQA significantly outperforms baseline models. Additionally, we contribute a new dataset, namely TKEMQA, which serves as the inaugural benchmark tailored specifically for MQA with temporal scopes.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 9 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{cheng2024multihop,
  title  = {Multi-hop Question Answering under Temporal Knowledge Editing},
  author = {Keyuan Cheng and Gang Lin and Haoyang Fei and Yuxuan zhai and Lu Yu and Muhammad Asif Ali and Lijie Hu and Di Wang},
  year   = {2024},
  eprint = {2404.00492},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.00492v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2404.00492.svg)](https://codeofpaper.com/paper/2404.00492)

Discussion