Learning privately with labeled and unlabeled examples

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 2015-January, Issue January, 2015, Pages 461-477

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

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

MACHINE LEARNING; SUPERVISED LEARNING;

ACTIVE LEARNING; DOMAIN ELEMENTS; FIRST CONSTRUCTIONS; GENERIC CONSTRUCTION; SAMPLE COMPLEXITY; SEMI- SUPERVISED LEARNING; SEMI-SUPERVISED; UNLABELED SAMPLES;

COMPUTATIONAL COMPLEXITY;

EID: 84938272619     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973730.32     Document Type: Conference Paper

References (30)

1. A. Agrawala. Learning with a probabilistic teacher. Information Theory, IEEE Transactions on, 16(4):373-379, Jul 1970.
2. Martin Anthony and John Shawe-Taylor. A result of Vapnik with applications. Discrete Applied Mathematics, 47(3):207-217, 1993.
3. Matin Anthony and Peter L. Bartlett. Neural Network Learning: Theoretical Foundations. Cambridge University Press, 2009.
4. Maria-Fiorina Balcan and Vitaly Feldman. Statistical active learning algorithms. In Advances in Neural Information Processing Systems 26, pages 1295-1303, 2013.
5. Amos Beimel, Hai Brenner, Shiva Prasad Ka-siviswanathan, and Kobbi Nissim. Bounds on the sample complexity for private learning and private data release. Machine Learning, 94(3):401-437, 2014.
6. Amos Beimel, Kobbi Nissim, and Uri Stemmer. Characterizing the sample complexity of private learners. In Robert D. Kleinberg, editor, ITCS, pages 97-110. ACM, 2013.
7. Amos Beimel, Kobbi Nissim, and Uri Stemmer. Private learning and sanitization: Pure vs. approximate differential privacy. In Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, and Jose D. P. Rolim, editors, APPROX-RANDOM, volume 8096 of Lecture Notes in Computer Science, pages 363-378. Springer, 2013.
8. Avrim Blum, Cynthia Dwork, Frank McSherry, and Kobbi Nissim. Practical privacy: The SuLQ framework. In Chen Li, editor, PODS, pages 128-138. ACM, 2005.
9. Avrim Blum, Katrina Ligett, and Aaron Roth. A learning theory approach to noninteractive database privacy. J. ACM, 60(2):12, 2013.
10. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K. Warmuth. Learnability and the vapnik-chervonenkis dimension. J. ACM, 36(4):929-965, 1989.
11. Mark Bun, Kobbi Nissim, Uri Stemmer, and Salil Vadhan. Differentially private learning and release of thresholds. Manuscript, 2014.
12. Kamalika Chaudhuri and Daniel Hsu. Sample complexity bounds for differentially private learning. In Sham M. Kakade and Ulrike von Luxburg, editors, COLT, volume 19 of JMLR Proceedings, pages 155-186. JMLR.org, 2011.
13. Kamalika Chaudhuri and Claire Monteleoni. Privacy-preserving logistic regression. In Daphne Koller, Dale Schuurmans, Yoshua Bengio, and Leon Bottou, editors, NIPS. MIT Press, 2008.
14. Kamalika Chaudhuri, Claire Monteleoni, and Anand D. Sarwate. Differentially private empirical risk minimization. J. Mach. Learn. Res., 12:1069-1109, July 2011.
15. Cynthia Dwork, Krishnaram Kenthapadi, Frank Mc-Sherry, Ilya Mironov, and Moni Naor. Our data, ourselves: Privacy via distributed noise generation. In Serge Vaudenay, editor, EUROCRYPT, volume 4004 of Lecture Notes in Computer Science, pages 486-503. Springer, 2006.
16. Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. Calibrating noise to sensitivity in private data analysis. In Shai Halevi and Tal Rabin, editors, TCC, volume 3876 of Lecture Notes in Computer Science, pages 265-284. Springer, 2006.
17. Cynthia Dwork, Guy N. Rothblum, and Salil P. Vad-han. Boosting and differential privacy. In FOCS, pages 51-60. IEEE Computer Society, 2010.
18. Andrzej Ehrenfeucht, David Haussler, Michael J. Kearns, and Leslie G. Valiant. A general lower bound on the number of examples needed for learning. Inf. Comput., 82(3):247-261, 1989.
19. Vitaly Feldman and David Xiao. Sample complexity bounds on differentially private learning via communication complexity. CoRR, abs/1402.6278, 2014.
20. S. Fralick. Learning to recognize patterns without a teacher. IEEE Trans. Inf. Theor., 13(1):57-64, September 2006.
21. Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith. What can we learn privately? SIAM J. Comput., 40(3):793-826, 2011.
22. Michael J. Kearns. Efficient noise-tolerant learning from statistical queries. J. ACM, 45(6):983-1006, 1998.
23. Andrew McCallum and Kamal Nigam. Employing em and pool-based active learning for text classification. In Proceedings of the Fifteenth International Conference on Machine Learning, ICML '98, pages 350-358, San Francisco, CA, USA, 1998. Morgan Kaufmann Publishers Inc.
24. Frank McSherry and Kunal Talwar. Mechanism design via differential privacy. In FOCS, pages 94-103. IEEE Computer Society, 2007.
25. Benjamin I. P. Rubinstein, Peter L. Bartlett, Ling Huang, and Nina Taft. Learning in a large function space: Privacy-preserving mechanisms for svm learning. CoRR, abs/0911.5708, 2009.
26. N Sauer. On the density of families of sets. Journal of Combinatorial Theory, Series A, 13(1):145-147, 1972.
27. III Scudder, H. Probability of error of some adaptive pattern-recognition machines. Information Theory, IEEE Transactions on, 11(3):363-371, Jul 1965.
28. Leslie G. Valiant. A theory of the learnable. Commun. ACM, 27(11):1134-1142, 1984.
29. Vladimir Vapnik and Alexey Chervonenkis. Theory of pattern recognition [in russian]. Nauka, Moscow, 1974.
30. Vladimir N. Vapnik and Alexey 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.