CVAug 5, 2023

DeDrift: Robust Similarity Search under Content Drift

arXiv:2308.02752v116 citationsh-index: 48
Originality Incremental advance
AI Analysis

This addresses the challenge of maintaining robust similarity search for media sharing sites under changing content distributions, representing a novel method for a known bottleneck.

The paper tackled the problem of content drift degrading similarity search accuracy and efficiency over time, introducing DeDrift, a method that updates embedding quantizers to adapt indexing structures on-the-fly, achieving up to 100x faster performance than full index reconstruction while nearly eliminating accuracy degradation.

The statistical distribution of content uploaded and searched on media sharing sites changes over time due to seasonal, sociological and technical factors. We investigate the impact of this "content drift" for large-scale similarity search tools, based on nearest neighbor search in embedding space. Unless a costly index reconstruction is performed frequently, content drift degrades the search accuracy and efficiency. The degradation is especially severe since, in general, both the query and database distributions change. We introduce and analyze real-world image and video datasets for which temporal information is available over a long time period. Based on the learnings, we devise DeDrift, a method that updates embedding quantizers to continuously adapt large-scale indexing structures on-the-fly. DeDrift almost eliminates the accuracy degradation due to the query and database content drift while being up to 100x faster than a full index reconstruction.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes