TL;DR
This paper proposes a relevance filtering method for embedding-based retrieval that improves precision by mapping cosine similarity scores to interpretable scores and applying a global threshold, validated on datasets and real-world e-commerce data.
Contribution
Introduces the Cosine Adapter, a novel component that enhances filtering in embedding-based retrieval by mapping similarity scores to interpretable scores for better relevance filtering.
Findings
Significantly increased retrieval precision on MS MARCO and Walmart datasets.
Effective in real-world e-commerce search, validated through online A/B testing.
Small recall loss but improved overall search quality.
Abstract
In embedding-based retrieval, Approximate Nearest Neighbor (ANN) search enables efficient retrieval of similar items from large-scale datasets. While maximizing recall of relevant items is usually the goal of retrieval systems, a low precision may lead to a poor search experience. Unlike lexical retrieval, which inherently limits the size of the retrieved set through keyword matching, dense retrieval via ANN search has no natural cutoff. Moreover, the cosine similarity scores of embedding vectors are often optimized via contrastive or ranking losses, which make them difficult to interpret. Consequently, relying on top-K or cosine-similarity cutoff is often insufficient to filter out irrelevant results effectively. This issue is prominent in product search, where the number of relevant products is often small. This paper introduces a novel relevance filtering component (called "Cosine…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSparse Evolutionary Training
