arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.12756cs.CL
收藏

基于多跳稠密检索的复杂开放域问题检索

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

University of California, Santa Barbara(加利福尼亚大学圣巴巴拉分校);Facebook AI(脸书人工智能研究院);University of Massachusetts Amherst(马萨诸塞大学阿默斯特分校);University College London(伦敦大学学院)

Wenhan Xiong, Xiang Lorraine Li, Srini Iyer, Jingfei Du, Patrick Lewis, William Yang Wang, Yashar Mehdad, Wen-tau Yih, Sebastian Riedel, Douwe Kiela, Barlas Oğuz

摘要:

我们提出了一个简单而有效的多跳稠密检索方法来回答复杂的开放域问题,实现了两个多跳数据集,HotpotQA和多证据FEVER的最先进的性能。与以前的工作相反,我们的方法不需要访问任何特定于语料库的信息,如文档间的超链接或人类注释的实体标记,并可以应用于任何非结构化的文本语料库。我们的系统还产生了更好的效率-准确性权衡,与HotpotQA上公布的最佳准确性相匹配,同时推理速度快10倍。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑