English

Optimal Boolean Locality-Sensitive Hashing

Discrete Mathematics 2018-12-05 v1

Abstract

For 0β<α<10 \leq \beta < \alpha < 1 the distribution H\mathcal{H} over Boolean functions h ⁣:{1,1}d{1,1}h \colon \{-1, 1\}^d \to \{-1, 1\} that minimizes the expression \begin{equation*} \rho_{\alpha, \beta} = \frac{\log(1/\Pr_{\substack{h \sim \mathcal{H} \\ (x, y) \text{ α\alpha-corr.}}}[h(x) = h(y)])}{\log(1/\Pr_{\substack{h \sim \mathcal{H} \\ (x, y) \text{ β\beta-corr.}}}[h(x) = h(y)])} \end{equation*} assigns nonzero probability only to members of the set of dictator functions h(x)=±xih(x) = \pm x_i.

Keywords

Cite

@article{arxiv.1812.01557,
  title  = {Optimal Boolean Locality-Sensitive Hashing},
  author = {Tobias Christiani},
  journal= {arXiv preprint arXiv:1812.01557},
  year   = {2018}
}
R2 v1 2026-06-23T06:31:32.846Z