mlsanityData to 7 Oct 2026

DC-BERT: Decoupling Question and Document for Efficient Contextual Encoding

arXiv 2002.12591 ↗First posted 28 Feb 2020cs.CLcited by 20

Not on the map. Why?

Abstract (arXiv)

Recent studies on open-domain question answering have achieved prominent performance improvement using pre-trained language models such as BERT. State-of-the-art approaches typically follow the "retrieve and read" pipeline and employ BERT-based reranker to filter retrieved documents before feeding them into the reader module. The BERT retriever takes as input the concatenation of question and each retrieved document. Despite the success of these approaches in terms of QA accuracy, due to the concatenation, they can barely handle high-throughput of incoming questions each with a large collection of retrieved documents. To address the efficiency problem, we propose DC-BERT, a decoupled contextual encoding framework that has dual BERT models: an online BERT which encodes the question only once, and an offline BERT which pre-encodes all the documents and caches their encodings. On SQuAD Open and Natural Questions Open datasets, DC-BERT achieves 10x speedup on document retrieval, while retaining most (about 98%) of the QA performance compared to state-of-the-art approaches for open-domain question answering.

Key facts. Cited by 20 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Feb 2020.

Builds on

No reference list yet.

Built on by

Cited by year

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

20 papers.

Sort:

By area:

  1. 2021Retrieving and Reading: A Comprehensive Survey on Open-domain Question Answeringcited by 178
  2. 2022How Does SimSiam Avoid Collapse Without Negative Samples? A Unified Understanding with Self-supervised Contrastive Learningcited by 65
  3. 2022Dual Temperature Helps Contrastive Learning Without Many Negative Samples: Towards Understanding and Simplifying MoCocited by 52
  4. 2022Decoupled Adversarial Contrastive Learning for Self-supervised Adversarial Robustnesscited by 20
  5. 2021Exploring Dense Retrieval for Dialogue Response Selectioncited by 11
  6. 2023EmbedDistill: A Geometric Knowledge Distillation for Information Retrievalcited by 11
  7. 2022On the Pros and Cons of Momentum Encoder in Self-Supervised Visual Representation Learningcited by 10
  8. 2021SDR: Efficient Neural Re-ranking using Succinct Document Representationcited by 7
  9. 2025Prior-Fitted Networks Scale to Larger Datasets When Treated as Weak Learnerscited by 7
  10. 2024Generalized Contrastive Learning for Multi-Modal Retrieval and Rankingcited by 6
  11. 2021Contextualizing Meta-Learning via Learning to Decomposecited by 5
  12. 2023DimCL: Dimensional Contrastive Learning For Improving Self-Supervised Learningcited by 4
8 more
  1. 2022Once is Enough: A Light-Weight Cross-Attention for Fast Sentence Pair Modelingcited by 2
  2. 2024Bootstrapped Pre-training with Dynamic Identifier Prediction for Generative Retrievalcited by 2
  3. 2025Multimodal semantic retrieval for product searchcited by 2
  4. 2021Decoupled Transformer for Scalable Inference in Open-domain Question Answeringcited by 1
  5. 2023Geo-Encoder: A Chunk-Argument Bi-Encoder Framework for Chinese Geographic Re-Rankingcited by 1
  6. 2025Automating AI Failure Tracking: Semantic Association of Reports in AI Incident Databasecited by 1
  7. 2021Roof-Transformer: Divided and Joined Understanding with Knowledge Enhancementcited by 0
  8. 2022Brand Celebrity Matching Model Based on Natural Language Processingcited by 0