mlsanityData to 14 Oct 2026

Can Open-Domain QA Reader Utilize External Knowledge Efficiently like Humans?

arXiv 2211.12707 ↗First posted 23 Nov 2022cs.CL cs.IRcited by 10

Not on the map. Why?

Abstract (arXiv)

Recent state-of-the-art open-domain QA models are typically based on a two stage retriever-reader approach in which the retriever first finds the relevant knowledge/passages and the reader then leverages that to predict the answer. Prior work has shown that the performance of the reader usually tends to improve with the increase in the number of these passages. Thus, state-of-the-art models use a large number of passages (e.g. 100) for inference. While the reader in this approach achieves high prediction performance, its inference is computationally very expensive. We humans, on the other hand, use a more efficient strategy while answering: firstly, if we can confidently answer the question using our already acquired knowledge then we do not even use the external knowledge, and in the case when we do require external knowledge, we don't read the entire knowledge at once, instead, we only read that much knowledge that is sufficient to find the answer. Motivated by this procedure, we ask a research question "Can the open-domain QA reader utilize external knowledge efficiently like humans without sacrificing the prediction performance?" Driven by this question, we explore an approach that utilizes both 'closed-book' (leveraging knowledge already present in the model parameters) and 'open-book' inference (leveraging external knowledge). Furthermore, instead of using a large fixed number of passages for open-book inference, we dynamically read the external knowledge in multiple 'knowledge iterations'. Through comprehensive experiments on NQ and TriviaQA datasets, we demonstrate that this dynamic reading approach improves both the 'inference efficiency' and the 'prediction accuracy' of the reader. Comparing with the FiD reader, this approach matches its accuracy by utilizing just 18.32% of its reader inference cost and also outperforms it by achieving up to 55.10% accuracy on NQ Open.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 48 of its 55 references that are in the map. First posted on arXiv 23 Nov 2022.

Builds on

48 of 55 references.

References · 48

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  2. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,297
  3. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  4. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  5. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
  6. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
  7. 2020REALM: Retrieval-Augmented Language Model Pre-Trainingcited by 2,141
  8. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,245
  9. 2020Leveraging Passage Retrieval with Generative Models for Open Domain Question Answeringcited by 1,210
  10. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
  11. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,167
  12. 2020Exploiting Cloze Questions for Few Shot Text Classification and Natural Language Inferencecited by 938
36 more
  1. 2017Reading Wikipedia to Answer Open-Domain Questionscited by 777
  2. 2020How Much Knowledge Can You Pack Into the Parameters of a Language Model?cited by 719
  3. 2019Improved Knowledge Distillation via Teacher Assistantcited by 573
  4. 2019Q-BERT: Hessian Based Ultra Low Precision Quantization of BERTcited by 359
  5. 2020Parameter-Efficient Transfer Learning with Diff Pruningcited by 352
  6. 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 332
  7. 2020DynaBERT: Dynamic BERT with Adaptive Width and Depthcited by 251
  8. 2020Selective Question Answering under Domain Shiftcited by 238
  9. 2019Structured Pruning of Large Language Modelscited by 203
  10. 2021PAQ: 65 Million Probably-Asked Questions and What You Can Do With Themcited by 200
  11. 2020TernaryBERT: Distillation-aware Ultra-low Bit BERTcited by 148
  12. 2020Learning Dense Representations of Phrases at Scalecited by 91
  13. 2019BAM! Born-Again Multi-Task Networks for Natural Language Understandingcited by 85
  14. 2022Compression of Generative Pre-trained Language Models via Quantizationcited by 79
  15. 2019A Discrete Hard EM Approach for Weakly Supervised Question Answeringcited by 78
  16. 2020Length-Adaptive Transformer: Train Once with Length Drop, Use Anytime with Searchcited by 76
  17. 2021Towards Zero-Label Language Learningcited by 76
  18. 2022Investigating Selective Prediction Approaches Across Several Tasks in IID, OOD, and Adversarial Settingscited by 66
  19. 2019Answering Complex Open-domain Questions Through Iterative Query Generationcited by 60
  20. 2019Unsupervised Question Answering by Cloze Translationcited by 59
  21. 2021Efficient Passage Retrieval with Hashing for Open-domain Question Answeringcited by 53
  22. 2021NeurIPS 2020 EfficientQA Competition: Systems, Analyses and Lessons Learnedcited by 52
  23. 2020SPARTA: Efficient Open-Domain Question Answering via Sparse Transformer Matching Retrievalcited by 50
  24. 2019Multi-step Retriever-Reader Interaction for Scalable Open-domain Question Answeringcited by 48
  25. 2022Model Cascading: Towards Jointly Improving Efficiency and Accuracy of NLP Systemscited by 44
  26. 2020A Memory Efficient Baseline for Open Domain Question Answeringcited by 32
  27. 2018Ranking Paragraphs for Improving Answer Recall in Open-Domain Question Answeringcited by 24
  28. 2022DQ-BART: Efficient Sequence-to-Sequence Model via Joint Distillation and Quantizationcited by 23
  29. 2020Towards Improving Selective Prediction Ability of NLP Systemscited by 20
  30. 2021Will this Question be Answered? Question Filtering via Answer Model Distillation for Efficient Question Answeringcited by 19
  31. 2022AdapLeR: Speeding up Inference by Adaptive Length Reductioncited by 19
  32. 2022ILDAE: Instance-Level Difficulty Analysis of Evaluation Datacited by 17
  33. 2018Adaptive Document Retrieval for Deep Question Answeringcited by 16
  34. 2022Choose Your QA Model Wisely: A Systematic Study of Generative and Extractive Readers for Question Answeringcited by 11
  35. 2022A Study on the Efficiency and Generalization of Light Hybrid Retrieverscited by 7
  36. 2021Unsupervised Natural Language Inference Using PHL Triplet Generationcited by 6

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 7; 2024: 0; 2025: 2.

10 papers.