Adam Klivans
Adam Klivans
Professor of Computer Science, University of Texas at Austin
Dirección de correo verificada de cs.utexas.edu
Título
Citado por
Citado por
Año
Agnostically learning halfspaces
AT Kalai, AR Klivans, Y Mansour, RA Servedio
SIAM Journal on Computing 37 (6), 1777-1805, 2008
2762008
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
2752002
Learning DNF in time 2O (n1/3)
AR Klivans, RA Servedio
Journal of Computer and System Sciences 68 (2), 303-318, 2004
2192004
Randomness efficient identity testing of multivariate polynomials
AR Klivans, D Spielman
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
2092001
Learning intersections and thresholds of halfspaces
AR Klivans, R O'Donnell, RA Servedio
Journal of Computer and System Sciences 68 (4), 808-840, 2004
1912004
Cryptographic hardness for learning intersections of halfspaces
AR Klivans, AA Sherstov
Journal of Computer and System Sciences 75 (1), 2-12, 2009
1602009
Efficient algorithms for outlier-robust regression
A Klivans, PK Kothari, R Meka
Conference On Learning Theory, 1420-1430, 2018
952018
Reliably learning the relu in polynomial time
S Goel, V Kanade, A Klivans, J Thaler
Conference on Learning Theory, 1004-1042, 2017
952017
Learning Halfspaces with Malicious Noise.
AR Klivans, PM Long, RA Servedio
Journal of Machine Learning Research 10 (12), 2009
932009
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
842008
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
722008
Learnability beyond AC0
JC Jackson, AR Klivans, RA Servedio
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
712002
Learning neural networks with two nonlinear layers in polynomial time
S Goel, AR Klivans
Conference on Learning Theory, 1470-1499, 2019
70*2019
Learning graphical models using multiplicative weights
A Klivans, R Meka
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
692017
Hyperparameter optimization: A spectral approach
E Hazan, A Klivans, Y Yuan
arXiv preprint arXiv:1706.00764, 2017
692017
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
672011
Learning restricted models of arithmetic circuits
A Klivans, A Shpilka
Theory of computing 2 (1), 185-206, 2006
64*2006
Boosting and hard-core sets
AR Klivans, RA Servedio
40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999
611999
Agnostically learning decision trees
P Gopalan, AT Kalai, AR Klivans
Proceedings of the fortieth annual ACM symposium on Theory of computing, 527-536, 2008
602008
Toward Attribute Efficient Learning of Decision Lists and Parities.
AR Klivans, RA Servedio, D Ron
Journal of Machine Learning Research 7 (4), 2006
592006
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20