Bounds on the sample complexity for private learning and private data release

Machine Learning

Volumn 94, Issue 3, 2014, Pages 401-437

  Beimel, Amos ^a   Brenner, Hai ^a   Kasiviswanathan, Shiva Prasad ^b   Nissim, Kobbi ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b GE GLOBAL RESEARCH   (United States)

Author keywords

Differential privacy; PAC learning; Private data release; Sample complexity

Indexed keywords

EID: 84894624083     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-013-5404-1     Document Type: Article

References (27)

1. Beimel, A.; Kasiviswanathan, S. P.; Nissim, K. (2010). Bounds on the sample complexity for private learning and private data release. In D. Micciancio (Ed.), LNCS: Vol. 5978. TCC (pp. 437-454). Berlin: Springer.
2. Beimel, A.; Nissim, K.; Stemmer, U. (2013). Characterizing the sample complexity of private learners. In ITCS (pp. 97-110).
3. Blum, A.; Dwork, C.; McSherry, F.; Nissim, K. (2005). Practical privacy: the SuLQ framework. In PODS (pp. 128-138). New York: ACM.
4. Blum, A.; Ligett, K.; Roth, A. (2008). A learning theory approach to non-interactive database privacy. In STOC (pp. 609-618). New York: ACM.
5. Blum, A.; Ligett, K.; Roth, A. (2013). A learning theory approach to non-interactive database privacy. Journal of the ACM, 60(2), 12.
6. Blumer, A.; Ehrenfeucht, A.; Haussler, D.; Warmuth, M. K. (1989). Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36(4), 929-965.
7. Chaudhuri, K.; Hsu, D. (2011). Sample complexity bounds for differentially private learning. Journal of Machine Learning Research, 19, 155-186.
8. Chaudhuri, K.; Monteleoni, C. (2008). Privacy-preserving logistic regression. In D. Koller, D. Schuurmans, Y. Bengio, & L. Bottou (Eds.), NIPS, Cambridge: MIT Press.
9. Chaudhuri, K.; Monteleoni, C.; Sarwate, A. D. (2011). Differentially private empirical risk minimization. Journal of Machine Learning Research, 12, 1069-1109.
10. Chernoff, H. (1952). A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. The Annals of Mathematical Statistics, 23, 493-507.
11. Dwork, C. (2009). The differential privacy frontier. In O. Reingold (Ed.), LNCS: Vol. 5444. TCC (pp. 496-502). Berlin: Springer.
12. Dwork, C. (2011). A firm foundation for private data analysis. Communications of the ACM, 54(1), 86-95.
13. Dwork, C.; McSherry, F.; Nissim, K.; Smith, A. (2006). Calibrating noise to sensitivity in private data analysis. In S. Halevi & T. Rabin (Eds.), LNCS: Vol. 3876. TCC (pp. 265-284). Berlin: Springer.
14. Dwork, C.; Naor, M.; Reingold, O.; Rothblum, G.; Vadhan, S. (2009). On the complexity of differentially private data release. In STOC (pp. 381-390). New York: ACM.
15. Ehrenfeucht, A.; Haussler, D.; Kearns, M. J.; Valiant, L. G. (1989). A general lower bound on the number of examples needed for learning. Information and Computation, 82(3), 247-261.
16. Goldreich, O. (2001). Foundations of cryptography, volume basic tools. Cambridge: Cambridge University Press.
17. Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301), 13-30.
18. Hughes, D. R.; Piper, F. C. (1973). Projective planes (Vol. 6). Berlin: Springer.
19. Kasiviswanathan, S. P.; Lee, H. K.; Nissim, K.; Raskhodnikova, S.; Smith, A. (2011). What can we learn privately? SIAM Journal on Computing, 40(3), 793-826.
20. Kearns, M. J. (1998). Efficient noise-tolerant learning from statistical queries. Journal of the ACM, 45(6), 983-1006. Preliminary version in proceedings of STOC'93.
21. Kearns, M. J.; Vazirani, U. V. (1994). An introduction to computational learning theory. Cambridge: MIT Press.
22. Kifer, D.; Smith, A. D.; Thakurta, A. (2012). Private convex optimization for empirical risk minimization with applications to high-dimensional regression. Journal of Machine Learning Research, 23, 25.
23. McSherry, F.; Talwar, K. (2007). Mechanism design via differential privacy. In FOCS (pp. 94-103). New York: IEEE Press.
24. Mishra, N.; Sandler, M. (2006). Privacy via pseudorandom sketches. In PODS (pp. 143-152). New York: ACM.
25. Pitt, L.; Valiant, L. G. (1988). Computational limitations on learning from examples. Journal of the ACM, 35(4), 965-984.
26. Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27, 1134-1142.
27. Vapnik, V. N.; Chervonenkis, A. Y. (1971). On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and Its Applications, 16, 264.