Beating the direct sum theorem in communication complexity with implications for sketching

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2013, Pages 1738-1756

  Molinaro, Marco ^a   Woodruff, David P ^b   Yaroslavtsev, Grigory ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FREQUENCY ESTIMATION; QUERY PROCESSING;

COMMUNICATION COMPLEXITY; COMMUNICATION COST; ERROR PROBABILITIES; HIGH PROBABILITY; JOHNSON-LINDENSTRAUSS TRANSFORMS; MEASURE OF INFORMATION; OPTIMAL LOWER BOUND; SPACE COMPLEXITY;

PROBABILITY;

EID: 84876059444     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973105.125     Document Type: Conference Paper

References (35)

1. D. Achlioptas. Database-friendly random projections: Johnson- lindenstrauss with binary coins. Journal of Computer and System Sciences, 66(4):671-687, 2003.
2. P. K. Agarwal, G. Cormode, Z. Huang, J. M. Phillips, Z. Wei, and K. Yi. Mergeable summaries. In PODS, pages 23-34, 2012.
3. N. Alon. Perturbed identity matrices have high rank: Proof and applications. Combinatorics, Probability & Computing, 18(1-2):3-15, 2009.
4. N. Alon, P. B. Gibbons, Y. Matias, and M. Szegedy. Tracking join and self-join sizes in limited storage. J. Comput. Syst. Sci., 64(3):719-747, 2002.
5. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci., 58(1):137-147, 1999.
6. Z. Bar-Yossef, T. S. Jayram, R. Krauthgamer, and R. Kumar. The sketching complexity of pattern matching. In APPROX-RANDOM, pages 261-272, 2004.
7. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci., 68(4):702-732, 2004.
8. B. Barak, M. Braverman, X. Chen, and A. Rao. How to compress interactive communication. In STOC, pages 67-76, 2010.
9. M. Braverman and A. Rao. Information equals amortized communication. In FOCS, pages 748-757, 2011.
10. A. Chakrabarti, Y. Shi, A. Wirth, and A. C.-C. Yao. Informational complexity and the direct sum problem for simultaneous message complexity. In FOCS, pages 270-278, 2001.
11. K. L. Clarkson, E. Hazan, and D. P. Woodruff. Sublinear optimization for machine learning. In Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS '10, pages 449-457, Washington, DC, USA, 2010. IEEE Computer Society.
12. K. L. Clarkson and D. P. Woodruff. Numerical linear algebra in the streaming model. In STOC, pages 205-214, 2009.
13. T. M. Cover and J. A. Thomas. Elements of information theory (2. ed.). Wiley, 2006.
14. D. P. Dubhashi and A. Panconesi. Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, 2009.
15. T. Feder, E. Kushilevitz, M. Naor, and N. Nisan. Amortized communication complexity. SIAM J. Comput., 24(4):736-750, 1995.
16. P. Harsha, R. Jain, D. A. McAllester, and J. Radhakrishnan. The communication complexity of correlation. IEEE Transactions on Information Theory, 56(1):438-449, 2010.
17. P. Indyk. Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM, 53(3):307-323, May 2006. (Pubitemid 44180740)
18. P. Indyk. Sketching, streaming and sublinear-space algorithms. 2007. Graduate course notes, available at http://stellar.mit.edu/S/course/6/fa07/6. 895/.
19. R. Jain. New strong direct product results in communication complexity. Electronic Colloquium on Computational Complexity (ECCC), 18:24, 2011.
20. R. Jain, A. Pereszlényi, and P. Yao. A direct product theorem for bounded-round public-coin randomized communication complexity. CoRR, abs/1201.1666, 2012.
21. R. Jain, J. Radhakrishnan, and P. Sen. A direct sum theorem in communication complexity via message compression. In ICALP, pages 300-315, 2003.
22. R. Jain, P. Sen, and J. Radhakrishnan. Optimal direct sum and privacy trade-off results for quantum and classical communication complexity. CoRR, abs/0807.1267, 2008.
23. T. S. Jayram and D. P. Woodruff. Optimal bounds for johnson-lindenstrauss transforms and streaming problems with sub-constant error. In D. Randall, editor, SODA, pages 1-10. SIAM, 2011.
24. H. Jowhari, M. Saglam, and G. Tardos. Tight bounds for 1p samplers, finding duplicates in streams, and related problems. In PODS, pages 49-58, 2011.
25. D. M. Kane, J. Nelson, and D. P. Woodruff. On the exact space complexity of sketching and streaming small norms. In SODA, pages 1161-1178, 2010.
26. H. Klauck. A strong direct product theorem for disjointness. In STOC, pages 77-86, 2010.
27. I. Kremer, N. Nisan, and D. Ron. On randomized one-round communication complexity. Computational Complexity, pages 21-49, 1999.
28. E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, 1997.
29. J. Matousek. On variants of the johnson-lindenstrauss lemma. Random Structures and Algorithms, 33(2):142-156, 2008.
30. A. McGregor. Data streams and linear sketches. 2007. STOC Workshop presentation, available at http://people.cs.umass.edu/~mcgregor/stocworkshop/ mcgregor.pdf.
31. M. Monemizadeh and D. P. Woodruff. 1-pass relative-error 1p-sampling with applications. In SODA, pages 1143-1160, 2010.
32. S. Muthukrishnan. Data streams: algorithms and applications. Found. Trends Theor. Comput. Sci., 1(2):117-236, Aug. 2005. (Pubitemid 44111222)
33. R. Pagh. Compressed matrix multiplication. In ITCS, pages 442-451, 2012.
34. T. Sarlós. Improved approximation algorithms for large matrices via random projections. In FOCS, pages 143-152, 2006.
35. R. Shaltiel. Towards proving strong direct product theorems. Computational Complexity, 12(1-2):1-22, 2003. (Pubitemid 38670746)