Modeling Multi-hop Question Answering as Single Sequence Prediction

• URL: http://arxiv.org/abs/2205.09226v1
• Date: Wed, 18 May 2022 21:57:59 GMT
• Title: Modeling Multi-hop Question Answering as Single Sequence Prediction
• Authors: Semih Yavuz, Kazuma Hashimoto, Yingbo Zhou, Nitish Shirish Keskar, Caiming Xiong
• Abstract summary: We propose a simple generative approach (PathFid) that extends the task beyond just answer generation. PathFid explicitly models the reasoning process to resolve the answer for multi-hop questions. Our experiments demonstrate that PathFid leads to strong performance gains on two multi-hop QA datasets.
• Score: 88.72621430714985
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fusion-in-decoder (Fid) (Izacard and Grave, 2020) is a generative question answering (QA) model that leverages passage retrieval with a pre-trained transformer and pushed the state of the art on single-hop QA. However, the complexity of multi-hop QA hinders the effectiveness of the generative QA approach. In this work, we propose a simple generative approach (PathFid) that extends the task beyond just answer generation by explicitly modeling the reasoning process to resolve the answer for multi-hop questions. By linearizing the hierarchical reasoning path of supporting passages, their key sentences, and finally the factoid answer, we cast the problem as a single sequence prediction task. To facilitate complex reasoning with multiple clues, we further extend the unified flat representation of multiple input documents by encoding cross-passage interactions. Our extensive experiments demonstrate that PathFid leads to strong performance gains on two multi-hop QA datasets: HotpotQA and IIRC. Besides the performance gains, PathFid is more interpretable, which in turn yields answers that are more faithfully grounded to the supporting passages and facts compared to the baseline Fid model.

Related papers

• Understanding and Improving Zero-shot Multi-hop Reasoning in Generative Question Answering [85.79940770146557]
  We decompose multi-hop questions into multiple corresponding single-hop questions. We find marked inconsistency in QA models' answers on these pairs of ostensibly identical question chains. When trained only on single-hop questions, models generalize poorly to multi-hop questions.
  arXiv  Detail & Related papers  (2022-10-09T11:48:07Z)
• Locate Then Ask: Interpretable Stepwise Reasoning for Multi-hop Question Answering [71.49131159045811]
  Multi-hop reasoning requires aggregating multiple documents to answer a complex question. Existing methods usually decompose the multi-hop question into simpler single-hop questions. We propose an interpretable stepwise reasoning framework to incorporate both single-hop supporting sentence identification and single-hop question generation.
  arXiv  Detail & Related papers  (2022-08-22T13:24:25Z)
• From Easy to Hard: Two-stage Selector and Reader for Multi-hop Question Answering [12.072618400000763]
  Multi-hop question answering (QA) is a challenging task requiring QA systems to perform complex reasoning over multiple documents. We propose a novel framework, From Easy to Hard (FE2H), to remove distracting information and obtain better contextual representations. FE2H divides both the document selector and reader into two stages following an easy-to-hard manner.
  arXiv  Detail & Related papers  (2022-05-24T02:33:58Z)
• Calibrating Trust of Multi-Hop Question Answering Systems with Decompositional Probes [14.302797773412543]
  Multi-hop Question Answering (QA) is a challenging task since it requires an accurate aggregation of information from multiple context paragraphs. Recent work in multi-hop QA has shown that performance can be boosted by first decomposing the questions into simpler, single-hop questions. We show that decomposition is an effective form of probing QA systems as well as a promising approach to explanation generation.
  arXiv  Detail & Related papers  (2022-04-16T01:03:36Z)
• Ask to Understand: Question Generation for Multi-hop Question Answering [11.626390908264872]
  Multi-hop Question Answering (QA) requires the machine to answer complex questions by finding scattering clues and reasoning from multiple documents. We propose a novel method to complete multi-hop QA from the perspective of Question Generation (QG)
  arXiv  Detail & Related papers  (2022-03-17T04:02:29Z)
• Reasoning Chain Based Adversarial Attack for Multi-hop Question Answering [0.0]
  Previous adversarial attack works usually edit the whole question sentence. We propose a multi-hop reasoning chain based adversarial attack method. Results demonstrate significant performance reduction on both answer and supporting facts prediction.
  arXiv  Detail & Related papers  (2021-12-17T18:03:14Z)
• Multi-hop Question Generation with Graph Convolutional Network [58.31752179830959]
  Multi-hop Question Generation (QG) aims to generate answer-related questions by aggregating and reasoning over multiple scattered evidence from different paragraphs. We propose Multi-Hop volution Fusion Network for Question Generation (MulQG), which does context encoding in multiple hops. Our proposed model is able to generate fluent questions with high completeness and outperforms the strongest baseline by 20.8% in the multi-hop evaluation.
  arXiv  Detail & Related papers  (2020-10-19T06:15:36Z)
• Is Multihop QA in DiRe Condition? Measuring and Reducing Disconnected Reasoning [50.114651561111245]
  Models often exploit dataset artifacts to produce correct answers, without connecting information across multiple supporting facts. We formalize such undesirable behavior as disconnected reasoning across subsets of supporting facts. Experiments suggest that there hasn't been much progress in multi-hop QA in the reading comprehension setting.
  arXiv  Detail & Related papers  (2020-05-02T11:01:07Z)
• Unsupervised Question Decomposition for Question Answering [102.56966847404287]
  We propose an algorithm for One-to-N Unsupervised Sequence Sequence (ONUS) that learns to map one hard, multi-hop question to many simpler, single-hop sub-questions. We show large QA improvements on HotpotQA over a strong baseline on the original, out-of-domain, and multi-hop dev sets.
  arXiv  Detail & Related papers  (2020-02-22T19:40:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.