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&gt;1$ and $0&lt;\varepsilon&lt;1/2$, we show the existence of an n<sup>O(1)n<sup>{O(1)}-point subset XX of R<sup>n\mathbb{R}<sup>n such that any linear map from (X,2)(X,\ell_2) to 2<sup>m\ell_2<sup>m with distortion at most 1+ε1+\varepsilon must have m=Ω(minn,ε<sup>2log</sup>n)m = \Omega(\min{n, \varepsilon<sup>{-2}\log</sup> 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/ε)\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.