Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Feldman, Vitaly
119  Ergebnisse:
Personensuche X
?
1

Differentially Private Heavy Hitter Detection using Federat..:

, In: 2024 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML),
Chadha, Karan ; Chen, Junye ; Duchi, John... - p. 512-533 , 2024
Link: https://doi.org/10.1109/..
 
?
2

Hiding Among the Clones: A Simple and Nearly Optimal Analys..:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Feldman, Vitaly ; McMillan, Audra ; Talwar, Kunal - p. 954-964 , 2022
Link: https://doi.org/10.1109/..
 
?
3

When is memorization of irrelevant training data necessary ..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Brown, Gavin ; Bun, Mark ; Feldman, Vitaly.. - p. 123-132 , 2021
Link: https://dl.acm.org/doi/1..
 
?
4

Private stochastic convex optimization: optimal rates in li..:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Feldman, Vitaly ; Koren, Tomer ; Talwar, Kunal - p. 439-449 , 2020
Link: https://dl.acm.org/doi/1..
 
?
5

Interaction is necessary for distributed learning with priv..:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Dagan, Yuval ; Feldman, Vitaly - p. 450-462 , 2020
Link: https://dl.acm.org/doi/1..
 
?
6

Tight bounds on ℓ1 approximation and learning of self-bound..:

Feldman, Vitaly ; Kothari, Pravesh ; Vondrák, Jan
Theoretical Computer Science.  808 (2020)  - p. 86-98 , 2020
Link: https://doi.org/10.1016/..
 
?
7

Does learning require memorization? a short tale about a lo..:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Feldman, Vitaly - p. 954-959 , 2020
Link: https://dl.acm.org/doi/1..
 
?
8

Amplification by shuffling : from local to central diffe..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Erlingsson, Úlfar ; Feldman, Vitaly ; Mironov, Ilya... - p. 2468-2479 , 2019
Link: https://dl.acm.org/doi/1..
 
?
9

On the Complexity of Random Satisfiability Problems with Pl..:

Feldman, Vitaly ; Perkins, Will ; Vempala, Santosh
SIAM Journal on Computing.  47 (2018)  4 - p. 1294-1338 , 2018
Link: https://doi.org/10.1137/..
 
?
10

Statistical Algorithms and a Lower Bound for Detecting Plan..:

Feldman, Vitaly ; Grigorescu, Elena ; Reyzin, Lev..
Journal of the ACM (JACM).  64 (2017)  2 - p. 1-37 , 2017
Link: https://dl.acm.org/doi/1..
 
?
11

Statistical Algorithms and a Lower Bound for Detecting Plan..:

Feldman, Vitaly ; Grigorescu, Elena ; Reyzin, Lev..
Journal of the ACM.  64 (2017)  2 - p. 1-37 , 2017
Link: https://doi.org/10.1145/..
 
?
12

Guilt-free data reuse:

Dwork, Cynthia ; Feldman, Vitaly ; Hardt, Moritz...
Communications of the ACM.  60 (2017)  4 - p. 86-93 , 2017
Link: https://dl.acm.org/doi/1..
 
?
13

Guilt-free data reuse:

Dwork, Cynthia ; Feldman, Vitaly ; Hardt, Moritz...
Communications of the ACM.  60 (2017)  4 - p. 86-93 , 2017
Link: https://doi.org/10.1145/..
 
?
14

Statistical query algorithms for mean vector estimation and..:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,
Feldman, Vitaly ; Guzmán, Cristóbal ; Vempala, Santosh - p. 1265-1277 , 2017
Link: https://dl.acm.org/doi/1..
 
?
15

Optimal Bounds on Approximation of Submodular and XOS Funct..:

Feldman, Vitaly ; Vondrák, Jan
SIAM Journal on Computing.  45 (2016)  3 - p. 1129-1170 , 2016
Link: https://doi.org/10.1137/..
 
1-15