Answering Complex Open-Domain Questions with Multi-Hop Dense Retrieval
Ответы на сложные вопросы в открытом домене с помощью многошагового плотного поиска
2020-09-27
SCID: 54.1/5fp9yj5x
Discuss with AI
HotpotQAmulti-evidence FEVERmulti-hop dense retrievalopen-domain question answeringunstructured text corpora
Figures from the paper
Abstract (AI)
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.
Key Findings
1
A simple and efficient multi-hop dense retrieval approach achieves state-of-the-art performance on HotpotQA and multi-evidence FEVER.
2
On HotpotQA, the system matches the best published accuracy while reducing inference time by a factor of 10, improving the efficiency-accuracy trade-off.
3
The approach applies to arbitrary unstructured text corpora rather than requiring specialized corpus structure or annotations.
4
The method answers complex open-domain questions without corpus-specific information, including inter-document hyperlinks or human-annotated entity markers.
Research Object
complex open-domain question answering over unstructured text corpora
Research Subject
the efficiency and accuracy of multi-hop dense retrieval for answering questions requiring evidence from multiple documents
Publication Details
Publication Date
2020-09-27
Journal
Publisher
ISSN
Open access PDF
Access Type
Author Information
Download PDF
Subscribe to digest