Adaptive Differentially Private Empirical Risk Minimization
arXiv:2110.07435
Abstract
We propose an adaptive (stochastic) gradient perturbation method for differentially private empirical risk minimization. At each iteration, the random noise added to the gradient is optimally adapted to the stepsize; we name this process adaptive differentially private (ADP) learning. Given the same privacy budget, we prove that the ADP method considerably improves the utility guarantee compared to the standard differentially private method in which vanilla random noise is added. Our method is particularly useful for gradient-based algorithms with time-varying learning rates, including variants of AdaGrad (Duchi et al., 2011). We provide extensive numerical experiments to demonstrate the effectiveness of the proposed adaptive differentially private algorithm.
References in corpus (13)
- Adam: A Method for Stochastic Optimization
- Deep Learning with Differential Privacy
- Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour
- On the Convergence of Adam and Beyond
- AdaGrad stepsizes: Sharp convergence over nonconvex landscapes
- Adaptive Bound Optimization for Online Convex Optimization
- Adaptive Federated Optimization
- Rényi Differential Privacy of the Sampled Gaussian Mechanism
- Differentially Private Learning with Adaptive Clipping
- AdaCliP: Adaptive Clipping for Private SGD
- Online Adaptive Methods, Universality and Acceleration
- Private Stochastic Non-Convex Optimization: Adaptive Algorithms and Tighter Generalization Bounds
- Membership Inference Attacks on Deep Regression Models for Neuroimaging