mlsanityData to 14 Oct 2026

Matching-oriented Product Quantization For Ad-hoc Retrieval

arXiv 2104.07858 ↗First posted 16 Apr 2021cs.CL cs.IRcited by 5

Not on the map. Why?

Abstract (arXiv)

Product quantization (PQ) is a widely used technique for ad-hoc retrieval. Recent studies propose supervised PQ, where the embedding and quantization models can be jointly trained with supervised learning. However, there is a lack of appropriate formulation of the joint training objective; thus, the improvements over previous non-supervised baselines are limited in reality. In this work, we propose the Matching-oriented Product Quantization (MoPQ), where a novel objective Multinoulli Contrastive Loss (MCL) is formulated. With the minimization of MCL, we are able to maximize the matching probability of query and ground-truth key, which contributes to the optimal retrieval accuracy. Given that the exact computation of MCL is intractable due to the demand of vast contrastive samples, we further propose the Differentiable Cross-device Sampling (DCS), which significantly augments the contrastive samples for precise approximation of MCL. We conduct extensive experimental studies on four real-world datasets, whose results verify the effectiveness of MoPQ. The code is available at https://github.com/microsoft/MoPQ.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 12 of its 28 references that are in the map. First posted on arXiv 16 Apr 2021.

Builds on

12 of 28 references.

References · 12

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
  3. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
  4. 2016Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translationcited by 1,475
  5. 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 413
  6. 2019KEPLER: A Unified Model for Knowledge Embedding and Pre-trained Language Representationcited by 356
  7. 2020Sparse, Dense, and Attentional Representations for Text Retrievalcited by 214
  8. 2020Embedding-based Retrieval in Facebook Searchcited by 156
  9. 2019Learning Dense Representations for Entity Retrievalcited by 122
  10. 2019Differentiable Product Quantization for End-to-End Embedding Compressioncited by 36
  11. 2017End-to-End Supervised Product Quantization for Image Search and Retrievalcited by 16
  12. 2019Beyond Product Quantization: Deep Progressive Quantization for Image Retrievalcited by 5

Built on by

Cited by year

Citing papers per year: 2022: 5.

5 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2021Self-supervised Product Quantization for Deep Unsupervised Image Retrieval
  2. 2021Contrastive Quantization with Code Memory for Unsupervised Image Retrieval
  3. 2024Distilling Vision-Language Pretraining for Efficient Cross-Modal Retrieval
  4. 2024Transformer-based Clipped Contrastive Quantization Learning for Unsupervised Image Retrieval
  5. 2026Matryoshka Hash Representations for Model-Aware Compact Semantic Retrieval
  6. 2025U-MARVEL: Unveiling Key Factors for Universal Multimodal Retrieval via Embedding Learning with MLLMs
  7. 2022Self-Supervised Consistent Quantization for Fully Unsupervised Image Retrieval
  8. 2022One Loss for Quantization: Deep Hashing with Discrete Wasserstein Distributional Matching