팔로우
Adam Klivans
Adam Klivans
Professor of Computer Science, University of Texas at Austin
cs.utexas.edu의 이메일 확인됨
제목
인용
인용
연도
Agnostically learning halfspaces
AT Kalai, AR Klivans, Y Mansour, RA Servedio
SIAM Journal on Computing 37 (6), 1777-1805, 2008
2992008
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
AR Klivans, D Van Melkebeek
SIAM Journal on Computing 31 (5), 1501-1526, 2002
2892002
Learning DNF in time 2O (n1/3)
AR Klivans, RA Servedio
Journal of Computer and System Sciences 68 (2), 303-318, 2004
2352004
Randomness efficient identity testing of multivariate polynomials
AR Klivans, D Spielman
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
2302001
Learning intersections and thresholds of halfspaces
AR Klivans, R O'Donnell, RA Servedio
Journal of Computer and System Sciences 68 (4), 808-840, 2004
2092004
Cryptographic hardness for learning intersections of halfspaces
AR Klivans, AA Sherstov
Journal of Computer and System Sciences 75 (1), 2-12, 2009
1762009
Efficient algorithms for outlier-robust regression
A Klivans, PK Kothari, R Meka
Conference On Learning Theory, 1420-1430, 2018
1222018
Reliably learning the relu in polynomial time
S Goel, V Kanade, A Klivans, J Thaler
Conference on Learning Theory, 1004-1042, 2017
1092017
Learning Halfspaces with Malicious Noise.
AR Klivans, PM Long, RA Servedio
Journal of Machine Learning Research 10 (12), 2009
1002009
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
1002008
Hyperparameter optimization: A spectral approach
E Hazan, A Klivans, Y Yuan
arXiv preprint arXiv:1706.00764, 2017
932017
Learning graphical models using multiplicative weights
A Klivans, R Meka
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
892017
Learning neural networks with two nonlinear layers in polynomial time
S Goel, AR Klivans
Conference on Learning Theory, 1470-1499, 2019
85*2019
List-decoding Reed-Muller codes over small fields
P Gopalan, AR Klivans, D Zuckerman
Proceedings of the fortieth annual ACM symposium on Theory of computing, 265-274, 2008
752008
An FPTAS for# knapsack and related counting problems
P Gopalan, A Klivans, R Meka, D Štefankovic, S Vempala, E Vigoda
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 817-826, 2011
742011
Learnability beyond AC0
JC Jackson, AR Klivans, RA Servedio
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
702002
Toward Attribute Efficient Learning of Decision Lists and Parities.
AR Klivans, RA Servedio, D Ron
Journal of Machine Learning Research 7 (4), 2006
692006
Learning one convolutional layer with overlapping patches
S Goel, A Klivans, R Meka
International Conference on Machine Learning, 1783-1791, 2018
682018
Agnostically learning decision trees
P Gopalan, AT Kalai, AR Klivans
Proceedings of the fortieth annual ACM symposium on Theory of computing, 527-536, 2008
632008
Learning restricted models of arithmetic circuits
A Klivans, A Shpilka
Theory of computing 2 (1), 185-206, 2006
63*2006
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20