arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1509.02897cs.DScs.CGcs.IR
收藏

实用的最佳角距离LSH

Practical and Optimal LSH for Angular Distance

Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya Razenshteyn, Ludwig Schmidt

摘要:

我们证明了存在一个局部敏感哈希(LSH)家庭的角距离,产生一个近似的近邻搜索算法的渐近最优的运行时间指数。与具有此属性的早期算法(例如,球形LSH [Andoni,Indyk,Nguyen,Razenshteyn 2014],[Andoni,Razenshteyn 2015]),我们的算法也是实用的,在实践中改进了研究良好的超平面LSH [Charikar,2002]。我们还介绍了该算法的多探针版本,并进行实验评估真实和合成数据集。我们补充了上述积极的结果与细粒度的下限的质量的任何LSH家庭的角距离。我们的下限意味着上述LSH家族表现出评估时间和质量之间的权衡,这对于LSH函数的自然类来说接近于最优。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑