mlsanityData to 7 Oct 2026

EmbedDistill: A Geometric Knowledge Distillation for Information Retrieval

arXiv 2301.12005 ↗First posted 27 Jan 2023cs.LGcited by 11

Not on the map. Why?

Abstract (arXiv)

Large neural models (such as Transformers) achieve state-of-the-art performance for information retrieval (IR). In this paper, we aim to improve distillation methods that pave the way for the resource-efficient deployment of such models in practice. Inspired by our theoretical analysis of the teacher-student generalization gap for IR models, we propose a novel distillation approach that leverages the relative geometry among queries and documents learned by the large teacher model. Unlike existing teacher score-based distillation methods, our proposed approach employs embedding matching tasks to provide a stronger signal to align the representations of the teacher and student models. In addition, it utilizes query generation to explore the data manifold to reduce the discrepancies between the student and the teacher where training data is sparse. Furthermore, our analysis also motivates novel asymmetric architectures for student models which realizes better embedding alignment without increasing online inference cost. On standard benchmarks like MSMARCO, we show that our approach successfully distills from both dual-encoder (DE) and cross-encoder (CE) teacher models to 1/10th size asymmetric students that can retain 95-97% of the teacher performance.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 49 of its 69 references that are in the map. First posted on arXiv 27 Jan 2023.

Builds on

49 of 69 references.

References · 49

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  5. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  6. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  7. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
  8. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
  9. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  10. 2017Billion-scale similarity search with GPUscited by 2,477
  11. 2014FitNets: Hints for Thin Deep Netscited by 1,619
  12. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
37 more
  1. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
  2. 2021Unsupervised Dense Information Retrieval with Contrastive Learningcited by 1,203
  3. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
  4. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
  5. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
  6. 2017Reading Wikipedia to Answer Open-Domain Questionscited by 777
  7. 2019Latent Retrieval for Weakly Supervised Open Domain Question Answeringcited by 691
  8. 2019Passage Re-ranking with BERTcited by 629
  9. 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 464
  10. 2021Large Dual Encoders Are Generalizable Retrieverscited by 454
  11. 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 410
  12. 2020Document Ranking with a Pretrained Sequence-to-Sequence Modelcited by 373
  13. 2022Text and Code Embeddings by Contrastive Pre-Trainingcited by 358
  14. 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
  15. 2020Distilling Knowledge from Reader to Retriever for Question Answeringcited by 226
  16. 2019Document Expansion by Query Predictioncited by 225
  17. 2020Sparse, Dense, and Attentional Representations for Text Retrievalcited by 213
  18. 2021RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-rankingcited by 175
  19. 2022Improving Passage Retrieval with Zero-Shot Question Generationcited by 164
  20. 2019Synthetic QA Corpora Generation with Roundtrip Consistencycited by 143
  21. 2020Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillationcited by 143
  22. 2022Knowledge Distillation with the Reused Teacher Classifiercited by 140
  23. 2019Deeper Text Understanding for IR with Contextual Neural Language Modelingcited by 111
  24. 2019Knowledge Distillation from Internal Representationscited by 87
  25. 2021Adversarial Retriever-Ranker for dense text retrievalcited by 82
  26. 2019CEDR: Contextualized Embeddings for Document Rankingcited by 77
  27. 2021End-to-End Training of Neural Retrievers for Open-Domain Question Answeringcited by 75
  28. 2019Context-Aware Sentence/Passage Term Importance Estimation For First Stage Retrievalcited by 65
  29. 2021Domain-matched Pre-training Tasks for Dense Retrievalcited by 53
  30. 2020Efficient Document Re-Ranking for Transformers by Precomputing Term Representationscited by 44
  31. 2020PARADE: Passage Representation Aggregation for Document Rerankingcited by 44
  32. 2020BERT-QE: Contextualized Query Expansion for Document Re-rankingcited by 40
  33. 2020DC-BERT: Decoupling Question and Document for Efficient Contextual Encodingcited by 20
  34. 2020Simplified TinyBERT: Knowledge Distillation for Document Retrievalcited by 10
  35. 2022Efficient Nearest Neighbor Search for Cross-Encoder Models using Matrix Factorizationcited by 10
  36. 2017Content-Based Weak Supervision for Ad-Hoc Re-Rankingcited by 7
  37. 2021Distantly-Supervised Evidence Retrieval Enables Question Answering without Evidence Annotationcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 3; 2024: 2; 2025: 2; 2026: 4.

11 papers.