mlsanityData to 14 Oct 2026

Distilling Dense Representations for Ranking using Tightly-Coupled Teachers

arXiv 2010.11386 ↗First posted 22 Oct 2020cs.IR cs.CLcited by 52

Not on the map. Why?

Abstract (arXiv)

We present an approach to ranking with dense representations that applies knowledge distillation to improve the recently proposed late-interaction ColBERT model. Specifically, we distill the knowledge from ColBERT's expressive MaxSim operator for computing relevance scores into a simple dot product, thus enabling single-step ANN search. Our key insight is that during distillation, tight coupling between the teacher model and the student model enables more flexible distillation strategies and yields better learned representations. We empirically show that our approach improves query latency and greatly reduces the onerous storage requirements of ColBERT, while only making modest sacrifices in terms of effectiveness. By combining our dense representations with sparse representations derived from document expansion, we are able to approach the effectiveness of a standard cross-encoder reranker using BERT that is orders of magnitude slower.

Key facts. Cited by 52 papers in the map (data through 14 Oct 2026). First posted on arXiv 22 Oct 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 11; 2022: 11; 2023: 8; 2024: 7; 2025: 7; 2026: 8.

52 papers.

Sort:

By area:

  1. 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 476
  2. 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
  3. 2021Condenser: a Pre-training Architecture for Dense Retrievalcited by 162
  4. 2021The Expando-Mono-Duo Design Pattern for Text Ranking with Pretrained Sequence-to-Sequence Modelscited by 81
  5. 2024SPLADE-v3: New baselines for SPLADEcited by 72
  6. 2022Bridging the Gap Between Indexing and Retrieval for Differentiable Search Index with Query Generationcited by 48
  7. 2021Improving Query Representations for Dense Retrieval with Pseudo Relevance Feedbackcited by 47
  8. 2022ERNIE-Search: Bridging Cross-Encoder with Dual-Encoder via Self On-the-fly Distillation for Dense Passage Retrievalcited by 41
  9. 2022Curriculum Learning for Dense Retrieval Distillationcited by 38
  10. 2021A Replication Study of Dense Passage Retrievercited by 37
  11. 2022CharacterBERT and Self-Teaching for Improving the Robustness of Dense Retrievers on Queries with Typoscited by 22
  12. 2022Introducing Neural Bag of Whole-Words with ColBERTer: Contextualized Late Interactions using Enhanced Reductioncited by 21
38 more
  1. 2022PROD: Progressive Distillation for Dense Retrievalcited by 21
  2. 2024Utilizing BERT for Information Retrieval: Survey, Applications, Resources, and Challengescited by 20
  3. 2024Planning Ahead in Generative Retrieval: Guiding Autoregressive Generation through Simultaneous Decodingcited by 19
  4. 2021Rethinking Search: Making Domain Experts out of Dilettantescited by 18
  5. 2022Trial2Vec: Zero-Shot Clinical Trial Document Similarity Search using Self-Supervisioncited by 18
  6. 2023Constructing Tree-based Index for Efficient and Effective Dense Retrievalcited by 15
  7. 2023InPars-Light: Cost-Effective Unsupervised Training of Efficient Rankerscited by 14
  8. 2021Contextual Fine-to-Coarse Distillation for Coarse-grained Response Selection in Open-Domain Conversationscited by 9
  9. 2021TLDR: Twin Learning for Dimensionality Reductioncited by 9
  10. 2022Progressively Optimized Bi-Granular Document Representation for Scalable Embedding Based Retrievalcited by 7
  11. 2025Hypencoder: Hypernetworks for Information Retrievalcited by 7
  12. 2026Learning Retrieval Models with Sparse Autoencoderscited by 6
  13. 2021CODER: An efficient framework for improving retrieval through COntextual Document Embedding Rerankingcited by 4
  14. 2022Composite Code Sparse Autoencoders for first stage retrievalcited by 4
  15. 2023ZeQR: Zero-shot Query Reformulation for Conversational Searchcited by 4
  16. 2024Measuring Bias in a Ranked List using Term-based Representationscited by 4
  17. 2024Few-shot Prompting for Pairwise Ranking: An Effective Non-Parametric Retrieval Modelcited by 4
  18. 2023Multivariate Representation Learning for Information Retrievalcited by 3
  19. 2025Uncovering the Limitations of Query Performance Prediction: Failures, Insights, and Implications for Selective Query Processingcited by 2
  20. 2025LLM-VPRF: Large Language Model Based Vector Pseudo Relevance Feedbackcited by 2
  21. 2026On the Challenges and Opportunities of Learned Sparse Retrieval for Codecited by 2
  22. 2022LoL: A Comparative Regularization Loss over Query Reformulation Losses for Pseudo-Relevance Feedbackcited by 1
  23. 2022LEAD: Liberal Feature-based Distillation for Dense Retrievalcited by 1
  24. 2025QDER: Query-Specific Document and Entity Representations for Multi-Vector Document Re-Rankingcited by 1
  25. 2026LEMUR: Learned Multi-Vector Retrievalcited by 1
  26. 2021Quality and Cost Trade-offs in Passage Re-ranking Taskcited by 0
  27. 2023Hybrid and Collaborative Passage Rerankingcited by 0
  28. 2023Online Distillation for Pseudo-Relevance Feedbackcited by 0
  29. 2023SSP: Self-Supervised Post-training for Conversational Searchcited by 0
  30. 2023Mitigating Pooling Bias in E-commerce Search via False Negative Estimationcited by 0
  31. 2024Domain Adaptation of Multilingual Semantic Search -- Literature Reviewcited by 0
  32. 2024Multi-word Term Embeddings Improve Lexical Product Retrievalcited by 0
  33. 2025Compressed Concatenation of Small Embedding Modelscited by 0
  34. 2025REGENT: Relevance-Guided Attention for Entity-Aware Multi-Vector Neural Re-Rankingcited by 0
  35. 2025A Simple and Effective Framework for Symmetric Consistent Indexing in Large-Scale Dense Retrievalcited by 0
  36. 2026Cross-Sensory Brain Passage Retrieval: Scaling Beyond Visual to Audiocited by 0
  37. 2026Towards Dynamic Dense Retrieval with Routing Strategycited by 0
  38. 2026When Does Complexity Conditioning Help a Frozen Sentence Embedding? A Controlled Study of Per-Sentence and Pair-Level Difficulty Adaptationcited by 0

50 most cited of 52 All 52 (JSON)