mlsanityData to 7 Oct 2026

Distill-VQ: Learning Retrieval Oriented Vector Quantization By Distilling Knowledge from Dense Embeddings

arXiv 2204.00185 ↗First posted 1 Apr 2022cs.IR cs.AIcited by 17

Not on the map. Why?

Abstract (arXiv)

Vector quantization (VQ) based ANN indexes, such as Inverted File System (IVF) and Product Quantization (PQ), have been widely applied to embedding based document retrieval thanks to the competitive time and memory efficiency. Originally, VQ is learned to minimize the reconstruction loss, i.e., the distortions between the original dense embeddings and the reconstructed embeddings after quantization. Unfortunately, such an objective is inconsistent with the goal of selecting ground-truth documents for the input query, which may cause severe loss of retrieval quality. Recent works identify such a defect, and propose to minimize the retrieval loss through contrastive learning. However, these methods intensively rely on queries with ground-truth documents, whose performance is limited by the insufficiency of labeled data. In this paper, we propose Distill-VQ, which unifies the learning of IVF and PQ within a knowledge distillation framework. In Distill-VQ, the dense embeddings are leveraged as "teachers", which predict the query's relevance to the sampled documents. The VQ modules are treated as the "students", which are learned to reproduce the predicted relevance, such that the reconstructed embeddings may fully preserve the retrieval result of the dense embeddings. By doing so, Distill-VQ is able to derive substantial training signals from the massive unlabeled data, which significantly contributes to the retrieval quality. We perform comprehensive explorations for the optimal conduct of knowledge distillation, which may provide useful insights for the learning of VQ based ANN index. We also experimentally show that the labeled data is no longer a necessity for high-quality vector quantization, which indicates Distill-VQ's strong applicability in practice.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). Builds on 37 of its 56 references that are in the map. First posted on arXiv 1 Apr 2022.

Builds on

37 of 56 references.

References · 37

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  3. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  4. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
  5. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  6. 2017Billion-scale similarity search with GPUscited by 2,477
  7. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
  8. 2020Big Self-Supervised Models are Strong Semi-Supervised Learnerscited by 1,375
  9. 2019Self-training with Noisy Student improves ImageNet classificationcited by 1,304
  10. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
  11. 2014Convolutional Neural Networks for Sentence Classificationcited by 1,124
  12. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
25 more
  1. 2019Latent Retrieval for Weakly Supervised Open Domain Question Answeringcited by 691
  2. 2019Patient Knowledge Distillation for BERT Model Compressioncited by 502
  3. 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 410
  4. 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
  5. 2021Unsupervised Corpus Aware Language Model Pre-training for Dense Passage Retrievalcited by 203
  6. 2021RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-rankingcited by 175
  7. 2020Embedding-based Retrieval in Facebook Searchcited by 155
  8. 2020Pre-training Tasks for Embedding-based Large-scale Retrievalcited by 153
  9. 2020Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillationcited by 143
  10. 2019Learning Dense Representations for Entity Retrievalcited by 122
  11. 2021Adversarial Retriever-Ranker for dense text retrievalcited by 82
  12. 2021Embedding-based Product Retrieval in Taobao Searchcited by 50
  13. 2016Approximate Nearest Neighbor Search on High Dimensional Data --- Experiments, Analyses, and Improvement (v1.0)cited by 44
  14. 2021AdsGNN: Behavior-Graph Augmented Relevance Modeling in Sponsored Searchcited by 38
  15. 2018Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighborscited by 37
  16. 2019Differentiable Product Quantization for End-to-End Embedding Compressioncited by 36
  17. 2021Jointly Optimizing Query Encoder and Product Quantization to Improve Retrieval Performancecited by 35
  18. 2021SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Searchcited by 35
  19. 2021Pre-trained Language Model for Web-scale Retrieval in Baidu Searchcited by 31
  20. 2021Learning Discrete Representations via Constrained Clustering for Effective and Efficient Dense Retrievalcited by 27
  21. 2021Training Large-Scale News Recommenders with Pretrained Language Models in the Loopcited by 18
  22. 2021Joint Learning of Deep Retrieval Model and Product Quantization based Embedding Indexcited by 11
  23. 2021Linear-Time Self Attention with Codeword Histogram for Efficient Recommendationcited by 7
  24. 2022Progressively Optimized Bi-Granular Document Representation for Scalable Embedding Based Retrievalcited by 7
  25. 2021Matching-oriented Product Quantization For Ad-hoc Retrievalcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 4; 2023: 4; 2024: 5; 2025: 3; 2026: 1.

17 papers.

Sort:

By area: