☰

Vitaly Feldman, Ph.D. - Publications

Affiliations: 
2007 Harvard University, Cambridge, MA, United States 
Tree Info Similar researchers PubMed Report error

16 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Feldman V, Kothari P, Vondrák J. Tight bounds on ℓ1 approximation and learning of self-bounding functions Theoretical Computer Science. 808: 86-98. DOI: 10.1016/J.Tcs.2019.11.013  0.423
2017 Dwork C, Feldman V, Hardt M, Pitassi T, Reingold O, Roth A. Guilt-free data reuse Communications of the Acm. 60: 86-93. DOI: 10.1145/3051088  0.347
2016 Feldman V, Vondrák J. Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas Siam Journal On Computing. 45: 1129-1170. DOI: 10.1137/140958207  0.365
2015 Feldman V, Xiao D. Sample Complexity Bounds on Differentially Private Learning via Communication Complexity Siam Journal On Computing. 44: 1740-1764. DOI: 10.1137/140991844  0.39
2015 Balcan MF, Feldman V. Statistical Active Learning Algorithms for Noise Tolerance and Differential Privacy Algorithmica. 72: 282-315. DOI: 10.1007/S00453-014-9954-9  0.441
2014 Feldman V, Vondrák J. Structure and learning of valuation functions Acm Sigecom Exchanges. 12: 50-53. DOI: 10.1145/2692359.2692371  0.465
2014 De A, Diakonikolas I, Feldman V, Servedio RA. Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces Journal of the Acm. 61. DOI: 10.1145/2590772  0.53
2013 Feldman V, Grigorescu E, Reyzin L, Vempala SS, Xiao Y. Statistical algorithms and a lower bound for detecting planted cliques Proceedings of the Annual Acm Symposium On Theory of Computing. 655-664. DOI: 10.1145/3046674  0.416
2012 Feldman V, Guruswami V, Raghavendra P, Wu Y. Agnostic learning of monomials by halfspaces is hard Siam Journal On Computing. 41: 1558-1590. DOI: 10.1137/120865094  0.435
2012 Feldman V. A complete characterization of statistical query learning with applications to evolvability Journal of Computer and System Sciences. 78: 1444-1459. DOI: 10.1016/J.Jcss.2011.12.024  0.46
2009 Feldman V, Valiant LG. Experience-induced neural circuits that achieve high capacity. Neural Computation. 21: 2715-54. PMID 19635015 DOI: 10.1162/Neco.2009.08-08-851  0.519
2009 Feldman V, Gopalan P, Khot S, Ponnuswami AK. On Agnostic Learning of Parities, Monomials, and Halfspaces Siam Journal On Computing. 39: 606-645. DOI: 10.1137/070684914  0.473
2009 Feldman V, Shah S. Separating models of learning with faulty teachers Theoretical Computer Science. 410: 1903-1912. DOI: 10.1016/J.Tcs.2009.01.017  0.427
2009 Feldman V. Hardness of approximate two-level logic minimization and PAC learning with membership queries Journal of Computer and System Sciences. 75: 13-26. DOI: 10.1016/J.Jcss.2008.07.007  0.463
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.441
2002 Bshouty NH, Feldman V. On Using Extended Statistical Queries to Avoid Membership Queries Journal of Machine Learning Research. 2: 359-395. DOI: 10.1162/153244302760200669  0.465
Show low-probability matches.