Fast Binary Embeddings with Gaussian Circulant Matrices: Improved Bounds
Authors:
- 13 February 2018
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 60 (3) , 599-626
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- European Research Council (StG 258926)
- Deutsche Forschungsgemeinschaft (SPP 1798)
This publication has 10 references indexed in Scilit:
- Sparser Johnson-Lindenstrauss TransformsJournal of the ACM, 2014
- Dimension Reduction by Random Hyperplane TessellationsDiscrete & Computational Geometry, 2013
- An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss TransformACM Transactions on Algorithms, 2013
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse VectorsIEEE Transactions on Information Theory, 2013
- Restricted Isometry of Fourier Matrices and List Decodability of Random Linear CodesSIAM Journal on Computing, 2013
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming ApproachIEEE Transactions on Information Theory, 2012
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry PropertySIAM Journal on Mathematical Analysis, 2011
- A sparse Johnson2010
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest NeighborsSIAM Journal on Computing, 2009
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995