Simple Analyses of the Sparse Johnson-Lindenstrauss Transform.
From MaRDI portal
Publication:5240430
DOI10.4230/OASIcs.SOSA.2018.15zbMath1433.68486OpenAlexW2783154142MaRDI QIDQ5240430
T. S. Jayram, Michael B. Cohen, Jelani Nelson
Publication date: 25 October 2019
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8305/pdf/OASIcs-SOSA-2018-15.pdf/
Inequalities; stochastic orderings (60E15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Probability theory on linear topological spaces (60B11)
Related Items (1)
Cites Work
- Hanson-Wright inequality and sub-Gaussian concentration
- Fast dimension reduction using Rademacher series on dual BCH codes
- Finding frequent items in data streams
- A sparse Johnson
- Tabulation-Based 5-Independent Hashing with Applications to Linear Probing and Second Moment Estimation
- An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
- Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error
- Almost Optimal Explicit Johnson-Lindenstrauss Families
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- Sparser Johnson-Lindenstrauss Transforms
- Extensions of Lipschitz mappings into a Hilbert space
- Nearest-neighbor-preserving embeddings
- Nearly Tight Oblivious Subspace Embeddings by Trace Inequalities
- The Restricted Isometry Property of Subsampled Fourier Matrices
- The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
- An Improved Estimate in the Restricted Isometry Problem
- New constructions of RIP matrices with fast multiplication and fewer rows
- A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables
This page was built for publication: Simple Analyses of the Sparse Johnson-Lindenstrauss Transform.
