Vitaly Feldman, Ph.D.
Affiliations: | 2007 | Harvard University, Cambridge, MA, United States |
Google:
"Vitaly Feldman"Parents
Sign in to add mentor| Leslie G. Valiant | grad student | 2007 | Harvard | |
| (Efficiency and computational limitations of learning algorithms.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Feldman V, Kothari P, Vondrák J. (2020) Tight bounds on ℓ1 approximation and learning of self-bounding functions Theoretical Computer Science. 808: 86-98 |
| Dwork C, Feldman V, Hardt M, et al. (2017) Guilt-free data reuse Communications of the Acm. 60: 86-93 |
| Feldman V, Vondrák J. (2016) Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas Siam Journal On Computing. 45: 1129-1170 |
| Feldman V, Xiao D. (2015) Sample Complexity Bounds on Differentially Private Learning via Communication Complexity Siam Journal On Computing. 44: 1740-1764 |
| Balcan MF, Feldman V. (2015) Statistical Active Learning Algorithms for Noise Tolerance and Differential Privacy Algorithmica. 72: 282-315 |
| Feldman V, Vondrák J. (2014) Structure and learning of valuation functions Acm Sigecom Exchanges. 12: 50-53 |
| De A, Diakonikolas I, Feldman V, et al. (2014) Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces Journal of the Acm. 61 |
| Feldman V, Grigorescu E, Reyzin L, et al. (2013) Statistical algorithms and a lower bound for detecting planted cliques Proceedings of the Annual Acm Symposium On Theory of Computing. 655-664 |
| Feldman V, Guruswami V, Raghavendra P, et al. (2012) Agnostic learning of monomials by halfspaces is hard Siam Journal On Computing. 41: 1558-1590 |
| Feldman V. (2012) A complete characterization of statistical query learning with applications to evolvability Journal of Computer and System Sciences. 78: 1444-1459 |