Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction

Published 10 Nov 2014 in cs.IT, cs.CG, cs.DS, math.FA, and math.IT | (1411.2404v1)

Abstract: For any $n>1$ and $0<\varepsilon<1/2$, we show the existence of an $n{O(1)}$-point subset $X$ of $\mathbb{R}n$ such that any linear map from $(X,\ell_2)$ to $\ell_2m$ with distortion at most $1+\varepsilon$ must have $m = \Omega(\min{n, \varepsilon{-2}\log n})$. Our lower bound matches the upper bounds provided by the identity matrix and the Johnson-Lindenstrauss lemma, improving the previous lower bound of Alon by a $\log(1/\varepsilon)$ factor.

Citations (65)

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.

Collections

Sign up for free to add this paper to one or more collections.