pEBR: A Probabilistic Approach to Embedding Based Retrieval (2025.emnlp-industry)
Copied to clipboard
| Challenge: | Existing embedding-based retrieval systems rely on heuristic and suboptimal cutoffs for item retrieval. |
| Approach: | They propose a probabilistic Embedding-Based Retrieval framework that learns a shared semantic representation space for both queries and items. |
| Outcome: | The proposed framework improves retrieval precision and recall, and ablation studies show it captures the differences between head-to-tail queries. |
Similar Papers
Matching-oriented Embedding Quantization For Ad-hoc Retrieval (2021.emnlp-main)
Copied to clipboard
| Challenge: | Product quantization (PQ) is a widely used technique for ad-hoc retrieval. |
| Approach: | They propose a match-oriented product quantization with a multinoulli contrastive loss objective. |
| Outcome: | The proposed method maximizes matching probability of query and ground-truth key, compared with previous methods on non-supervised datasets. |
Alleviating Performance Degradation Caused by Out-of-Distribution Issues in Embedding-Based Retrieval (2025.findings-emnlp)
Copied to clipboard
Haotong Bao, Jianjin Zhang, Qi Chen, Weihao Han, Zhengxin Zeng, Ruiheng Chang, Mingzheng Li, Hao Sun, Weiwei Deng, Feng Sun, Qi Zhang
| Challenge: | Recent studies reveal query out-of-distribution issues degrading ANN performance . a distribution regularizer is introduced into the encoder training objective to encourage alignment between query and base embeddings. |
| Approach: | They introduce a distribution regularizer into the encoder training objective to encourage alignment between query and base embeddings. |
| Outcome: | The proposed method consistently improves retrieval performance across multiple datasets. |
Improving Embedding-based Large-scale Retrieval via Label Enhancement (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for large-scale retrieval are trained with 0-1 hard labels that indicate whether a query is relevant to a document, ignoring rich information of the relevance degree. |
| Approach: | They propose to introduce label enhancement for the first time to characterize query-document relevance degree by embedding label distribution into contextual embeddables. |
| Outcome: | The proposed method significantly outperforms existing retrieval models and its counterparts equipped with two alternative methods on English and Chinese large-scale retrieval tasks. |
QuadrupletBERT: An Efficient Model For Embedding-Based Large-Scale Retrieval (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing methods for large-scale query-document retrieval are expensive and require sparse handcrafted features. |
| Approach: | They propose a quadrupletBERT model for effective and efficient retrieval using pre-trained language models like BERT. |
| Outcome: | The proposed model improves retrieval phase and leverages distances between simple negative and hard negative instances to obtain better embeddings. |
Efficient Document Retrieval by End-to-End Refining and Quantizing BERT Embedding with Contrastive Product Quantization (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing semantic hashing methods only learn a binary code for each document and use Hamming distance to evaluate document distances. |
| Approach: | They propose to leverage BERT embeddings to perform efficient retrieval based on product quantization technique . they transform original BERT embedded codewords and feed it into a probabilistic product quantizer module . |
| Outcome: | The proposed method outperforms current state-of-the-art methods on three benchmarks. |
PQR: Improving Dense Retrieval via Potential Query Modeling (2025.acl-long)
Copied to clipboard
| Challenge: | Existing training data is sparse, with each document associated with one or a few labeled queries. |
| Approach: | They propose a training-free potential query retrieval framework to address this problem . they use a Gaussian mixture distribution to model all potential queries for a document . |
| Outcome: | The proposed method is able to capture comprehensive semantic information from a document with multiple queries. |
Embedding Meta-Textual Information for Improved Learning to Rank (2020.coling-main)
Copied to clipboard
| Challenge: | a neural representation learning approach has not been extended to meta-textual information that is readily available for many IR tasks. |
| Approach: | They propose a framework that learns embeddings for meta-textual categories and optimizes a pairwise ranking objective for improved matching based on combined embedds of textual and meta-tactile information. |
| Outcome: | The proposed framework improves cross-lingual retrieval in the Wikipedia domain and Patent domain. |
Event-enhanced Retrieval in Real-time Search (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing embedding-based retrieval models face the "semantic drift" problem . a low adoption rate of retrieval results is evident in real-time search scenarios . |
| Approach: | They propose an embedding-based retrieval approach that enhances real-time retrieval performance by adding contrastive learning to the dual-encoder model. |
| Outcome: | The proposed approach improves the dual-encoder model of traditional EBR. |
CODER: An efficient framework for improving retrieval through COntextual Document Embedding Reranking (2022.emnlp-main)
Copied to clipboard
| Challenge: | Contextual document embedding reranking is an efficient and efficient retrieval framework. |
| Approach: | They propose a highly efficient retrieval framework that uses contextual document embedding reranking to incorporate ranking context into training. |
| Outcome: | The proposed framework reduces the computational overhead of a first-stage method and can be used as stand-alone retrieval models. |
Modeling Uncertainty in Composed Image Retrieval via Probabilistic Embeddings (2025.acl-long)
Copied to clipboard
Haomiao Tang, Jinpeng Wang, Yuang Peng, GuangHao Meng, Ruisheng Luo, Bin Chen, Long Chen, Yaowei Wang, Shu-Tao Xia
| Challenge: | Composed Image Retrieval (CIR) combines text and reference images to search for images . metric learning methods that focus on point embeddings fail to capture uncertainty in input data . |
| Approach: | They propose a framework that captures uncertainty in images and queries by Gaussian distributions in latent space rather than fixed points. |
| Outcome: | Experiments show that the proposed framework quantifies quality and semantic uncertainties . it can handle polysemy and ambiguity in search intentions, authors say . |