(Nearly) optimal algorithms for private online learning in full-information and bandit settings

Advances in Neural Information Processing Systems

Volumn , Issue , 2013, Pages

  Smith, Adam ^a   Thakurta, Abhradeep ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

E-LEARNING; OPTIMIZATION;

DATA POINTS; FULL INFORMATIONS; INPUT LENGTHS; LOSS FUNCTIONS; ONLINE LEARNING; ONLINE LEARNING ALGORITHMS; OPTIMAL ALGORITHM; REGRET BOUNDS;

LEARNING ALGORITHMS;

EID: 84898996940     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Peter Auer, Nicolò Cesa-Bianchi, and Paul Fischer. Finite-time analysis of the multiarmed bandit problem. Machine learning, 2002.
2. Alekh Agarwal, Ofer Dekel, and Lin Xiao. Optimal algorithms for online convex optimization with multi-point bandit feedback. In COLT, 2010.
3. Jacob Abernethy, Elad Hazan, and Alexander Rakhlin. Competing in the dark: An efficient algorithm for bandit linear optimization. In COLT, 2008.
4. Sébastien Bubeck and Nicolo Cesa-Bianchi. Regret analysis of stochastic and nonstochastic multiarmed bandit problems. arXiv preprint arXiv:1204.5721, 2012.
5. Avrim Blum, Cynthia Dwork, Frank McSherry, and Kobbi Nissim. Practical privacy: The SuLQ framework. In PODS, 2005.
6. Kamalika Chaudhuri and Claire Monteleoni. Privacy-preserving logistic regression. In NIPS, 2008.
7. Kamalika Chaudhuri, Claire Monteleoni, and Anand D. Sarwate. Differentially private empirical risk minimization. Journal of Machine Learning Research, 12:1069-1109, 2011.
8. TH Hubert Chan, Elaine Shi, and Dawn Song. Private and continual release of statistics. In ICALP, 2010.
9. John C. Duchi, Michael I. Jordan, and Martin J. Wainwright. Local privacy and statistical minimax rates. In IEEE Symp. on Foundations of Computer Science (FOCS), 2013. http://arxiv.org/abs/1302.3203.
10. Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. Calibrating noise to sensitivity in private data analysis. In TCC, 2006.
11. Cynthia Dwork and Moni Naor. On the difficulties of disclosure prevention in statistical databases or the case for differential privacy. J. Privacy and Confidentiality, 2(1), 2010.
12. Cynthia Dwork, Moni Naor, Toniann Pitassi, and Guy N Rothblum. Differential privacy under continual observation. In Proceedings of the 42nd ACM symposium on Theory of computing, 2010.
13. Cynthia Dwork. Differential privacy. In ICALP, 2006.
14. Abraham D Flaxman, Adam Tauman Kalai, and H Brendan McMahan. Online convex optimization in the bandit setting: gradient descent without a gradient. In SODA, 2005.
15. Elad Hazan, Amit Agarwal, and Satyen Kale. Logarithmic regret algorithms for online convex optimization. Journal of Machine Learning Research, 2007.
16. James Hannan. Approximation to bayes risk in repeated play. 1957.
17. Prateek Jain, Pravesh Kothari, and Abhradeep Thakurta. Differentially private online learning. In COLT, 2012.
18. Prateek Jain and Abhradeep Thakurta. Differentially private learning with kernels. In ICML, 2013.
19. Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith. What can we learn privately? In FOCS, 2008.
20. Daniel Kifer and Ashwin Machanavajjhala. A rigorous and customizable framework for privacy. In PODS, 2012.
21. Shiva Prasad Kasiviswanathan and Adam Smith. A note on differential privacy: Defining resistance to arbitrary side information. CoRR, arXiv:0803.39461 [cs.CR], 2008.
22. Daniel Kifer, Adam Smith, and Abhradeep Thakurta. Private convex empirical risk minimization and high-dimensional regression. In COLT, 2012.
23. Shai Shalev-Shwartz. Online learning and online convex optimization. Foundations and Trends R in Machine Learning, 2011.
24. Adam Smith. Privacy-preserving statistical estimators with optimal convergence rates. In STOC, 2011.
25. Martin Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In ICML, 2003.