Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with subconstant error

ACM Transactions on Algorithms

Volumn 9, Issue 3, 2013, Pages

  Jayram, T S ^a   Woodruff, David P ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Communication complexity; Data streams; Distinct elements; Entropy; Frequency moments

Indexed keywords

COMMUNICATION COMPLEXITY; DATA STREAM; DIMENSIONALITY REDUCTION TECHNIQUES; DISTINCT ELEMENTS; FREQUENCY MOMENTS; JOHNSON-LINDENSTRAUSS TRANSFORMS; MULTIPLICATIVE FACTORS; THEORETICAL COMPUTER SCIENCE;

COMMUNICATION; DATA COMMUNICATION SYSTEMS; ENTROPY; PROBABILITY DISTRIBUTIONS; VECTOR SPACES;

OPTIMIZATION;

EID: 84880148890     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/2483699.2483706     Document Type: Conference Paper

References (55)

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. 2009. The fast Johnson-Lindenstrauss transform and approximate nearest neighbors. SIAM J. Comput. 39, 1, 302-322.
3. Nir Ailon and Bernard Chazelle. 2010. Faster dimension reduction. Commun. ACM 53, 2, 97-104.
4. Nir Ailon and Edo Liberty. 2009. Fast dimension reduction using rademacher series on dual BCH codes. Disc. Computat. Geom. 42, 4, 615-630.
5. Nir Ailon and Edo Liberty. 2010. Almost optimal unrestricted fast Johnson-Lindenstrauss transform. CoRR abs/1005.5513.
6. Noga Alon. 2003. Problems and results in extremal combinatorics-I. Disc. Math. 273, 1-3, 31-53.
7. Noga Alon, Yossi Matias, and Mario Szegedy. 1999. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58, 1, 137-147.
8. Alexandr Andoni, Robert Krauthgamer, and Krzysztof Onak. 2010. Streaming algorithms from precision sampling. CoRR abs/1011.1263.
9. Rosa I. Arriaga and Santosh Vempala. 1999. An algorithmic theory of learning: Robust concepts and random projection. In Proceedings of FOCS. 616-623. (Pubitemid 30539946)
10. Khanh Do Ba, Piotr Indyk, Eric C. Price, and David P. Woodruff. 2010. Lower bounds for sparse recovery. In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1190-1197.
11. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar. 2002. Information theory methods in communication complexity. In Proceedings of the 17th Annual IEEE Conference on Computational Complexity (CCC). 93-102. (Pubitemid 34691899)
12. Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, and Ravi Kumar. 2004. The sketching complexity of pattern matching. In Proceedings of the 8th International Workshop on Randomization and Computation (RANDOM). 261-272.
13. Boaz Barak, Mark Braverman, Xi Chen, and Anup Rao. 2010. How to compress interactive communication. In Proceedings of STOC. 67-76.
14. Vladimir Braverman and Rafail Ostrovsky. 2010. Recursive sketching for frequency moments. CoRR abs/1011.2571 (2010).
15. Harry Buhrman, Richard Cleve, and Avi Wigderson. 1998. Quantum vs. classical communication and computation. In Proceedings of STOC. 63-68.
16. Emmanuel J. Candès and Terence Tao. 2006. Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans. Inf. Theory 52, 12, 5406-5425. (Pubitemid 46445381)
17. Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, and Andrew Chi-Chih Yao. 2001. Informational complexity and the direct sum problem for simultaneous message complexity. In Proceedings of FOCS. 270-278. (Pubitemid 33068387)
18. Moses Charikar, Kevin Chen, and Martin Farach-Colton. 2002. Finding frequent items in data streams. In Proceedings of ICALP. 693-703.
19. Kenneth L. Clarkson. 2008. Tighter bounds for random projections of manifolds. In Proceedings of the Symposium on Computational Geometry. 39-48.
20. Kenneth L. Clarkson and David P. Woodruff. 2009. Numerical linear algebra in the streaming model. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC). 205-214.
21. Graham Cormode and S. Muthukrishnan. 2003. Estimating dominance norms of multiple data streams. In Proceedings of ESA. 148-160.
22. Thomas Cover and Joy Thomas. 1991. Elements of Information Theory. Wiley Interscience.
23. Anirban Dasgupta, Ravi Kumar, and Taḿas Sarĺos. 2010. A sparse Johnson: Lindenstrauss transform. In Proceedings of STOC. 341-350.
24. Sanjoy Dasgupta and Anupam Gupta. 2003. An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algor. 22, 1, 60-65.
25. Petros Drineas, Michael W. Mahoney, S. Muthukrishnan, and Taḿas Sarĺos. 2007. Faster least squares approximation. CoRR abs/0710.1435 (2007).
26. Sumit Ganguly. 2011. Polynomial estimators for high frequency moments. CoRR abs/1104.4552 (2011).
27. Anna C. Gilbert, Yi Li, Ely Porat, and Martin J. Strauss. 2010. Approximate sparse recovery: Optimizing time and measurements. In Proceedings of STOC. 475-484.
28. Prahladh Harsha, Rahul Jain, David A. McAllester, and Jaikumar Radhakrishnan. 2007. The communication complexity of correlation. In Proceedings of the IEEE Conference on Computational Complexity. 10-23. (Pubitemid 47485120)
29. Piotr Indyk. 2006. Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM 53, 3, 307-323. (Pubitemid 44180740)
30. Piotr Indyk and Rajeev Motwani. 1998. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of STOC. 604-613.
31. Piotr Indyk and David P. Woodruff. 2003. Tight lower bounds for the distinct elements problem. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS). 283-288.
32. Rahul Jain, Pranab Sen, and Jaikumar Radhakrishnan. 2008. Optimal direct sum and privacy trade-off results for quantum and classical communication complexity. CoRR abs/0807.1267 (2008).
33. Hossein Jowhari, Mert Saglam, and Ǵabor Tardos. 2011. Tight bounds for LP samplers, finding duplicates in streams, and related problems. In Proceedings of PODS. 49-58.
34. Daniel M. Kane, Jelani Nelson, and David P. Woodruff. 2010a. On the exact space complexity of sketching and streaming small norms. In Proceedings of SODA.
35. Daniel M. Kane, Jelani Nelson, and David P. Woodruff. 2010b. An optimal algorithmfor the distinct elements problem. In Proceedings of PODS. 41-52.
36. Ilan Kremer, Noam Nisan, and Dana Ron. 1999. On randomized one-round communication complexity. Computat. Complex. 8, 1, 21-49.
37. Eyal Kushilevitz and Noam Nisan. 1997. Communication Complexity. Cambridge University Press.
38. J. Langford, L. Li, and A. Strehl. 2007. Vowpal wabbit online learning. Tech. rep. http://hunch.net/-p=309.
39. Edo Liberty, Nir Ailon, and Amit Singer. 2008. Dense fast random projections and lean walsh transforms. In Proceedings of APPROX-RANDOM. 512-522.
40. Jir'i Matousek. 2008. On variants of the Johnson-Lindenstrauss lemma. Random Struct. Algor. 33, 2, 142-156.
41. Peter Bro Miltersen, Noam Nisan, Shmuel Safra, and Avi Wigderson. 1998. On data structures and asymmetric communication complexity. J. Comput. Syst. Sci. 57, 1, 37-49. (Pubitemid 128428156)
42. A. Pavan and Srikanta Tirthapura. 2007. Range-efficient counting of distinct elements in a massive data stream. SIAM J. Comput. 37, 2, 359-379. (Pubitemid 351584848)
43. V. Rokhlin, A. Szlam, and M. Tygert. 2009. A randomized algorithm for principal component analysis. SIAM J. Matrix Anal. Appl. 31, 3, 1100, 1124.
44. Tam'as Sarl'os. 2006. Improved approximation algorithms for large matrices via random projections. In Proceedings of FOCS. 143-152.
45. Q. Shi, J. Petterson, G. Dror, J. Langford, A. J. Smola, A. Strehl, and V. Vishwanathan. 2009. Hash kernels. In Proceedings of AISTATS 12.
46. Daniel A. Spielman and Nikhil Srivastava. 2008. Graph sparsification by effective resistances. In Proceedings of STOC. 563-568.
47. Divesh Srivastava and Suresh Venkatasubramanian. 2010. Information theory for data management. In Proceedings of the International Conference on Management of Data (SIGMOD'10). ACM, New York, 1255-1256. DOI:http://dx.doi.org/ 10.1145/1807167.1807337.
48. Stilian Stoev and Murad S. Taqqu. 2010. Max-stable sketches: Estimation of Lp-norms, dominance norms and point queries for non-negative signals. CoRR abs/1005.4344 (2010).
49. Stilian Stoev, Marios Hadjieleftheriou, George Kollios, and Murad S. Taqqu. 2007. Norm, point, and distance estimation over multiple signals using max-stable distributions. In Proceedings of ICDE. 1006-1015. (Pubitemid 47422104)
50. He Sun and Chung Keung Poon. 2009. Two improved range-efficient algorithms for F0 estimation. Theor. Comput. Sci. 410, 11, 1073-1080.
51. Mikkel Thorup and Yin Zhang. 2004. Tabulation based 4-universal hashing with applications to second moment estimation. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 615-624.
52. S. Tirthapura and D. Woodruff. 2011. Approximating the Klee's measure problem on a stream of rectangles. Manuscript.
53. Kilian Q. Weinberger, Anirban Dasgupta, Josh Attenberg, John Langford, and Alex J. Smola. 2009. Feature hashing for large scale multitask learning. CoRR abs/0902.2206 (2009).
54. David P. Woodruff. 2004. Optimal space lower bounds for all frequency moments. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 167-175.
55. David P. Woodruff. 2011. Near-optimal private approximation protocols via a black box transformation. In Proceedings of STOC. 735-744.