mlsanityData to 7 Oct 2026

Encoder Adaptation of Dense Passage Retrieval for Open-Domain Question Answering

arXiv 2110.01599 ↗First posted 4 Oct 2021cs.IR cs.CLcited by 8

Not on the map. Why?

Abstract (arXiv)

One key feature of dense passage retrievers (DPR) is the use of separate question and passage encoder in a bi-encoder design. Previous work on generalization of DPR mainly focus on testing both encoders in tandem on out-of-distribution (OOD) question-answering (QA) tasks, which is also known as domain adaptation. However, it is still unknown how DPR's individual question/passage encoder affects generalization. Specifically, in this paper, we want to know how an in-distribution (IND) question/passage encoder would generalize if paired with an OOD passage/question encoder from another domain. We refer to this challenge as textitencoder adaptation. To answer this question, we inspect different combinations of DPR's question and passage encoder learned from five benchmark QA datasets on both in-domain and out-of-domain questions. We find that the passage encoder has more influence on the lower bound of generalization while the question encoder seems to affect the upper bound in general. For example, applying an OOD passage encoder usually hurts the retrieval accuracy while an OOD question encoder sometimes even improves the accuracy.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 26 of its 37 references that are in the map. First posted on arXiv 4 Oct 2021.

Builds on

26 of 37 references.

References · 26

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  4. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  5. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,895
  6. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
  7. 2020REALM: Retrieval-Augmented Language Model Pre-Trainingcited by 2,126
  8. 2019Do ImageNet Classifiers Generalize to ImageNet?cited by 1,507
  9. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
  10. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
  11. 2017Reading Wikipedia to Answer Open-Domain Questionscited by 777
  12. 2019Latent Retrieval for Weakly Supervised Open Domain Question Answeringcited by 691
14 more
  1. 2021Unsupervised Corpus Aware Language Model Pre-training for Dense Passage Retrievalcited by 203
  2. 2021Optimizing Dense Retrieval Model Training with Hard Negativescited by 154
  3. 2019End-to-End Open-Domain Question Answering with BERTserinicited by 152
  4. 2020Neural Unsupervised Domain Adaptation in NLP---A Surveycited by 142
  5. 2021Simple Entity-Centric Questions Challenge Dense Retrieverscited by 140
  6. 2021Mr. TyDi: A Multi-lingual Benchmark for Dense Retrievalcited by 118
  7. 2019Multi-passage BERT: A Globally Normalized BERT Model for Open-domain Question Answeringcited by 96
  8. 2019A Discrete Hard EM Approach for Weakly Supervised Question Answeringcited by 78
  9. 2019Real-Time Open-Domain Question Answering with Dense-Sparse Phrase Indexcited by 64
  10. 2019MultiQA: An Empirical Investigation of Generalization and Transfer in Reading Comprehensioncited by 60
  11. 2021Pyserini: An Easy-to-Use Python Toolkit to Support Replicable IR Research with Sparse and Dense Representationscited by 60
  12. 2021Efficient Passage Retrieval with Hashing for Open-domain Question Answeringcited by 53
  13. 2020A Memory Efficient Baseline for Open Domain Question Answeringcited by 32
  14. 2021Challenges in Generalization in Open Domain Question Answeringcited by 30

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 3; 2023: 1; 2024: 2; 2025: 1.

8 papers.