Fast dimension reduction using Rademacher series on dual BCH codes

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 1-9

  Ailon, Nir ^a,b   Liberty, Edo ^c,d  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b GOOGLE INC   (United States)

^c YALE UNIVERSITY   (United States)

^d AIR FORCE OFFICE OF SCIENTIFIC RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BCH CODES; BOSE CHAUDHURI HOCQUENGHEM (BCH) CODES; DIMENSION REDUCTION (DR); MEASURE CONCENTRATIONS; RUNNING TIME;

BANACH SPACES; COMPUTER PROGRAMMING; FOURIER TRANSFORMS; INFORMATION THEORY; PROGRAMMING THEORY; TOPOLOGY;

CODES (SYMBOLS);

EID: 51849152634     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. Contemporary Mathematics, 26:189-206, 1984.
2. 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.
3. P. Frankl and H. Maehara. The Johnson-Lindenstrauss lemma and the sphericity of some graphs. Journal of Combinatorial Theory Series A, 44:355-362, 1987.
4. Piotr Indyk and Rajeev Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), pages 604-613, 1998.
5. J. Matousek. On variants of the Johnson-Lindenstrauss lemma. Private communication, 2006.
6. Eyal Kushilevitz, Rafail Ostrovsky, and Yuval Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM Journal on Computing, 30(2):457-474, 2000.
7. N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2(4):285-318, 1988.
8. Rosa I. Arriaga and Santosh Vempala. An algorithmic theory of learning: Robust concepts and random projection. In FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, page 616, Washington, DC, USA, 1999. IEEE Computer Society.
9. Piotr Indyk. On approximate nearest neighbors in non - Euclidean spaces. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 148-155, 1998.
10. Santosh Vempala. The Random Projection Method. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 2004.
11. Tamás Sarlós. Improved approximation algorithms for large matrices via random projections. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Berkeley, CA, 2006.
12. Sariel Har-Peled. A replacement for Voronoi diagrams of near linear size. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 94-103, Las Vegas, Nevada, USA, 2001.
13. Noga Alon. Problems and results in extremal combinatorics-I. Discrete Mathematics, 273(1-3):31-53, 2003.
14. Madhu Sudan. Essential coding theory (class notes).
15. Subhash Khot. Hardness of approximating thee shortest vector problem in lattices. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2004.
16. Nir Ailon and Bernard Chazelle. Lower bounds for linear degeneracy testing. J. ACM, 52(2):157-171, 2005.
17. 1. ECCC, 2007.
18. P. Indyk. Uncertainty principles, extractors, and explicit embeddings of 12 into 11. In Proceedings of the 39th Annual ACM Symposium on the Theory of Computing, 2007.
19. S. Artstein-Avidan and V. Milman. Logarithmic reduction of the level of randomness in some probabilistic geometric constructions. SIAM Journal on Computing, 1(34):67-v88, 2004.
20. Alan M. Frieze, Ravi Kannan, and Santosh Vempala. Fast monte-carlo algorithms for finding low-rank approximations. In IEEE Symposium on Foundations of Computer Science, pages 370-378, 1998.
21. Petros Drineas and Ravi Kannan. Fast monte-carlo algorithms for approximate matrix multiplication. In IEEE Symposium on Foundations of Computer Science, pages 452-459, 2001.
22. P. Drineas, R. Kannan, and M. Mahoney. Fast monte carlo algorithms for matrices ii: Computing a low-rank approximation to a matrix, 2004.
23. P. Drineas, R. Kannan, and M. Mahoney. Fast monte carlo algorithms for matrices iii: Computing a compressed approximate matrix decomposition, 2004.
24. Franco Woolfe, Edo Liberty, Vladimir Rokhlin, and Mark Tygert. A fast randomized algorithm for the approximation of matrices. Yale Computer Science Technical Reports, YALE/DCS/TR1380, 2007.
25. P. Drineas, M. w. Mahoney, S. Muthukrishnan, and T. Sarlos. Faster least squares approximation. http://arxiv.org/abs/0710.1435, 2007.
26. J. Bergh and J. Lofstrom. Interpolation Spaces. Springer-Verlag, 1976.
27. M. Ledoux and M. Talagrand. Probability in Banach Spaces: Isoperimetry and Processes. Springer-Verlag, 1991.
28. F.J. MacWilliams and N.J.A. Sloane. The Theory of Error Correcting Codes. North-Holland, 1983.
29. Carsten Schütt Hermann König and Nicole Tomczak Jaegermann. Projection constants of symmetric spaces and variants of khintchine's inequality. J. Reine Angew. Math, 511:1-42, 1999.