Characterizing the sample complexity of private learners

ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science

Volumn , Issue , 2013, Pages 97-109

  Beimel, Amos ^a   Nissim, Kobbi ^a,b   Stemmer, Uri ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b HARVARD UNIVERSITY   (United States)

Author keywords

differential privacy; pac learning; probabilistic representation; sample complexity

Indexed keywords

COMPLEXITY MEASURES; CONCEPT CLASS; DATABASE SIZE; DIFFERENTIAL PRIVACIES; GENERIC CONSTRUCTION; OPTIMIZATION PROBLEMS; PAC LEARNING; PRIVATE DATA; PROBABILISTIC REPRESENTATION; SAMPLE COMPLEXITY; SAMPLE SIZES; VC DIMENSION;

COMPUTER SCIENCE; LEARNING ALGORITHMS;

CHARACTERIZATION;

EID: 84873351478     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2422436.2422450     Document Type: Conference Paper

References (20)

1. A. Beimel, H. Brenner, S. P. Kasiviswanathan, and K. Nissim. Bounds on the sample complexity for private learning and private data release. Full version of [3], in submition, 2012.
2. A. Beimel, P. Carmi, K. Nissim, and E. Weinreb. Private approximation of search problems. SIAM J. Comput., 38(5):1728-1760, 2008.
3. A. Beimel, S. P. Kasiviswanathan, and K. Nissim. Bounds on the sample complexity for private learning and private data release. In 7th Theory of Cryptography Conference, pages 437-454, 2010.
4. A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: The SuLQ framework. In PODS, pages 128-138. ACM, 2005.
5. A. Blum, K. Ligett, and A. Roth. A learning theory approach to non-interactive database privacy. In STOC, pages 609-618. ACM, 2008.
6. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of the Association for Computing Machinery, 36(4):929-965, 1989.
7. K. Chaudhuri and D. Hsu. Sample complexity bounds for differentially private learning. Journal of Machine Learning Research - COLT 2011 Proceedings, 19:155-186, 2011.
8. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statist., 23:493-507, 1952.
9. C. Dwork. The differential privacy frontier. In O. Reingold, editor, TCC, volume 5444 of LNCS, pages 496-502. Springer, 2009.
10. C. Dwork. A firm foundation for private data analysis. Commun. of the ACM, 54(1):86-95, 2011.
11. C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In S. Halevi and T. Rabin, editors, TCC, volume 3876 of LNCS, pages 265-284. Springer, 2006.
12. C. Dwork, G. N. Rothblum, and S. P. Vadhan. Boosting and differential privacy. In 51th Annual IEEE Symposium on Foundations of Computer Science, pages 51-60, 2010.
13. A. Ehrenfeucht, D. Haussler, M. J. Kearns, and L. G. Valiant. A general lower bound on the number of examples needed for learning. Inf. Comput., 82(3):247-261, 1989.
14. Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, 1997.
15. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963.
16. S. P. Kasiviswanathan, H. K. Lee, K. Nissim, S. Raskhodnikova, and A. Smith. What can we learn privately? In 48th Annual IEEE Symposium on Foundations of Computer Science, pages 531-540. IEEE Computer Society, 2008.
17. F. McSherry and K. Talwar. Mechanism design via differential privacy. In 48th Annual IEEE Symposium on Foundations of Computer Science, pages 94-103. IEEE, 2007.
18. R. E. Schapire. The strength of weak learnability. Mach. Learn., 5(2):197-227, 1990.
19. L. G. Valiant. A theory of the learnable. Communications of the ACM, 27:1134-1142, 1984.
20. V. N. Vapnik and A. Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16:264, 1971.