Set-level margin training that ranks complete gold-compatible passage sets above incomplete or noisy ones, implemented with ParaSet exploration and SetCE reranking, improves multi-hop retrieval and QA and complements document-level CE.
Multi-hop Reading Comprehension through Question Decomposition and Rescoring
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Multi-hop Reading Comprehension (RC) requires reasoning and aggregation across several paragraphs. We propose a system for multi-hop RC that decomposes a compositional question into simpler sub-questions that can be answered by off-the-shelf single-hop RC models. Since annotations for such decomposition are expensive, we recast sub-question generation as a span prediction problem and show that our method, trained using only 400 labeled examples, generates sub-questions that are as effective as human-authored sub-questions. We also introduce a new global rescoring approach that considers each decomposition (i.e. the sub-questions and their answers) to select the best final answer, greatly improving overall performance. Our experiments on HotpotQA show that this approach achieves the state-of-the-art results, while providing explainable evidence for its decision making in the form of sub-questions.
fields
cs.IR 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration
Set-level margin training that ranks complete gold-compatible passage sets above incomplete or noisy ones, implemented with ParaSet exploration and SetCE reranking, improves multi-hop retrieval and QA and complements document-level CE.