Practical and Optimal LSH for Angular Distance | Awesome Learning to Hash Add your paper to Learning2Hash

Practical and Optimal LSH for Angular Distance

A. Andoni, P. Indyk, T. Laarhoven. NIPS 2015

[PDF] [Code] [Tutorial]    
LSH NIPS

We show the existence of a Locality-Sensitive Hashing (LSH) family for the angular distance that yields an approximate Near Neighbor Search algorithm with the asymptotically optimal running time exponent. Unlike earlier algorithms with this property (e.g., Spherical LSH [1, 2]), our algorithm is also practical, improving upon the well-studied hyperplane LSH [3] in practice. We also introduce a multiprobe version of this algorithm and conduct an experimental evaluation on real and synthetic data sets. We complement the above positive results with a fine-grained lower bound for the quality of any LSH family for angular distance. Our lower bound implies that the above LSH family exhibits a trade-off between evaluation time and quality that is close to optimal for a natural class of LSH functions.

Similar Work