mlsanityData to 7 Oct 2026

Choose Your QA Model Wisely: A Systematic Study of Generative and Extractive Readers for Question Answering

arXiv 2203.07522 ↗First posted 14 Mar 2022cs.CLcited by 11

Not on the map. Why?

Abstract (arXiv)

While both extractive and generative readers have been successfully applied to the Question Answering (QA) task, little attention has been paid toward the systematic comparison of them. Characterizing the strengths and weaknesses of the two readers is crucial not only for making a more informed reader selection in practice but also for developing a deeper understanding to foster further research on improving readers in a principled manner. Motivated by this goal, we make the first attempt to systematically study the comparison of extractive and generative readers for question answering. To be aligned with the state-of-the-art, we explore nine transformer-based large pre-trained language models (PrLMs) as backbone architectures. Furthermore, we organize our findings under two main categories: (1) keeping the architecture invariant, and (2) varying the underlying PrLMs. Among several interesting findings, it is important to highlight that (1) the generative readers perform better in long context QA, (2) the extractive readers perform better in short context while also showing better out-of-domain generalization, and (3) the encoder of encoder-decoder PrLMs (e.g., T5) turns out to be a strong extractive reader and outperforms the standard choice of encoder-only PrLMs (e.g., RoBERTa). We also study the effect of multi-task learning on the two types of readers varying the underlying PrLMs and perform qualitative and quantitative diagnosis to provide further insights into future directions in modeling better readers.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 24 of its 32 references that are in the map. First posted on arXiv 14 Mar 2022.

Builds on

24 of 32 references.

References · 24

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  5. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  6. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
  7. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
  8. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  9. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  10. 2014Conditional Generative Adversarial Netscited by 2,152
  11. 2020Leveraging Passage Retrieval with Generative Models for Open Domain Question Answeringcited by 1,203
  12. 2021Cross-Task Generalization via Natural Language Crowdsourcing Instructionscited by 696
12 more
  1. 2018CoQA: A Conversational Question Answering Challengecited by 674
  2. 2020UnifiedQA: Crossing Format Boundaries With a Single QA Systemcited by 475
  3. 2018QuAC : Question Answering in Contextcited by 379
  4. 2016Bidirectional Attention Flow for Machine Comprehensioncited by 278
  5. 2019MRQA 2019 Shared Task: Evaluating Generalization in Reading Comprehensioncited by 183
  6. 2021Reframing Instructional Prompts to GPTk's Languagecited by 176
  7. 2020Answering Complex Open-Domain Questions with Multi-Hop Dense Retrievalcited by 160
  8. 2021UnitedQA: A Hybrid Approach for Open Domain Question Answeringcited by 42
  9. 2021General-Purpose Question-Answering with Macawcited by 40
  10. 2022Improving Biomedical Information Retrieval with Neural Retrieverscited by 20
  11. 2020Our Evaluation Metric Needs an Update to Encourage Generalizationcited by 12
  12. 2021Pruning the Index Contents for Memory Efficient Open-Domain QAcited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 5; 2023: 1; 2024: 4; 2025: 0; 2026: 1.

11 papers.