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 -point subset of such that any linear map from to with distortion at most must have . 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 factor.
Paper Prompts
Sign up for free to create and run prompts on this paper.