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

research
06/15/2021

Analysing Dense Passage Retrieval for Multi-hop Question Answering

We analyse the performance of passage retrieval models in the presence o...
research
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 ...
research
08/12/2023

Performance Prediction for Multi-hop Questions

We study the problem of Query Performance Prediction (QPP) for open-doma...
research
09/14/2021

Adaptive Information Seeking for Open-Domain Question Answering

Information seeking is an essential step for open-domain question answer...
research
12/21/2022

Multi-hop Evidence Retrieval for Cross-document Relation Extraction

Relation Extraction (RE) has been extended to cross-document scenarios b...
research
07/25/2021

Hybrid Autoregressive Solver for Scalable Abductive Natural Language Inference

Regenerating natural language explanations for science questions is a ch...
research
09/17/2020

Generation-Augmented Retrieval for Open-domain Question Answering

Conventional sparse retrieval methods such as TF-IDF and BM25 are simple...

Please sign up or login with your details

Forgot password? Click here to reset