no code implementations • 17 Dec 2019 • M. A. Iwen, D. Needell, E. Rebrova, A. Zare
The second result proven herein provides new fast JL embeddings of arbitrary $r$-dimensional subspaces $\mathcal{S} \subset \mathbb{C}^N$ which also require fewer random bits (and so are easier to store - i. e., require less space) than standard fast JL embedding methods in order to achieve small $\epsilon$-distortions.
