Answering Complex Open-Domain Questions with Multi-Hop Dense Retrieval

09/27/2020
by   Wenhan Xiong, et al.
0

We propose a simple and efficient multi-hop dense retrieval approach for answering complex open-domain questions, which achieves state-of-the-art performance on two multi-hop datasets, HotpotQA and multi-evidence FEVER. Contrary to previous work, our method does not require access to any corpus-specific information, such as inter-document hyperlinks or human-annotated entity markers, and can be applied to any unstructured text corpus. Our system also yields a much better efficiency-accuracy trade-off, matching the best published accuracy on HotpotQA while being 10 times faster at inference time.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/15/2021

Analysing Dense Passage Retrieval for Multi-hop Question Answering

We analyse the performance of passage retrieval models in the presence o...
10/23/2020

Retrieve, Rerank, Read, then Iterate: Answering Open-Domain Questions of Arbitrary Complexity from Text

Current approaches to open-domain question answering often make crucial ...
09/14/2021

Adaptive Information Seeking for Open-Domain Question Answering

Information seeking is an essential step for open-domain question answer...
02/07/2021

Memory Augmented Sequential Paragraph Retrieval for Multi-hop Question Answering

Retrieving information from correlative paragraphs or documents to answe...
04/13/2021

Multi-Step Reasoning Over Unstructured Text with Beam Dense Retrieval

Complex question answering often requires finding a reasoning chain that...
09/17/2020

Generation-Augmented Retrieval for Open-domain Question Answering

Conventional sparse retrieval methods such as TF-IDF and BM25 are simple...
07/25/2021

Hybrid Autoregressive Solver for Scalable Abductive Natural Language Inference

Regenerating natural language explanations for science questions is a ch...