The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
Information Theory
2014-11-11 v1 Computational Geometry
Data Structures and Algorithms
Functional Analysis
math.IT
Abstract
For any and , 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.
Keywords
Cite
@article{arxiv.1411.2404,
title = {The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction},
author = {Kasper Green Larsen and Jelani Nelson},
journal= {arXiv preprint arXiv:1411.2404},
year = {2014}
}