Sample complexity bounds for differentially private learning

Journal of Machine Learning Research

Volumn 19, Issue , 2011, Pages 155-186

  Chaudhuri, Kamalika ^a   Hsu, Daniel ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

List of keywords

Indexed keywords

LEARNING ALGORITHMS;

CONTINUOUS DISTRIBUTION; DIFFERENTIAL PRIVACIES; LIST OF KEYWORDS; PRIVACY AND ACCURACY; PRIVACY REQUIREMENTS; PRIVACY-PRESERVING CLASSIFICATION; SAMPLE COMPLEXITY BOUNDS; SENSITIVE INFORMATIONS;

CLASSIFICATION (OF INFORMATION);

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

References (38)

1. R. Agrawal and R. Srikant. Privacy-preserving data mining. SIGMOD Rec., 29(2):439-450, 2000. ISSN 0163-5808. doi: http://doi.acm.org/10.1145/335191. 335438.
2. Lars Backstrom, Cynthia Dwork, and Jon M. Kleinberg. Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In Carey L. Williamson, Mary Ellen Zurko, Peter F. Patel-Schneider, and Prashant J. Shenoy, editors, WWW, pages 181-190. ACM, 2007. ISBN 978-1-59593-654-7.
3. K. Ball. An elementary introduction to modern convex geometry. In Silvio Levy, editor, Flavors of Geometry, volume 31. 1997.
4. B. Barak, K. Chaudhuri, C. Dwork, S. Kale, F. McSherry, and K. Talwar. Privacy, accuracy, and consistency too: a holistic solution to contingency table release. In PODS, pages 273-282, 2007.
5. Amos Beimel, Shiva Prasad Kasiviswanathan, and Kobbi Nissim. Bounds on the sample complexity for private learning and private data release. In TCC, pages 437-454, 2010.
6. A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: the sulq framework. In PODS, pages 128-138, 2005.
7. A. Blum, K. Ligett, and A. Roth. A learning theory approach to non-interactive database privacy. In R. E. Ladner and C. Dwork, editors, STOC, pages 609-618. ACM, 2008. ISBN 978-1-60558-047-0.
8. Nader H. Bshouty, Yi Li, and Philip M. Long. Using the doubling dimension to analyze the generalization of learning algorithms. J. Comput. Syst. Sci., 75(6):323-335, 2009.
9. K. Chaudhuri, C. Dwork, S. Kale, F. McSherry, and K. Talwar. Learning concept classes with privacy. Manuscript, 2006.
10. K. Chaudhuri, C. Monteleoni, and A. Sarwate. Differentially private empirical risk mini-mization. Journal of Machine Learning Research, 2011.
11. Kamalika Chaudhuri and Nina Mishra. When random sampling preserves privacy. In Cynthia Dwork, editor, CRYPTO, volume 4117 of Lecture Notes in Computer Science, pages 198-213. Springer, 2006. ISBN 3-540-37432-9.
12. Sanjoy Dasgupta. Coarse sample complexity bounds for active learning. In NIPS, 2005.
13. C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In 3rd IACR Theory of Cryptography Conference, pages 265-284, 2006.
14. A. Evfimievski, J. Gehrke, and R. Srikant. Limiting privacy breaches in privacy preserving data mining. In PODS, pages 211-222, 2003.
15. Yoav Freund, H. Sebastian Seung, Eli Shamir, and Naftali Tishby. Selective sampling using the query by committee algorithm. Machine Learning, 28(2-3): 133-168, 1997.
16. Srivatsava Ranjit Ganta, Shiva Prasad Kasiviswanathan, and Adam Smith. Composition attacks and auxiliary information in data privacy. In KDD, pages 265-273, 2008a.
17. Srivatsava Ranjit Ganta, Shiva Prasad Kasiviswanathan, and Adam Smith. Composition attacks and auxiliary information in data privacy. In KDD, pages 265-273, 2008b.
18. Anupam Gupta, Robert Krauthgamer, and James R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In FOCS, pages 534-543, 2003.
19. Anupam Gupta, Moritz Hardt, Aaron Roth, and Jonathan Ullman. Privately releasing conjunctions and the statistical query barrier. In STOC, 2011.
20. Moritz Hardt and Kunal Talwar. On the geometry of differential privacy. In STOC, pages 705-714, 2010.
21. Rosie Jones, Ravi Kumar, Bo Pang, and Andrew Tomkins. "i know what you did last summer": query logs and user privacy. In CIKM '07: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, pages 909-914, New York, NY, USA, 2007. ACM. ISBN 978-1-59593-803-9. doi: http://doi.acm.org/10. 1145/1321440.1321573.
22. S. A. Kasiviswanathan, H. K. Lee, K. Nissim, S. Raskhodnikova, and A. Smith. What can we learn privately? In Proc. of Foundations of Computer Science, 2008.
23. Shiva Prasad Kasiviswanathan and Adam Smith. A note on differential privacy: Defining resistance to arbitrary side information. CoRR, abs/0803.3946, 2008.
24. A. Kolmogorov and V. Tikhomirov, e-entropy and e-capacity of sets in function spaces. Translations of the American Mathematical Society, 17:277-364, 1961.
25. P. M. Long. On the sample complexity of pac learning halfspaces against the uniform distribution. IEEE Transactions on Neural Networks, 6(6):1556559, 1995.
26. A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam. 1-diversity: Privacy beyond k-anonymity. In Proc. of ICDE, 2006.
27. David A. McAllester. Some pac-bayesian theorems. In COLT, pages 230-234, 1998.
28. Frank McSherry and Ilya Mironov. Differentially private recommender systems: building privacy into the net. In KDD '09: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 627-636, New York, NY, USA, 2009. ACM. ISBN 978-1-60558-495-9. doi: http://doi.acm.org/10.1145/1557019.1557090.
29. Frank McSherry and Kunal Talwar. Mechanism design via differential privacy. In FOCS, pages 94-103, 2007.
30. Arvind Narayanan and Vitaly Shmatikov. Robust de-anonymization of large sparse datasets. In IEEE Symposium on Security and Privacy, pages 111-125, Oakland, CA, USA., May 2008. IEEE Computer Society.
31. Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith. Smooth sensitivity and sampling in private data analysis. In David S. Johnson and Uriel Feige, editors, STOC, pages 75-84. ACM, 2007. ISBN 978-1-59593-631-8.
32. D. Pollard. Convergence of Stochastic Processes. Springer-Verlag, 1984.
33. Aaron Roth. Differential privacy and the fat-shattering dimension of linear queries. In APPROX-RANDOM, pages 683-695, 2010.
34. L. Sweeney, k-anonymity: a model for protecting privacy. Int. J. on Uncertainty, Fuzziness and Knowledge-Based Systems, 2002.
35. 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(2):264-280, 1971.
36. Rui Wang, Yong Fuga Li, XiaoFeng Wang, Haixu Tang, and Xiao yong Zhou. Learning your identity and disease from research papers: information leaks in genome wide association study. In ACM Conference on Computer and Communications Security, pages 534-544, 2009.
37. Andrew Chi-Chih Yao. Protocols for secure computations (extended abstract). In FOCS, pages 160-164, 1982.
38. Shuheng Zhou, Katrina Ligett, and Larry Wasserman. Differential privacy with compression. In Proc. of IS IT, 2009.