mlsanityData to 13 Oct 2026

From Easy to Hard: Two-stage Selector and Reader for Multi-hop Question Answering

arXiv 2205.11729 ↗First posted 24 May 2022cs.CLcited by 12

Not on the map. Why?

Abstract (arXiv)

Multi-hop question answering (QA) is a challenging task requiring QA systems to perform complex reasoning over multiple documents and provide supporting facts together with the exact answer. Existing works tend to utilize graph-based reasoning and question decomposition to obtain the reasoning chain, which inevitably introduces additional complexity and cumulative error to the system. To address the above issue, we propose a simple yet effective novel framework, From Easy to Hard (FE2H), to remove distracting information and obtain better contextual representations for the multi-hop QA task. Inspired by the iterative document selection process and the progressive learning custom of humans, FE2H divides both the document selector and reader into two stages following an easy-to-hard manner. Specifically, we first select the document most relevant to the question and then utilize the question together with this document to select other pertinent documents. As for the QA phase, our reader is first trained on a single-hop QA dataset and then transferred into the multi-hop QA task. We comprehensively evaluate our model on the popular multi-hop QA benchmark HotpotQA. Experimental results demonstrate that our method ourperforms all other methods in the leaderboard of HotpotQA (distractor setting).

Key facts. Cited by 12 papers in the map (data through 13 Oct 2026). Builds on 30 of its 37 references that are in the map. First posted on arXiv 24 May 2022.

Builds on

30 of 37 references.

References · 30

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,304
  2. 2016Layer Normalizationcited by 5,624
  3. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,133
  4. 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,716
  5. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,925
  6. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,779
  7. 2018The Web as a Knowledge-base for Answering Complex Questionscited by 409
  8. 2016Bidirectional Attention Flow for Machine Comprehensioncited by 278
  9. 2017SearchQA: A New Q&A Dataset Augmented with Context from a Search Enginecited by 222
  10. 2017Constructing Datasets for Multi-hop Reading Comprehension Across Documentscited by 190
  11. 2019Multi-hop Reading Comprehension through Question Decomposition and Rescoringcited by 119
  12. 2020Unsupervised Question Decomposition for Question Answeringcited by 118
18 more
  1. 2019Multi-passage BERT: A Globally Normalized BERT Model for Open-domain Question Answeringcited by 96
  2. 2019Compositional Questions Do Not Necessitate Multi-hop Reasoningcited by 87
  3. 2019Hierarchical Graph Network for Multi-hop Question Answeringcited by 83
  4. 2019Cognitive Graph for Multi-Hop Reading Comprehension at Scalecited by 65
  5. 2019Dynamically Fused Graph Network for Multi-hop Reasoningcited by 63
  6. 2019Avoiding Reasoning Shortcuts: Adversarial Evaluation, Training, and Model Development for Multi-Hop QAcited by 63
  7. 2019Answering Complex Open-domain Questions Through Iterative Query Generationcited by 60
  8. 2019Select, Answer and Explain: Interpretable Multi-hop Reading Comprehension over Multiple Documentscited by 57
  9. 2019Multi-hop Reading Comprehension across Multiple Documents by Reasoning over Heterogeneous Graphscited by 53
  10. 2016Dynamic Coattention Networks For Question Answeringcited by 49
  11. 2019Multi-step Retriever-Reader Interaction for Scalable Open-domain Question Answeringcited by 48
  12. 2019Answering while Summarizing: Multi-task Learning for Multi-hop QA with Evidence Extractioncited by 39
  13. 2019Multi-Hop Paragraph Retrieval for Open-Domain Question Answeringcited by 34
  14. 2018Neural Models for Reasoning over Multiple Mentions using Coreferencecited by 27
  15. 2018Efficient and Robust Question Answering from Minimal Context over Documentscited by 26
  16. 2020A Simple Yet Strong Pipeline for HotpotQAcited by 24
  17. 2018Exploring Graph-structured Passage Representation for Multi-hop Reading Comprehension with Graph Neural Networkscited by 23
  18. 2021Graph-free Multi-hop Reading Comprehension: A Select-to-Guide Strategycited by 13

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 4; 2024: 4; 2025: 2.

12 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2022Ask to Understand: Question Generation for Multi-hop Question Answering
  2. 2022Locate Then Ask: Interpretable Stepwise Reasoning for Multi-hop Question Answering
  3. 2025HopWeaver: Cross-Document Synthesis of High-Quality and Authentic Multi-Hop Questions
  4. 2025StepChain GraphRAG: Reasoning Over Knowledge Graphs for Multi-Hop Question Answering
  5. 2025BELLE: A Bi-Level Multi-Agent Reasoning Framework for Multi-Hop Question Answering
  6. 2026Retrieval--Reasoning Processes for Multi-hop Question Answering: A Four-Axis Design Framework and Empirical Trends
  7. 2022Interpretable AMR-Based Question Decomposition for Multi-hop Question Answering
  8. 2025Resource-Friendly Dynamic Enhancement Chain for Multi-Hop Question Answering