Falconn++ A Locality-sensitive Filtering Approach For Approximate Nearest Neighbor Search | Awesome Learning to Hash Add your paper to Learning2Hash

Falconn++ A Locality-sensitive Filtering Approach For Approximate Nearest Neighbor Search

Ninh Pham, Tao Liu. Neural Information Processing Systems 2022

[Paper]    
Graph NEURIPS

We present Falconn++, a novel locality-sensitive filtering (LSF) approach for approximate nearest neighbor search on angular distance. Falconn++ can filter out potential far away points in any hash bucket before querying, which results in higher quality candidates compared to other hashing-based solutions. Theoretically, Falconn++ asymptotically achieves lower query time complexity than Falconn, an optimal locality-sensitive hashing scheme on angular distance. Empirically, Falconn++ achieves a higher recall-speed tradeoff than Falconn on many real-world data sets. Falconn++ is also competitive with HNSW, an efficient representative of graph-based solutions on high search recall regimes.

Similar Work