English

Phase Transition in the One-bit Johnson-Lindenstrauss Lemma

Functional Analysis 2019-03-07 v1 Probability

Abstract

The Johnson-Lindenstrauss Lemma (J-L Lemma) is a cornerstone of dimension reduction techniques. We study it in the one-bit context, namely we consider the unit sphere SN1 \mathbb S ^{N-1}, with normalized geodesic metric, and map a finite set XSN1 \mathbf{X} \subset \mathbb{S}^{N-1} into the Hamming cube Hm={0,1}m\mathbb{H}_m = \{0,1\}^m, with normalized Hamming metric. We find that for 0<δ<1 0< \delta <1, and m>lnn2δ2m>\frac{\ln n}{2\delta^2} there is a δ\delta-RIP from X\mathbf{X} into Hm\mathbb{H}_m. This is surprising as the value of m m is virtually identical to best known bound linear J-L Lemma. In both the linear and one-bit case, the maps are randomly constructed. We show that the probability of BmB_m being a δ\delta-RIP satisfies a phase transition. It passes from probability of nearly zero to nearly one with a very small change in mm. Our proof relies on delicate properties of Bernoulli random variables.

Keywords

Cite

@article{arxiv.1903.02123,
  title  = {Phase Transition in the One-bit Johnson-Lindenstrauss Lemma},
  author = {Amadou Bah and Bryson Kagy and Emily Smith},
  journal= {arXiv preprint arXiv:1903.02123},
  year   = {2019}
}