New ask Hacker News story: Learning to Retrieve Reasoning Paths over Wikipedia Graph for Question Answering
Learning to Retrieve Reasoning Paths over Wikipedia Graph for Question Answering
3 by vackosar | 0 comments on Hacker News.
To achieve state-of-the-art on HotpotQA, this paper learns graph-based recurrent retrieval method for reasoning paths over Wiki graph. Paper: https://ift.tt/2VmAZmV Listen: https://youtu.be/flBlTcLVErc Authors: Akari Asai, Kazuma Hashimoto, Hannaneh Hajishirzi, Richard Socher & Caiming Xiong; University of Washington Salesforce Research Allen Institute for Artificial Intelligence 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.
3 by vackosar | 0 comments on Hacker News.
To achieve state-of-the-art on HotpotQA, this paper learns graph-based recurrent retrieval method for reasoning paths over Wiki graph. Paper: https://ift.tt/2VmAZmV Listen: https://youtu.be/flBlTcLVErc Authors: Akari Asai, Kazuma Hashimoto, Hannaneh Hajishirzi, Richard Socher & Caiming Xiong; University of Washington Salesforce Research Allen Institute for Artificial Intelligence 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.
Comments
Post a Comment