What Can We Learn Privately?

S. Kasiviswanathan,Homin K. Lee,Kobbi Nissim,Sofya Raskhodnikova,Adam D. Smith

Published 2008 in 2008 49th Annual IEEE Symposium on Foundations of Computer Science

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. We present several basic results that demonstrate general feasibility of private learning and relate several models previously studied separately in the contexts of privacy and standard learning.

PUBLICATION RECORD

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-62 of 62 references · Page 1 of 1

CITED BY

Showing 1-100 of 1586 citing papers · Page 1 of 16