An almost optimal unrestricted fast Johnson-Lindenstrauss transform

ACM Transactions on Algorithms

Volumn 9, Issue 3, 2013, Pages

  Ailon, Nir ^a   Liberty, Edo ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b YAHOO RESEARCH   (United States)

Author keywords

Compressed sensing; Johnson Lindenstrauss; Restricted isometry

Indexed keywords

CONSTANT DISTORTION; DISTORTION CONSTANTS; JOHNSON-LINDENSTRAUSS; JOHNSON-LINDENSTRAUSS TRANSFORMS; N-DIMENSIONAL SPACE; RESTRICTED ISOMETRIES; SPARSE RECONSTRUCTION; UPPER AND LOWER BOUNDS;

BANACH SPACES; COMPRESSED SENSING; LINEAR TRANSFORMATIONS; MATHEMATICAL TRANSFORMATIONS;

VECTOR SPACES;

EID: 84880159744     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/2483699.2483701     Document Type: Conference Paper

References (25)

1. Dimitris Achlioptas. 2003. Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J. Comput. Syst. Sci. 66, 4, 671-687.
2. Nir Ailon and Bernard Chazelle. 2006. Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. In Proceedings of the 38th Annual Symposium on the Theory of Compututing (STOC). 557-563. (Pubitemid 44306590)
3. Nir Ailon and Bernard Chazelle. 2010. Faster dimension reduction. Comm. ACM 53, 2, 97-104.
4. Nir Ailon and Edo Liberty. 2009. Fast dimension reduction using Rademacher series on dual BCH codes. Discr. Comput. Geom. 42, 4, 615-630.
5. Noga Alon. 2003. Problems and results in extremal combinatorics-I. Disc. Math. 273, 1-3, 31-53.
6. R. G. Baraniuk, M. A. Davenport, R. A. DeVore, and M. B. Wakin. 2008. A simple proof of the restricted isometry property for random matrices. Construct. Approx. 28, 3, 253-263.
7. Alfred M. Bruckstein, David L. Donoho, and Michael Elad. 2009. From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev. 51, 1, 34-81.
8. Emmanuel J. Candès, Justin K. Romberg, and Terence Tao. 2006. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52, 2, 489-509. (Pubitemid 43174093)
9. Kenneth L. Clarkson and David P. Woodruff. 2009. Numerical linear algebra in the streaming model. In Proceedings of STOC. 205-214.
10. Anirban Dasgupta, Ravi Kumar, and Taḿas Sarĺos. 2010. A sparse Johnson-Lindenstrauss transform. In Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC).
11. S. Dasgupta and A. Gupta. 1999. An elementary proof of the Johnson-Lindenstrauss lemma. Tech. rep., UC Berkeley, 99-006.
12. David L. Donoho. 2006. Compressed sensing. IEEE Trans. Inf. Theory 52, 4, 1289-1306.
13. P. Frankl and H. Maehara. 1987. The Johnson-Lindenstrauss lemma and the sphericity of some graphs. J. Combin. Theory Ser. A 44, 355-362.
14. Aicke Hinrichs and Jan Vyb'iral. 2011. Johnson-Lindenstrauss lemma for circulant matrices. Rand. Struct. Algor. 39, 3, 391-398.
15. T. S. Jayram and David Woodruff. 2011. Optimal bounds for Johnson Lindenstrauss transforms and streaming problems with sub-constant error. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'11). 1-10.
16. William B. Johnson and Joram Lindenstrauss. 1984. Extensions of Lipschitz mappings into a Hilbert space. Contemp. Math. 26, 189-206.
17. Felix Krahmer and Rachel Ward. 2011. New and improved Johnson-Lindenstrauss embeddings via the restricted isometry property. SIAM J. Math. Anal. 43, 1269-1281.
18. Michel Ledoux and Michel Talagrand. 1991. Probability in Banach Spaces: Isoperimetry and Processes. Springer-Verlag.
19. Edo Liberty, Nir Ailon, and Amit Singer. 2008. Dense fast random projections and Lean Walsh transforms. In Proceedings of APPROX-RANDOM. 512-522.
20. Jir'i Matousek. 2008. On variants of the Johnson-Lindenstrauss lemma. Rand. Struct. Algor. 33, 2, 142-156.
21. Gilles Pisier. 1989. The Volume of Convex Bodies and Banach Space Geometry. Number 94 in Cambridge Tracts in Mathematics. Cambridge University Press.
22. Mark Rudelson and Roman Veshynin. 2008. On sparse reconstruction from Fourier and Gaussian measurements. Commun. Pure Appl. Math. 61, 1025-1045.
23. Tam'as Sarl'os. 2006. Improved approximation algorithms for large matrices via random projections. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06). 143-152.
24. Jan Vybral. 2011. A variant of the Johnson Lindenstrauss lemma for circulant matrices. J. Funct. Anal. 260, 4, 1096-1105.
25. Franco Woolfe, Edo Liberty, Vladimir Rokhlin, and Mark Tygert. 2008. A fast randomized algorithm for the approximation of matrices. Appl. Computat. Harm. Anal. 25, 3, 335-366.