Complex Reading Comprehension Through Question Decomposition
Not on the map. Why?
Abstract (arXiv)
Multi-hop reading comprehension requires not only the ability to reason over raw text but also the ability to combine multiple evidence. We propose a novel learning approach that helps language models better understand difficult multi-hop questions and perform "complex, compositional" reasoning. Our model first learns to decompose each multi-hop question into several sub-questions by a trainable question decomposer. Instead of answering these sub-questions, we directly concatenate them with the original question and context, and leverage a reading comprehension model to predict the answer in a sequence-to-sequence manner. By using the same language model for these two components, our best seperate/unified t5-base variants outperform the baseline by 7.2/6.1 absolute F1 points on a hard subset of DROP dataset.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 16 of its 24 references that are in the map. First posted on arXiv 7 Nov 2022.
Builds on
16 of 24 references.
References · 16
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
- 2022Least-to-Most Prompting Enables Complex Reasoning in Large Language Modelscited by 1,397
- 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 883
- 2021Show Your Work: Scratchpads for Intermediate Computation with Language Modelscited by 871
- 2022Impact of Pretraining Term Frequencies on Few-Shot Reasoningcited by 142
- 2020Break It Down: A Question Understanding Benchmarkcited by 131
- 2020Unsupervised Question Decomposition for Question Answeringcited by 118
- 2022Language Model Cascadescited by 104
4 more
- 2019NumNet: Machine Reading Comprehension with Numerical Reasoningcited by 59
- 2020Question Directed Graph Attention Network for Numerical Reasoning over Textcited by 35
- 2021Decomposing Complex Questions Makes Multi-Hop QA Easier and More Interpretablecited by 35
- 2021Break, Perturb, Build: Automatic Perturbation of Reasoning Paths Through Question Decompositioncited by 11
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 1; 2025: 2.
7 papers.
- 2023Question Decomposition Improves the Faithfulness of Model-Generated Reasoningcited by 107
- 2025TreeReview: A Dynamic Tree of Questions Framework for Deep and Efficient LLM-based Scientific Peer Reviewcited by 31
- 2024Divide-or-Conquer? Which Part Should You Distill Your LLM?cited by 17
- 2023Iterated Decomposition: Improving Science Q&A by Supervising Reasoning Processescited by 15
- 2023Chain-of-Questions Training with Latent Answers for Robust Multistep Question Answeringcited by 8
- 2025POQD: Performance-Oriented Query Decomposer for Multi-vector retrievalcited by 5
- 2022When Do Decompositions Help for Machine Reading?cited by 2
- 2025TreeReview: A Dynamic Tree of Questions Framework for Deep and Efficient LLM-based Scientific Peer Review9 Jun 2025
- 2025POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval25 May 2025
- 2024Divide-or-Conquer? Which Part Should You Distill Your LLM?22 Feb 2024
- 2023Question Decomposition Improves the Faithfulness of Model-Generated Reasoning17 Jul 2023
- 2023Chain-of-Questions Training with Latent Answers for Robust Multistep Question Answering24 May 2023
- 2023Iterated Decomposition: Improving Science Q&A by Supervising Reasoning Processes4 Jan 2023
- 2022When Do Decompositions Help for Machine Reading?20 Dec 2022