Search Results for author: Homin K. Lee

Found 1 papers, 0 papers with code

What Can We Learn Privately?

no code implementations6 Mar 2008 Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith

Therefore, almost anything learnable is learnable privately: specifically, if a concept class is learnable by a (non-private) algorithm with polynomial sample complexity and output size, then it can be learned privately using a polynomial number of samples.

Cannot find the paper you are looking for? You can Submit a new open access paper.