mlsanityData to 7 Oct 2026

On Single and Multiple Representations in Dense Passage Retrieval

arXiv 2108.06279 ↗First posted 13 Aug 2021cs.IR cs.CLcited by 3

Not on the map. Why?

Abstract (arXiv)

The advent of contextualised language models has brought gains in search effectiveness, not just when applied for re-ranking the output of classical weighting models such as BM25, but also when used directly for passage indexing and retrieval, a technique which is called dense retrieval. In the existing literature in neural ranking, two dense retrieval families have become apparent: single representation, where entire passages are represented by a single embedding (usually BERT's [CLS] token, as exemplified by the recent ANCE approach), or multiple representations, where each token in a passage is represented by its own embedding (as exemplified by the recent ColBERT approach). These two families have not been directly compared. However, because of the likely importance of dense retrieval moving forward, a clear understanding of their advantages and disadvantages is paramount. To this end, this paper contributes a direct study on their comparative effectiveness, noting situations where each method under/over performs w.r.t. each other, and w.r.t. a BM25 baseline. We observe that, while ANCE is more efficient than ColBERT in terms of response time and memory usage, multiple representations are statistically more effective than the single representations for MAP and MRR@10. We also show that multiple representations obtain better improvements than single representations for queries that are the hardest for BM25, as well as for definitional queries, and those with complex information needs.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 13 of its 19 references that are in the map. First posted on arXiv 13 Aug 2021.

Builds on

13 of 19 references.

References · 13

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  3. 2017Billion-scale similarity search with GPUscited by 2,477
  4. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
  5. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
  6. 2020Overview of the TREC 2019 deep learning trackcited by 282
  7. 2020Pretrained Transformers for Text Ranking: BERT and Beyondcited by 266
  8. 2019Deeper Text Understanding for IR with Contextual Neural Language Modelingcited by 111
  9. 2019CEDR: Contextualized Embeddings for Document Rankingcited by 77
  10. 2020Efficient Document Re-Ranking for Transformers by Precomputing Term Representationscited by 44
  11. 2020Declarative Experimentation in Information Retrieval using PyTerriercited by 29
  12. 2020Expansion via Prediction of Importance with Contextualizationcited by 26
1 more
  1. 2019Let's measure run time! Extending the IR replicability infrastructure to include performance aspectscited by 10

Built on by

Cited by year (2026 to 7 Oct)

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

3 papers.