(Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings

Abhradeep Guha Thakurta, Adam D. Smith. (Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings. In Christopher J. C. Burges, Léon Bottou, Zoubin Ghahramani, Kilian Q. Weinberger, editors, Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013, Lake Tahoe, Nevada, United States. pages 2733-2741, 2013. [doi]

@inproceedings{ThakurtaS13-0,
  title = {(Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings},
  author = {Abhradeep Guha Thakurta and Adam D. Smith},
  year = {2013},
  url = {http://papers.nips.cc/paper/5012-nearly-optimal-algorithms-for-private-online-learning-in-full-information-and-bandit-settings},
  researchr = {https://researchr.org/publication/ThakurtaS13-0},
  cites = {0},
  citedby = {0},
  pages = {2733-2741},
  booktitle = {Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013, Lake Tahoe, Nevada, United States},
  editor = {Christopher J. C. Burges and Léon Bottou and Zoubin Ghahramani and Kilian Q. Weinberger},
}