115 citations · 816 across the 62 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
cs.DS2014★ 11 cited
Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's
Vitaly Feldman, Will Perkins, Santosh Vempala
We present an algorithm for recovering planted solutions in two well-known models, the stochastic block model and planted constraint satisfaction problems, via a common generalizat…
cs.DS2014
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity
Vitaly Feldman, David Xiao
In this work we analyze the sample complexity of classification by differentially private algorithms. Differential privacy is a strong and well-studied notion of privacy introduced…