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 . Arxiv 2022 – 1 citation

[Paper]   Search on Google Scholar   Search on Semantic Scholar
Efficiency Evaluation Graph Based ANN Hashing Methods Locality-Sensitive-Hashing

We present Falconn++, a novel locality-sensitive filtering approach for approximate nearest neighbor search on angular distance. Falconn++ can filter out potential far away points in any hash bucket \textit{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 higher recall-speed tradeoffs 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