Folgen
Vitaly Feldman
Vitaly Feldman
Apple AI Research
Bestätigte E-Mail-Adresse bei apple.com - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
3302015
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
3232015
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
3092013
On agnostic learning of parities, monomials, and halfspaces
V Feldman, P Gopalan, S Khot, AK Ponnuswami
SIAM J. Comput 39 (2), 606-645, 2009
263*2009
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
2422019
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
226*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 28, 2015
2082015
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
1482012
Does learning require memorization? a short tale about a long tail
V Feldman
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
1412020
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
1212018
Private stochastic convex optimization with optimal rates
R Bassily, V Feldman, K Talwar, A Guha Thakurta
Advances in neural information processing systems 32, 2019
1162019
Privacy amplification by iteration
V Feldman, I Mironov, K Talwar, A Thakurta
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
962018
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
93*2008
On using extended statistical queries to avoid membership queries
NH Bshouty, V Feldman
The Journal of Machine Learning Research 2, 359-395, 2002
922002
What neural networks memorize and why: Discovering the long tail via influence estimation
V Feldman, C Zhang
Advances in Neural Information Processing Systems 33, 2881-2891, 2020
852020
Private stochastic convex optimization: optimal rates in linear time
V Feldman, T Koren, K Talwar
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
842020
Sealed calls in Java packages
A Zaks, V Feldman, N Aizikowitz
ACM SIGPLAN Notices 35 (10), 83-92, 2000
82*2000
High probability generalization bounds for uniformly stable algorithms with nearly optimal rate
V Feldman, J Vondrak
Conference on Learning Theory, 1270-1279, 2019
812019
Evolvability from learning algorithms
V Feldman
Proceedings of the fortieth annual ACM symposium on Theory of computing, 619-628, 2008
782008
Stability of stochastic gradient descent on nonsmooth convex losses
R Bassily, V Feldman, C Guzmán, K Talwar
Advances in Neural Information Processing Systems 33, 4381-4391, 2020
752020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20