Distributed learning, communication complexity and privacy

Journal of Machine Learning Research

Volumn 23, Issue , 2012, Pages

  Balcan, Maria Florina ^a   Blum, Avrim ^b   Fine, Shai ^c   Mansour, Yishay ^d  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c Research Development and Engineering Command   (United States)

^d TEL AVIV UNIVERSITY   (Israel)

Author keywords

Communication complexity; Distributed learning; Privacy

Indexed keywords

ARTIFICIAL INTELLIGENCE; DATA PRIVACY; SOFTWARE ENGINEERING;

AGNOSTIC LEARNING; COMMUNICATION COMPLEXITY; DIFFERENTIAL PRIVACIES; DISTRIBUTED LEARNING; LINEAR SEPARATORS; LOGARITHMIC DEPENDENCE; PERCEPTRON ALGORITHMS; UPPER AND LOWER BOUNDS;

COMMUNICATION;

EID: 84893754489     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (27)

1. M.-F. Balcan and S. Hanneke. Robust interactive learning. In Proc. 25th Annual Conference on Learning Theory (COLT), 2012.
2. A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: The SuLQ framework. In Proc. 24th ACM Symposium on Principles of Database Systems (PODS), pages 128-138, 2005.
3. A. Blum, K. Ligett, and A. Roth. A learning theory approach to non-interactive database privacy. In Proc. 40th Annual ACM Symp. Theory of Computing, pages 609-618, 2008.
4. N. H. Bshouty. Exact learning of formulas in parallel. Machine Learning, 26(1):25-41, 1997.
5. M. Collins, R. E. Schapire, and Y. Singer. Logistic regression, adaboost and bregman distances. Machine Learning, 48(1-3):253-285, 2002.
6. H. Daume III, J. Phillips, A. Saha, and S. Venkatasubramanian. Protocols for learning classifiers on distributed data. In International Conference on Artificial Intelligence and Statistics (AIStats), 2012a.
7. H. Daume III, J. Phillips, A. Saha, and S. Venkatasubramanian. Efficient protocols for distributed classification and optimization. CoRR, abs/1204.3523, 2012b.
8. O. Dekel, R. Gilad-Bachrach, O. Shamir, and L. Xiao. Optimal distributed online prediction. In Proceedings of the 28th International Conference on Machine Learning, 2011.
9. C. Dwork. Differential privacy. In ICALP (2), pages 1-12, 2006.
10. C. Dwork. Differential privacy: A survey of results. In TAMC, pages 1-19, 2008.
11. C. Dwork. The differential privacy frontier (extended abstract). In TCC, pages 496-502, 2009.
12. C. Dwork and K. Nissim. Privacy-preserving datamining on vertically partitioned databases. In Proceedings of CRYPTO, Lecture Notes in Computer Science, pages 528-544. Springer, 2004.
13. C. Dwork, G. N. Rothblum, and S. P. Vadhan. Boosting and differential privacy. In FOCS, pages 51-60, 2010.
14. Y. Freund. Boosting a weak learning algorithm by majority. In COLT, pages 202-216, 1990.
15. Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci., 55(1):119-139, 1997.
16. S. A. Goldman and M. J. Kearns. On the complexity of teaching. In Proceedings of COLT '91, pages 303-314. Morgan Kaufmann, 1991.
17. M. Herlihy and N. Shavit. The art of multiprocessor programming. Morgan Kaufmann, 2008.
18. J. J́aJ́a and V. K. Prasanna. Information transfer in distributed computing with applications to vlsi. J. ACM, 31(1):150-162, 1984.
19. S. Kasiviswanathan, H. Lee, K. Nissim, S. Raskhodnikova, and A. Smith. What Can We Learn Privately? In Proc. 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 531-540, 2008.
20. M. Kearns. Efficient noise-tolerant learning from statistical queries. Journal of the ACM, 45(6): 983-1006, 1998.
21. E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, 1997.
22. P. Long and R. Servedio. Algorithms and hardness results for parallel large margin learning. In NIPS, 2011.
23. D. Peleg. Distributed computing: A locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000. ISBN 0-89871-464-8.
24. R. L. Rivest and R. Sloan. Learning complicated concepts reliably and usefully. In Proceedings AAAI-88, pages 635-639, Aug. 1988.
25. R. E. Schapire. The strength of weak learnability. Machine Learning, 5:197-227, 1990.
26. R. Servedio. Perceptron, Winnow, and PAC learning. SIAM Journal on Computing, 31(5), 2002.
27. M. Zinkevich, M.Weimer, A. J. Smola, and L. Li. Parallelized stochastic gradient descent. In NIPS, pages 2595-2603, 2010.