关注
Rocco Anthony Servedio
Rocco Anthony Servedio
Department of Computer Science, Columbia University
在 columbia.edu 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Random classification noise defeats all convex potential boosters
PM Long, RA Servedio
Proceedings of the 25th international conference on Machine learning, 608-615, 2008
3582008
Agnostically learning halfspaces
AT Kalai, AR Klivans, Y Mansour, RA Servedio
SIAM Journal on Computing 37 (6), 1777-1805, 2008
3522008
Learning functions of k relevant variables
E Mossel, R O'Donnell, RA Servedio
Journal of Computer and System Sciences 69 (3), 421-434, 2004
291*2004
Learning DNF in time
AR Klivans, R Servedio
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
2532001
Smooth boosting and learning with malicious noise
RA Servedio
The Journal of Machine Learning Research 4, 633-648, 2003
2442003
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
2342004
Learning intersections and thresholds of halfspaces
AR Klivans, R O'Donnell, RA Servedio
Journal of Computer and System Sciences 68 (4), 808-840, 2004
2262004
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
1622005
Bounded independence fools halfspaces
I Diakonikolas, P Gopalan, R Jaiswal, RA Servedio, E Viola
SIAM Journal on Computing 39 (8), 3441-3462, 2010
1602010
Equivalences and separations between quantum and classical learnability
RA Servedio, SJ Gortler
SIAM Journal on Computing 33 (5), 1067-1092, 2004
1422004
Learning poisson binomial distributions
C Daskalakis, I Diakonikolas, RA Servedio
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
1392012
Learning monotone decision trees in polynomial time
R O'Donnell, RA Servedio
SIAM Journal on Computing 37 (3), 827-844, 2007
1382007
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
1322014
Learning mixtures of product distributions over discrete domains
J Feldman, R O'Donnell, RA Servedio
SIAM Journal on Computing 37 (5), 1536-1564, 2008
1312008
Learning geometric concepts via Gaussian surface area
AR Klivans, R O'Donnell, RA Servedio
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 541-550, 2008
1282008
Learning Halfspaces with Malicious Noise.
AR Klivans, PM Long, RA Servedio
Journal of Machine Learning Research 10 (12), 2009
1272009
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
1272006
Testing halfspaces
K Matulef, R O'Donnell, R Rubinfeld, RA Servedio
SIAM Journal on Computing 39 (5), 2004-2047, 2010
1202010
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
1192011
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
1182007
系统目前无法执行此操作,请稍后再试。
文章 1–20