Lotusfilter: Fast Diverse Nearest Neighbor Search Via A Learned Cutoff Table | Awesome Learning to Hash Add your paper to Learning2Hash

Lotusfilter: Fast Diverse Nearest Neighbor Search Via A Learned Cutoff Table

Yusuke Matsui . 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) 2025 – 0 citations

[Code] [Paper]   Search on Google Scholar   Search on Semantic Scholar
CVPR Re-Ranking

Approximate nearest neighbor search (ANNS) is an essential building block for applications like RAG but can sometimes yield results that are overly similar to each other. In certain scenarios, search results should be similar to the query and yet diverse. We propose LotusFilter, a post-processing module to diversify ANNS results. We precompute a cutoff table summarizing vectors that are close to each other. During the filtering, LotusFilter greedily looks up the table to delete redundant vectors from the candidates. We demonstrated that the LotusFilter operates fast (0.02 [ms/query]) in settings resembling real-world RAG applications, utilizing features such as OpenAI embeddings. Our code is publicly available at https://github.com/matsui528/lotf.

Similar Work