Learning to Retrieve Reasoning Paths over Wikipedia Graph for Question Answering

Akari Asai, Kazuma Hashimoto, Hannaneh Hajishirzi, Richard Socher, Caiming Xiong
11/24/2019
cs.CL

Official code: AkariAsai/learning_to_retrieve_reasoning_paths (436 stars, MIT, last commit 2024-07-25).

Abstract

Answering questions that require multi-hop reasoning at web-scale necessitates retrieving multiple evidence documents, one of which often has little lexical or semantic relationship to the question. This paper introduces a new graph-based recurrent retrieval approach that learns to retrieve reasoning paths over the Wikipedia graph to answer multi-hop open-domain questions. Our retriever model trains a recurrent neural network that learns to sequentially retrieve evidence paragraphs in the reasoning path by conditioning on the previously retrieved documents. Our reader model ranks the reasoning paths and extracts the answer span included in the best reasoning path. Experimental results show state-of-the-art results in three open-domain QA datasets, showcasing the effectiveness and robustness of our method. Notably, our method achieves significant improvement in HotpotQA, outperforming the previous best model by more than 14 points.

View on arXivView PDF

Code Implementations(1)

MIT

The official implementation of ICLR 2020, "Learning to Retrieve Reasoning Paths over Wikipedia Graph for Question Answering".

43665Shell, PythonFeb 4, 20202 years agoMIT
hotpotqamulti-hop-reasoningnatural-questionsopen-domain-qareading-comprehension+2 more

Similar Papers

Cite this paper

@article{asai2019learning,
  title  = {Learning to Retrieve Reasoning Paths over Wikipedia Graph for Question Answering},
  author = {Akari Asai and Kazuma Hashimoto and Hannaneh Hajishirzi and Richard Socher and Caiming Xiong},
  year   = {2019},
  eprint = {1911.10470},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1911.10470}
}

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/1911.10470.svg)](https://codeofpaper.com/paper/1911.10470)

Discussion