Vitaly Feldman
TitleCited byYear
Cognitive computing building block: A versatile and efficient digital neuron model for neurosynaptic cores
AS Cassidy, P Merolla, JV Arthur, SK Esser, B Jackson, R Alvarez-Icaza, ...
The 2013 International Joint Conference on Neural Networks (IJCNN), 1-10, 2013
1822013
On agnostic learning of parities, monomials, and halfspaces
V Feldman, P Gopalan, S Khot, AK Ponnuswami
SIAM J. Comput 39 (2), 606-645, 2009
182*2009
Preserving statistical validity in adaptive data analysis
C Dwork, V Feldman, M Hardt, T Pitassi, O Reingold, AL Roth
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
1682015
The reusable holdout: Preserving validity in adaptive data analysis
C Dwork, V Feldman, M Hardt, T Pitassi, O Reingold, A Roth
Science 349 (6248), 636-638, 2015
1642015
Statistical algorithms and a lower bound for detecting planted cliques
V Feldman, E Grigorescu, L Reyzin, S Vempala, Y Xiao
Journal of the ACM (JACM), 2017, 655-664, 2013
125*2013
Generalization in adaptive data analysis and holdout reuse
C Dwork, V Feldman, M Hardt, T Pitassi, O Reingold, A Roth
Advances in Neural Information Processing Systems, 2350-2358, 2015
1062015
Agnostic learning of monomials by halfspaces is hard
V Feldman, V Guruswami, P Raghavendra, Y Wu
SIAM Journal on Computing 41 (6), 1558-1590, 2012
1012012
The complexity of properly learning simple concept classes
M Alekhnovich, M Braverman, V Feldman, AR Klivans, T Pitassi
Journal of Computer and System Sciences 74 (1), 16-34, 2008
79*2008
On using extended statistical queries to avoid membership queries
NH Bshouty, V Feldman
The Journal of Machine Learning Research 2, 359-395, 2002
772002
Sealed calls in Java packages
A Zaks, V Feldman, N Aizikowitz
ACM SIGPLAN Notices 35 (10), 83-92, 2000
76*2000
On the complexity of random satisfiability problems with planted solutions
V Feldman, W Perkins, S Vempala
SIAM Journal on Computing 47 (4), 1294-1338, 2018
722018
Evolvability from learning algorithms
V Feldman
Proceedings of the fortieth annual ACM symposium on Theory of computing, 619-628, 2008
562008
A complete characterization of statistical query learning with applications to evolvability
V Feldman
Journal of Computer and System Sciences 78 (5), 1444-1459, 2012
532012
Sorting and selection with imprecise comparisons
M Ajtai, V Feldman, A Hassidim, J Nelson
International Colloquium on Automata, Languages, and Programming, 37-48, 2009
53*2009
Hardness of approximate two-level logic minimization and PAC learning with membership queries
V Feldman
Journal of Computer and System Sciences 75 (1), 13-26, 2009
452009
Optimal bounds on approximation of submodular and XOS functions by juntas
V Feldman, J Vondrak
SIAM Journal on Computing 45 (3), 1129-1170, 2016
412016
Statistical active learning algorithms
MFF Balcan, V Feldman
Advances in neural information processing systems, 1295-1303, 2013
362013
Statistical query algorithms for mean vector estimation and stochastic convex optimization
V Feldman, C Guzmán, S Vempala
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
33*2017
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
A De, I Diakonikolas, V Feldman, RA Servedio
Journal of the ACM (JACM) 61 (2), 11, 2014
332014
Attribute-efficient and non-adaptive learning of parities and dnf expressions
V Feldman
Journal of Machine Learning Research 8 (Jul), 1431-1460, 2007
332007
The system can't perform the operation now. Try again later.
Articles 1–20