What Can We Learn Privately?

  • Authors:
  • Shiva Prasad Kasiviswanathan;Homin K. Lee;Kobbi Nissim;Sofya Raskhodnikova;Adam Smith

  • Affiliations:
  • -;-;-;-;-

  • Venue:
  • FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept classes can be learned privately, namely, by an algorithm whose output does not depend too heavily on any one input or specific training example? More precisely, we investigate learning algorithms that satisfy differential privacy, a notion that provides strong confidentiality guarantees in the contexts where aggregate information is released about a database containing sensitive information about individuals.