Vitaly Feldman
Vitaly Feldman
Apple AI Research
Verifierad e-postadress på apple.com - Startsida
Titel
Citeras av
Citeras av
År
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
2402015
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
2382013
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
2352015
On agnostic learning of parities, monomials, and halfspaces
V Feldman, P Gopalan, S Khot, AK Ponnuswami
SIAM J. Comput 39 (2), 606-645, 2009
211*2009
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
165*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
1512015
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
1232012
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
932018
On using extended statistical queries to avoid membership queries
NH Bshouty, V Feldman
The Journal of Machine Learning Research 2, 359-395, 2002
862002
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
84*2008
Sealed calls in Java packages
A Zaks, V Feldman, N Aizikowitz
ACM SIGPLAN Notices 35 (10), 83-92, 2000
79*2000
Amplification by shuffling: From local to central differential privacy via anonymity
Ú Erlingsson, V Feldman, I Mironov, A Raghunathan, K Talwar, ...
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
742019
Evolvability from learning algorithms
V Feldman
Proceedings of the fortieth annual ACM symposium on Theory of computing, 619-628, 2008
692008
A complete characterization of statistical query learning with applications to evolvability
V Feldman
Journal of Computer and System Sciences 78 (5), 1444-1459, 2012
642012
Sorting and selection with imprecise comparisons
M Ajtai, V Feldman, A Hassidim, J Nelson
International Colloquium on Automata, Languages, and Programming, 37-48, 2009
61*2009
Statistical query algorithms for mean vector estimation and stochastic convex optimization
V Feldman, C Guzman, S Vempala
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
50*2017
Optimal bounds on approximation of submodular and XOS functions by juntas
V Feldman, J Vondrak
SIAM Journal on Computing 45 (3), 1129-1170, 2016
482016
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
442009
Privacy-preserving prediction
C Dwork, V Feldman
arXiv preprint arXiv:1803.10266, 2018
422018
Privacy amplification by iteration
V Feldman, I Mironov, K Talwar, A Thakurta
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
412018
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20