An almost optimal unrestricted fast Johnson-Lindenstrauss transform

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 185-191

  Ailon, Nir ^a   Liberty, Edo ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANACH SPACES;

CONSTANT DISTORTION; DISTORTION CONSTANTS; GAUSSIAN PROCESSES; JOHNSON-LINDENSTRAUSS TRANSFORMS; N-DIMENSIONAL SPACE; RANDOM PROJECTIONS; REAL VECTOR; SPARSE RECONSTRUCTION;

VECTOR SPACES;

EID: 79955732724     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.17     Document Type: Conference Paper

References (20)

1. W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. Contemporary Mathematics, 26:189-206, 1984.
2. P. Franki and H. Maehara. The Johnson-Lindenstrauss lemma and the sphericity of some graphs. Journal of Combinatorial Theory Series A, 44:355-362, 1987.
3. S. DasGupta and A. Gupta. An elementary proof of the Johnson- Lindenstrauss lemma. Technical Report, UC Berkeley, 99-006, 1999.
4. Dimitris Achlioptas. Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J. Comput. Syst. Sci., 66(4):671-687, 2003.
5. Noga Alon. Problems and results in extremal combinatorics-I. Discrete Mathematics, 273(1-3):31- 53, 2003.
6. Tamas Sarlos. Improved approximation algorithms for large matrices via random projections. In FOCS'06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pages 143-152, Washington, DC, USA, 2006. (Pubitemid 351175504)
7. Franco Woolfe, Edo Liberty, Vladimir Rokhlin, and Mark Tygert. A fast randomized algorithm for the approximation of matrices. Applied and Computational Harmonic Analysis, 25(3):335 - 366, 2008.
8. Nir Ailon and Bernard Chazelle. Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. In Proceedings of the 38st Annual Symposium on the Theory of Compututing (STOC'), pages 557-563, Seattle, WA, 2006. (Pubitemid 44306590)
9. Nir Ailon and Bernard Chazelle. Faster dimension reduction. Commun. ACM, 53(2):97-104, 2010.
10. Nir Ailon and Edo Liberty. Fast dimension reduction using rademacher series on dual bch codes. Discrete Comput. Geom., 42(4):615-630, 2009.
11. Dasgupta A., Kumar R., and Sarlos T. A sparse johnson-lindenstrauss transform. In Proceedings of the 42nd ACM Symposium on Theorey of Computing (STOC), 2010.
12. Edo Liberty, Nir Ailon, and Amit Singer. Dense fast random projections and lean walsh transforms. In APPROX-RANDOM, pages 512-522, 2008.
13. Mark Rudelson and Roman Veshynin. On sparse reconstruction from fourier and gaussian measurements. Communications on Pure and Applied Mathematics, 61:10251045, 2008.
14. Jirí Matousek. On variants of the johnson- lindenstrauss lemma. Random Struct. Algorithms, 33(2): 142-156, 2008.
15. Emmanuel J. Candès, Justin K. Romberg, and Terence Tao. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory, 52(2):489-509, 2006. (Pubitemid 43174093)
16. David L. Donoho. Compressed sensing. IEEE Transactions on Information Theory, 52(4): 1289-1306, 2006.
17. Alfred M. Bruckstein, David L. Donoho, and Michael Elad. From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev., 51(1):34-81, 2009.
18. M. Ledoux and M. Talagrand. Probability in Banach Spaces: Isoperimetry and Processes. Springer-Verlag, 1991.
19. G. Pisier. The volume of convex bodies and Banach space geometry. Number 94 in Cambridge Tracts in Mathematics. Cambridge University Press, 1989.
20. Daniel M. Kane and Jelani Nelson. A derandomized sparse johnson-lindenstrauss transform.