Practical and optimal LSH for angular distance

Alexandr Andoni, Piotr Indyk, T.M.M. Laarhoven, Ilya Razenshteyn, Ludwig Schmidt

Onderzoeksoutput: Boek/rapportRapportAcademic

154 Citaten (Scopus)
78 Downloads (Pure)


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 [Andoni, Indyk, Nguyen, Razenshteyn 2014], [Andoni, Razenshteyn 2015]), our algorithm is also practical, improving upon the well-studied hyperplane LSH [Charikar, 2002] in practice. We also introduce a multiprobe version of this algorithm, and conduct 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.
Originele taal-2Engels
Aantal pagina's21
StatusGepubliceerd - 2015

Publicatie series

Volume1509.02897 [cs.DS]

Vingerafdruk Duik in de onderzoeksthema's van 'Practical and optimal LSH for angular distance'. Samen vormen ze een unieke vingerafdruk.

Citeer dit