Multi-Mention Learning for Reading Comprehension with Neural Cascades
Not on the map. Why?
Abstract (arXiv)
Reading comprehension is a challenging task, especially when executed across longer or across multiple evidence documents, where the answer is likely to reoccur. Existing neural architectures typically do not scale to the entire evidence, and hence, resort to selecting a single passage in the document (either via truncation or other means), and carefully searching for the answer within that passage. However, in some cases, this strategy can be suboptimal, since by focusing on a specific passage, it becomes difficult to leverage multiple mentions of the same answer throughout the document. In this work, we take a different approach by constructing lightweight models that are combined in a cascade to find the answer. Each submodel consists only of feed-forward networks equipped with an attention mechanism, making it trivially parallelizable. We show that our approach can scale to approximately an order of magnitude larger evidence documents and can aggregate information at the representation level from multiple mentions of each answer candidate across the document. Empirically, our approach achieves state-of-the-art performance on both the Wikipedia and web domains of the TriviaQA dataset, outperforming more complex, recurrent architectures.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 2 Nov 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 1; 2024: 0; 2025: 1.
4 papers.
- 2025Universal Model Routing for Efficient LLM Inferencecited by 86
- 2021Cheap and Good? Simple and Effective Data Augmentation for Low Resource Machine Readingcited by 7
- 2021A Mutual Information Maximization Approach for the Spurious Solution Problem in Weakly Supervised Question Answeringcited by 2
- 2023Reranking Passages with Coarse-to-Fine Neural Retriever Enhanced by List-Context Informationcited by 0
- 2025Universal Model Routing for Efficient LLM Inference12 Feb 2025
- 2023Reranking Passages with Coarse-to-Fine Neural Retriever Enhanced by List-Context Information23 Aug 2023
- 2021A Mutual Information Maximization Approach for the Spurious Solution Problem in Weakly Supervised Question Answering14 Jun 2021
- 2021Cheap and Good? Simple and Effective Data Augmentation for Low Resource Machine Reading8 Jun 2021