The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
From MaRDI portal
Publication:4598222
DOI10.4230/LIPIcs.ICALP.2016.82zbMath1394.46009arXiv1411.2404OpenAlexW2963121409MaRDI QIDQ4598222
Jelani Nelson, Kasper Green Larsen
Publication date: 19 December 2017
Full work available at URL: https://arxiv.org/abs/1411.2404
Related Items (14)
Binary vectors for fast distance and similarity estimation ⋮ Lower bounds on the low-distortion embedding dimension of submanifolds of \(\mathbb{R}^n\) ⋮ One-bit sensing, discrepancy and Stolarsky's principle ⋮ Unnamed Item ⋮ Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. ⋮ Toward a unified theory of sparse dimensionality reduction in Euclidean space ⋮ Real-valued embeddings and sketches for fast distance and similarity estimation ⋮ Dimensionality reduction with subgaussian matrices: a unified theory ⋮ Persistent homology for low-complexity models ⋮ Unnamed Item ⋮ Moments of Gaussian chaoses in Banach spaces ⋮ On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms ⋮ Paraunitary matrices, entropy, algebraic condition number and Fourier computation ⋮ Unnamed Item
This page was built for publication: The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
