activity
20092026
most citedPrivacy Amplification by Iteration

115 citations · 816 across the 62 of their papers we have counts for

collaborators
Showing cs.LGShow all

47 papers · 1 filter

cs.LG2025

Privacy amplification by random allocation

Vitaly Feldman, Moshe Shenfeld

We consider the privacy amplification properties of a sampling scheme in which a user's data is used in k steps chosen randomly and uniformly from a sequence (or set) of t steps. T…

cs.LG2024

Instance-Optimal Private Density Estimation in the Wasserstein Distance

Vitaly Feldman, Audra McMillan, Satchit Sivakumar +1

Estimating the density of a distribution from samples is a fundamental problem in statistics. In many practical settings, the Wasserstein distance is an appropriate error metric fo…

cs.LG2023★ 5 cited

Enabling Differentially Private Federated Learning for Speech Recognition: Benchmarks, Adaptive Optimizers and Gradient Clipping

Martin Pelikan, Sheikh Shams Azam, Vitaly Feldman +4

While federated learning (FL) and differential privacy (DP) have been extensively studied, their application to automatic speech recognition (ASR) remains largely unexplored due to…

cs.LG2023★ 1 cited

Differentially Private Heavy Hitter Detection using Federated Analytics

Karan Chadha, Junye Chen, John Duchi +5

In this work, we study practical heuristics to improve the performance of prefix-tree based algorithms for differentially private heavy hitter detection. Our model assumes each use…

cs.LG2023★ 1 cited

Fast Optimal Locally Private Mean Estimation via Random Projections

Hilal Asi, Vitaly Feldman, Jelani Nelson +2

We study the problem of locally private mean estimation of high-dimensional vectors in the Euclidean ball. Existing algorithms for this problem either incur sub-optimal error or ha…

cs.LG2023

Near-Optimal Algorithms for Private Online Optimization in the Realizable Regime

Hilal Asi, Vitaly Feldman, Tomer Koren +1

We consider online learning problems in the realizable setting, where there is a zero-loss solution, and propose new Differentially Private (DP) algorithms that obtain near-optimal…