28 citations · 174 across the 52 of their papers we have counts for
4 papers · 1 filter
Simultaneous Private Learning of Multiple Concepts
Mark Bun, Kobbi Nissim, Uri Stemmer
We investigate the direct-sum problem in the context of differentially private PAC learning: What is the sample complexity of solving learning tasks simultaneously under differ…
Algorithmic Stability for Adaptive Data Analysis
Raef Bassily, Kobbi Nissim, Adam Smith +3
Adaptivity is an important feature of data analysis---the choice of questions to ask about a dataset often depends on previous interactions with the same dataset. However, statisti…
Differentially Private Release and Learning of Threshold Functions
Mark Bun, Kobbi Nissim, Uri Stemmer +1
We prove new upper and lower bounds on the sample complexity of differentially private algorithms for releasing approximate answers to threshold functions. A threshold fun…
On the Generalization Properties of Differential Privacy
Kobbi Nissim, Uri Stemmer
A new line of work, started with Dwork et al., studies the task of answering statistical queries using a sample and relates the problem to the concept of differential privacy. By t…