Optimal bounds for johnson-lindenstrauss transforms and streaming problems with sub-constant error

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 1-10

  Jayram, T S ^a   Woodruff, David ^a  

^a IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERRORS; VECTOR SPACES;

COMMUNICATION COMPLEXITY; COMMUNICATION GAMES; DIMENSIONALITY REDUCTION TECHNIQUES; ERROR PROBABILITIES; JOHNSON-LINDENSTRAUSS TRANSFORMS; MULTIPLICATIVE FACTORS; PRODUCT DISTRIBUTIONS; THEORETICAL COMPUTER SCIENCE;

PROBABILITY DISTRIBUTIONS;

EID: 79955729456     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.1     Document Type: Conference Paper

References (44)

1. Dimitris Achlioptas. Database-friendly random projections: Johnson-lindenstrauss with binary coins. J. Comput. Syst. Sci., 66(4):671-687, 2003.
2. Nir Ailon and Bernard Chazelle. The fast johnson- lindenstrauss transform and approximate nearest neighbors. SIAM J. Comput., 39(1):302-322, 2009.
3. Nir Ailon and Bernard Chazelle. Faster dimension reduction. Commun. ACM, 53(2):97-104, 2010.
4. Nir Ailon and Edo Liberty. Fast dimension reduction using rademacher series on dual bch codes. Discrete & Computational Geometry, 42(4):615-630, 2009.
5. Nir Ailon and Edo Liberty. Almost optimal unrestricted fast johnson-lindenstrauss transform. CoRR, abs/1005.5513, 2010.
6. Noga Alon. Problems and results in extremal coinbinatorics-i. Discrete Mathematics, 273(1-3):31- 53, 2003.
7. Noga Alon, Yossi Matias, and Mario Szegedy. The Space Complexity of Approximating the Frequency Moments. J. Comput. Syst. Sci., 58(1):137-147, 1999.
8. Rosa I. Arriaga and Santosh Vempala. An algorithmic theory of learning: Robust concepts and random projection. In FOCS, pages 616-623, 1999. (Pubitemid 30539946)
9. Khanh Do Ba, Piotr Indyk, Eric C. Price, and David P. Woodruff. Lower bounds for sparse recovery. In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), to appear, 2010.
10. Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, and Ravi Kumar. The sketching complexity of pattern matching. In 8th International Workshop on Randomization and Computation (RANDOM), pages 261-272, 2004.
11. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar. Information theory methods in communication complexity. In Proceedings of the 17th Annual IEEE Conference on Computational Complexity (CCC), pages 93-102, 2002. (Pubitemid 34691899)
12. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, and Luca Trevisan. Counting distinct elements in a data stream. In Randomization and Approximation Techniques, 6th International Workshop (RANDOM), pages 1-10, 2002.
13. Boaz Barak, Mark Braverman, Xi Chen, and Anup Rao. How to compress interactive communication. In STOC, pages 67-76, 2010.
14. Emmanuel J. Candès and Terence Tao. Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Transactions on Information Theory, 52(12):5406-5425, 2006. (Pubitemid 46445381)
15. Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, and Andrew Chi-Chih Yao. Informational complexity and the direct sum problem for simultaneous message complexity. In FOCS, pages 270-278, 2001. (Pubitemid 33068387)
16. Moses Charikar, Kevin Chen, and Martin Farach-Colton. Finding frequent items in data streams. In ICALP, pages 693-703, 2002.
17. Kenneth L. Clarkson. Tighter bounds for random projections of manifolds. In Symposium on Computational Geometry, pages 39-48, 2008.
18. Kenneth L. Clarkson and David P. Woodruff. Numerical linear algebra in the streaming model. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), pages 205-214, 2009.
19. Thomas Cover and Joy Thomas. Elements of Information Theory. Wiley Interscience, 1991.
20. Anirban Dasgupta, Ravi Kumar, and Tamás Sarlós. A sparse johnson: Lindenstrauss transform. In STOC, pages 341-350, 2010.
21. Sanjoy Dasgupta and Anupam Gupta. An elementary proof of a theorem of johnson and lindenstrauss. Random Struct. Algorithms, 22(1):60-65, 2003.
22. Petros Drineas, Michael W. Mahoney, S. Muthukrishnan, and Tamás Sarlós. Faster least squares approximation. CoRR, abs/0710.1435, 2007.
23. Prahladh Harsha, Rahul Jain, David A. McAllester, and Jaikuinar Radhakrishnan. The communication complexity of correlation. In IEEE Conference on Computational Complexity, pages 10-23, 2007. (Pubitemid 47485120)
24. Piotr Indyk. Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM, 53(3):307-323, 2006. (Pubitemid 44180740)
25. Piotr Indyk and Rajeev Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In STOC, pages 604-613, 1998.
26. Piotr Indyk and David P. Woodruff. Tight lower bounds for the distinct elements problem. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 283-, 2003.
27. Rahul Jain, Pranab Sen, and Jaikumar Radhakrishnan. Optimal direct sum and privacy trade-off results for quantum and classical communication complexity. CoRR, abs/0807.1267, 2008.
28. Daniel M. Kane, Jelani Nelson, and David P. Woodruff. On the exact space complexity of sketching and streaming small norms. In SODA, 2010.
29. Daniel M. Kane, Jelani Nelson, and David P. Woodruff. An optimal algorithm for the distinct elements problem. In PODS, pages 41-52, 2010.
30. Ilan Kremer, Noam Nisan, and Dana Ron. On randomized one-round communication complexity. Computational Complexity, 8(1):21-49, 1999.
31. Eyal Kushilevitz and Noain Nisan. Communication Complexity. Cambridge University Press, 1997.
32. J. Langford, L. Li, and A. Strehl. Vowpal wabbit online learning. Technical report, 2007.
33. Edo Liberty, Nir Ailon, and Amit Singer. Dense fast random projections and lean walsh transforms. In APPROX-RANDOM, pages 512-522, 2008.
34. Jirì Matousek. On variants of the johnson-lindenstrauss lemma. Random Struct. Algorithms, 33(2):142-156, 2008.
35. Peter Bro Miltersen, Noam Nisan, Shmuel Safra, and Avi Wigderson. On data structures and asymmetric communication complexity. J. Comput. Syst. Sci., 57(1):37-49, 1998. (Pubitemid 128428156)
36. S. Muthukrishnan. Data Streams: Algorithms and Applications. Foundations and Trends in Theoretical Computer Science, 1(2):117-236, 2005. (Pubitemid 44111222)
37. V. Rokhlin, A. Szlam, and M. Tygert. A randomized algorithm for principal component analysis. SIAM Journal on Matrix Analysis and Applications, 31(3):1100-1124, 2009.
38. Tamás Sarlós. Improved approximation algorithms for large matrices via random projections. In FOCS, pages 143-152, 2006. (Pubitemid 351175504)
39. Q. Shi, J. Petterson, G. Dror, J. Langford, A. J. Smola, A. Strehl, and V. Vishwanathan. Hash kernels. In AISTATS 12, 2009.
40. Daniel A. Spielman and Nikhil Srivastava. Graph sparsification by effective resistances. In STOC, pages 563-568, 2008.
41. Divesh Srivastava and Suresh Venkatasubramanian. Information theory for data management. In SIGMOD'10: Proceedings of the 2010 international conference on Management of data, pages 1255-1256, New York, NY, USA, 2010. ACM.
42. Mikkel Thorup and Yin Zhang. Tabulation based 4-universal hashing with applications to second moment estimation. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 615-624, 2004.
43. Kilian Q. Weinberger, Anirban Dasgupta, Josh Attenberg, John Langford, and Alex J. Smola. Feature hashing for large scale multitask learning. CoRR, abs/0902.2206, 2009.
44. David P. Woodruff. Optimal space lower bounds for all frequency moments. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 167-175, 2004.