mlsanityData to 14 Oct 2026

Answering Open-Domain Multi-Answer Questions via a Recall-then-Verify Framework

arXiv 2110.08544 ↗First posted 16 Oct 2021cs.CLcited by 11

Not on the map. Why?

Abstract (arXiv)

Open-domain questions are likely to be open-ended and ambiguous, leading to multiple valid answers. Existing approaches typically adopt the rerank-then-read framework, where a reader reads top-ranking evidence to predict answers. According to our empirical analysis, this framework faces three problems: first, to leverage a large reader under a memory constraint, the reranker should select only a few relevant passages to cover diverse answers, while balancing relevance and diversity is non-trivial; second, the small reading budget prevents the reader from accessing valuable retrieved evidence filtered out by the reranker; third, when using a generative reader to predict answers all at once based on all selected evidence, whether a valid answer will be predicted also pathologically depends on the evidence of some other valid answer(s). To address these issues, we propose to answer open-domain multi-answer questions with a recall-then-verify framework, which separates the reasoning process of each answer so that we can make better use of retrieved evidence while also leveraging large models under the same memory constraint. Our framework achieves state-of-the-art results on two multi-answer datasets, and predicts significantly more gold answers than a rerank-then-read system that uses an oracle reranker.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 23 of its 38 references that are in the map. First posted on arXiv 16 Oct 2021.

Builds on

23 of 38 references.

References · 23

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  2. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,893
  3. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
  4. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
  5. 2020Leveraging Passage Retrieval with Generative Models for Open Domain Question Answeringcited by 1,210
  6. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 849
  7. 2017Reading Wikipedia to Answer Open-Domain Questionscited by 777
  8. 2019Passage Re-ranking with BERTcited by 645
  9. 2020AmbigQA: Answering Ambiguous Open-domain Questionscited by 390
  10. 2020Document Ranking with a Pretrained Sequence-to-Sequence Modelcited by 376
  11. 2020Distilling Knowledge from Reader to Retriever for Question Answeringcited by 226
  12. 2020Generation-Augmented Retrieval for Open-domain Question Answeringcited by 186
11 more
  1. 2020Relevance-guided Supervision for OpenQA with ColBERTcited by 71
  2. 2021NeurIPS 2020 EfficientQA Competition: Systems, Analyses and Lessons Learnedcited by 52
  3. 2017Quasar: Datasets for Question Answering by Search and Readingcited by 50
  4. 2020SPARTA: Efficient Open-Domain Question Answering via Sparse Transformer Matching Retrievalcited by 50
  5. 2021Joint Passage Ranking for Diverse Multi-Answer Retrievalcited by 43
  6. 2021UnitedQA: A Hybrid Approach for Open Domain Question Answeringcited by 42
  7. 2018Read + Verify: Machine Reading Comprehension with Unanswerable Questionscited by 31
  8. 2017Evidence Aggregation for Answer Re-Ranking in Open-Domain Question Answeringcited by 24
  9. 2021What's in a Name? Answer Equivalence For Open-Domain Question Answeringcited by 21
  10. 2020Answering Ambiguous Questions through Generative Evidence Fusion and Round-Trip Predictioncited by 19
  11. 2018Multi-Passage Machine Reading Comprehension with Cross-Passage Answer Verificationcited by 17

Built on by

Cited by year

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

11 papers.