| Year |
Citation |
Score |
| 2012 |
Harsha P, Klivans A, Meka R. An invariance principle for polytopes Journal of the Acm. 59. DOI: 10.1145/2395116.2395118 |
0.44 |
|
| 2012 |
Gopalan P, Klivans AR, Meka R. Learning functions of halfspaces using prefix covers Journal of Machine Learning Research. 23: 15.1-15.10. |
0.47 |
|
| 2010 |
Klivans AR, Sherstov AA. Lower bounds for agnostic learning via approximate rank Computational Complexity. 19: 581-604. DOI: 10.1007/S00037-010-0296-Y |
0.515 |
|
| 2009 |
Klivans AR, Sherstov AA. Cryptographic hardness for learning intersections of halfspaces Journal of Computer and System Sciences. 75: 2-12. DOI: 10.1016/J.Jcss.2008.07.008 |
0.585 |
|
| 2009 |
Klivans AR, Long PM, Tang AK. Baum's algorithm learns intersections of halfspaces with respect to log-concave distributions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5687: 588-600. DOI: 10.1007/978-3-642-03685-9_44 |
0.499 |
|
| 2009 |
Klivans AR, Long PM, Servedio RA. Learning halfspaces with malicious noise Journal of Machine Learning Research. 10: 2715-2740. DOI: 10.1007/978-3-642-02927-1_51 |
0.357 |
|
| 2009 |
Klivans AR, Long PM, Servedio RA. Learning halfspaces with malicious noise Journal of Machine Learning Research. 10: 2715-2740. |
0.357 |
|
| 2008 |
Kalai AT, Klivans AR, Mansour Y, Servedio RA. Agnostically Learning Halfspaces Siam Journal On Computing. 37: 1777-1805. DOI: 10.1137/060649057 |
0.571 |
|
| 2008 |
Klivans AR, O'Donnell R, Servedio RA. Learning geometric concepts via gaussian surface area Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 541-550. DOI: 10.1109/FOCS.2008.64 |
0.395 |
|
| 2008 |
Alekhnovich M, Braverman M, Feldman V, Klivans AR, Pitassi T. The complexity of properly learning simple concept classes Journal of Computer and System Sciences. 74: 16-34. DOI: 10.1016/J.Jcss.2007.04.011 |
0.578 |
|
| 2008 |
Gopalan P, Kalai AT, Klivans AR. A query algorithm for agnostically learning DNF? 21st Annual Conference On Learning Theory, Colt 2008. 515-516. |
0.505 |
|
| 2008 |
Gopalan P, Kalai AT, Klivans AR. Agnostically learning decision trees Proceedings of the Annual Acm Symposium On Theory of Computing. 527-536. |
0.544 |
|
| 2007 |
Klivans AR, Sherstov AA. Unconditional lower bounds for learning intersections of halfspaces Machine Learning. 69: 97-114. DOI: 10.1007/S10994-007-5010-1 |
0.586 |
|
| 2007 |
Klivans AR, Sherstov AA. A lower bound for agnostically learning disjunctions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4539: 409-423. |
0.491 |
|
| 2006 |
Klivans AR, Shpilka A. Learning Restricted Models of Arithmetic Circuits Theory of Computing. 2: 185-206. DOI: 10.4086/Toc.2006.V002A010 |
0.542 |
|
| 2006 |
Fortnow L, Klivans AR. Efficient learning algorithms yield circuit lower bounds Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4005: 350-363. DOI: 10.1016/J.Jcss.2008.07.006 |
0.566 |
|
| 2006 |
Fortnow L, Klivans AR. Efficient learning algorithms yield circuit lower bounds Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4005: 350-363. |
0.567 |
|
| 2006 |
Klivans AR, Sherstov AA. Improved lower bounds for learning intersections of halfspaces Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4005: 335-349. |
0.57 |
|
| 2005 |
Kalai AT, Klivans AR, Mansour Y, Servedio RA. Agnostically learning halfspaces Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2005: 11-20. DOI: 10.1109/SFCS.2005.13 |
0.473 |
|
| 2004 |
Klivans AR, Servedio RA. Learning intersections of halfspaces with a margin Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 3120: 348-362. DOI: 10.1016/J.Jcss.2007.04.012 |
0.574 |
|
| 2004 |
Klivans AR, Servedio RA. Learning DNF in time 2Õ(n(1/3)) Journal of Computer and System Sciences. 68: 303-318. DOI: 10.1016/J.Jcss.2003.07.007 |
0.619 |
|
| 2004 |
Klivans AR, Servedio RA. Toward attribute efficient learning of decision lists and parities Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 3120: 224-238. |
0.553 |
|
| 2004 |
Alekhnovich M, Braverman M, Feldman V, Klivans AR, Pitassi T. Learnability and automatizability Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 621-630. |
0.557 |
|
| 2004 |
Klivans AR, Servedio RA. Perceptron-like performance for intersections of halfspaces Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 3120: 639-640. |
0.516 |
|
| 2003 |
Klivans AR, Servedio RA. Boosting and hard-core set construction Machine Learning. 51: 217-238. DOI: 10.1023/A:1022949332276 |
0.517 |
|
| 2003 |
Klivans AR, Shpilka A. Learning arithmetic circuits via partial derivatives Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 2777: 463-476. |
0.431 |
|
| 2002 |
Klivans AR, Van Melkebeek D. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses Siam Journal On Computing. 31: 1501-1526. DOI: 10.1137/S0097539700389652 |
0.404 |
|
| 2002 |
Klivans AR, O'Donnell R, Servedio RA. Learning intersections and thresholds of halfspaces Annual Symposium On Foundations of Computer Science - Proceedings. 177-186. DOI: 10.1016/j.jcss.2003.11.002 |
0.582 |
|
| 2001 |
Klivans AR, Servedio RA. Learning DNF in time 2Õ(n1/3) Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 258-265. |
0.63 |
|
| 2001 |
Klivans AR, Spielman DA. Randomness efficient identity testing of multivariate polynomials Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 216-223. |
0.404 |
|
| Show low-probability matches. |