Rocco Servedio
Cited by
Cited by
Random classification noise defeats all convex potential boosters
PM Long, RA Servedio
Machine learning 78 (3), 287-304, 2010
Agnostically learning halfspaces
AT Kalai, AR Klivans, Y Mansour, RA Servedio
SIAM Journal on Computing 37, 1777, 2008
Learning functions of< i> k</i> relevant variables
E Mossel, R O'Donnell, RA Servedio
Journal of Computer and System Sciences 69 (3), 421-434, 2004
On the capacity of secure network coding
J Feldman, T Malkin, C Stein, RA Servedio
Proc. 42nd Annual Allerton Conference on Communication, Control, and …, 2004
Smooth boosting and learning with malicious noise
RA Servedio
The Journal of Machine Learning Research 4, 633-648, 2003
Learning DNF in time
AR Klivans, R Servedio
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
Learning intersections and thresholds of halfspaces
AR Klivans, R O'Donnell, RA Servedio
Journal of Computer and System Sciences 68 (4), 808-840, 2004
Bounded independence fools halfspaces
I Diakonikolas, P Gopalan, R Jaiswal, RA Servedio, E Viola
SIAM Journal on Computing 39 (8), 3441-3462, 2010
LP decoding corrects a constant fraction of errors
J Feldman, T Malkin, RA Servedio, C Stein, MJ Wainwright
IEEE Transactions on Information Theory 53 (1), 82-89, 2006
Equivalences and separations between quantum and classical learnability
RA Servedio, SJ Gortler
SIAM Journal on Computing 33 (5), 1067-1092, 2004
Learning poisson binomial distributions
C Daskalakis, I Diakonikolas, RA Servedio
Algorithmica 72 (1), 316-357, 2015
Testing halfspaces
K Matulef, R O'Donnell, R Rubinfeld, RA Servedio
SIAM Journal on Computing 39 (5), 2004-2047, 2010
Testing Fourier dimensionality and sparsity
P Gopalan, R O'Donnell, RA Servedio, A Shpilka, K Wimmer
SIAM Journal on Computing 40 (4), 1075-1100, 2011
Testing for concise representations
I Diakonikolas, HK Lee, K Matulef, K Onak, R Rubinfeld, RA Servedio, ...
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 549-558, 2007
Learning monotone decision trees in polynomial time
R O'Donnell, RA Servedio
Computational Complexity, 2006. CCC 2006. Twenty-First Annual IEEE …, 2008
Boosting and hard-core set construction
AR Klivans, RA Servedio
Machine Learning 51 (3), 217-238, 2003
Learning mixtures of product distributions over discrete domains
J Feldman, R O'Donnell, RA Servedio
Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium …, 2005
Every decision tree has an influential variable
R O'Donnell, M Saks, O Schramm, RA Servedio
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 31-39, 2005
Efficient density estimation via piecewise polynomial approximation
SO Chan, I Diakonikolas, RA Servedio, X Sun
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
Pac learning axis-aligned mixtures of gaussians with no separation assumption
J Feldman, R Servedio, R O’Donnell
Learning Theory, 20-34, 2006
The system can't perform the operation now. Try again later.
Articles 1–20