Papers
Topics
Authors
Recent
Search
2000 character limit reached

On fast bounded locality sensitive hashing

Published 19 Apr 2017 in cs.DS | (1704.05902v1)

Abstract: In this paper, we examine the hash functions expressed as scalar products, i.e., f(x)=<v,x>f(x)=<v,x>, for some bounded random vector vv. Such hash functions have numerous applications, but often there is a need to optimize the choice of the distribution of vv. In the present work, we focus on so-called anti-concentration bounds, i.e. the upper bounds of P[∣<v,x>∣<α]\mathbb{P}\left[|<v,x>| < \alpha \right]. In many applications, vv is a vector of independent random variables with standard normal distribution. In such case, the distribution of <v,x><v,x> is also normal and it is easy to approximate P[∣<v,x>∣<α]\mathbb{P}\left[|<v,x>| < \alpha \right]. Here, we consider two bounded distributions in the context of the anti-concentration bounds. Particularly, we analyze vv being a random vector from the unit ball in l∞l_{\infty} and vv being a random vector from the unit sphere in l2l_{2}. We show optimal up to a constant anti-concentration measures for functions f(x)=<v,x>f(x)=<v,x>. As a consequence of our research, we obtain new best results for \newline \textit{cc-approximate nearest neighbors without false negatives} for lpl_p in high dimensional space for all p∈[1,∞]p\in[1,\infty], for c=Ω(max⁡{d,d1/p})c=\Omega(\max\{\sqrt{d},d^{1/p}\}). These results improve over those presented in [16]. Finally, our paper reports progress on answering the open problem by Pagh~[17], who considered the nearest neighbor search without false negatives for the Hamming distance.

Authors (1)
Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.