We aim to improve question answering (QA) by decomposing hard questions into easier sub-questions that existing QA systems can answer. Since collecting labeled decompositions is cumbersome, we propose an unsupervised approach to produce sub-questions . Specifically, by leveraging >10M questions from Common Crawl, we learn to map from the distribution of multi-hop questions to the distribution of single-hop sub-questions. We answer sub-questions with an off-the-shelf QA model and incorporate the resulting answers in a downstream, multi-hop QA system. On a popular multi-hop QA dataset, HotpotQA, we show large improvements over a strong baseline , especially on adversarial and out-of-domain questions. Our method is generally applicable and automatically learns to decompose questions of different classes , while matching the performance of decomposition methods that rely heavily on hand-engineering and annotation .
We aim to improve question answering (QA) by decomposing hard questions into simpler sub-questions that existing QA systems are capable of answering. Since labeling questions with decompositions is cumbersome, we take an unsupervised approach to produce sub-questions , also enabling us to leverage millions of questions from the internet. Specifically, we propose an algorithm for One-to-N Unsupervised Sequence transduction (ONUS) that learns to map one hard, multi-hop question to many simpler, single-hop sub-questions. We answer sub-questions with an off-the-shelf QA model and give the resulting answers to a recomposition model that combines them into a final answer. We show large QA improvements on HotpotQA over a strong baseline on the original, out-of-domain , and multi-hop dev sets. ONUS automatically learns to decompose different kinds of questions , while matching the utility of supervised and heuristic decomposition methods for QA and exceeding those methods in fluency. Qualitatively, we find that using sub-questions is promising for shedding light on why a QA system makes a prediction .
R
easier
simpler
R
can answer. Since collecting labeled
are capable of answering. Since labeling questions with
R
propose
take
R
. Specifically, by leveraging >10M questions from Common Crawl, we learn to map from the distribution of
, also enabling us to leverage millions of questions from the internet. Specifically, we propose an algorithm for One-to-N Unsupervised Sequence transduction (ONUS) that learns to map one hard,
R
questions to the distribution of
question to many simpler,
R
incorporate
give
R
in a downstream, multi-hop QA system. On a popular multi-hop QA dataset, HotpotQA, we show large improvements
to a recomposition model that combines them into a final answer. We show large QA improvements on HotpotQA
R
, especially on adversarial and
on the original,
R
questions. Our method is generally applicable and
, and multi-hop dev sets. ONUS
R
questions of different classes
different kinds of questions
R
performance of decomposition methods that rely heavily on hand-engineering and annotation
utility of supervised and heuristic decomposition methods for QA and exceeding those methods in fluency. Qualitatively, we find that using sub-questions is promising for shedding light on why a QA system makes a prediction