Optimal Bounds for Johnson-Lindenstrauss Transformations

by   Michael Burr, et al.

In 1984, Johnson and Lindenstrauss proved that any finite set of data in a high-dimensional space can be projected to a lower-dimensional space while preserving the pairwise Euclidean distance between points up to a bounded relative error. If the desired dimension of the image is too small, however, Kane, Meka, and Nelson (2011) and Jayram and Woodruff (2013) independently proved that such a projection does not exist. In this paper, we provide a precise asymptotic threshold for the dimension of the image, above which, there exists a projection preserving the Euclidean distance, but, below which, there does not exist such a projection.


page 1

page 2

page 3

page 4


TopoMap: A 0-dimensional Homology Preserving Projection of High-Dimensional Data

Multidimensional Projection is a fundamental tool for high-dimensional d...

A Distance-preserving Matrix Sketch

Visualizing very large matrices involves many formidable problems. Vario...

UnProjection: Leveraging Inverse-Projections for Visual Analytics of High-Dimensional Data

Projection techniques are often used to visualize high-dimensional data,...

GeodesicEmbedding (GE): A High-Dimensional Embedding Approach for Fast Geodesic Distance Queries

In this paper, we develop a novel method for fast geodesic distance quer...

Reconstruction of surfaces with ordinary singularities from their silhouettes

We present algorithms for reconstructing, up to unavoidable projective a...

Convex Optimization Learning of Faithful Euclidean Distance Representations in Nonlinear Dimensionality Reduction

Classical multidimensional scaling only works well when the noisy distan...