A Better Bound Gives a Hundred Rounds: Enhanced Privacy Guarantees via f-Divergences

01/16/2020
by   Shahab Asoodeh, et al.
0

We derive the optimal differential privacy (DP) parameters of a mechanism that satisfies a given level of Rényi differential privacy (RDP). Our result is based on the joint range of two f-divergences that underlie the approximate and the Rényi variations of differential privacy. We apply our result to the moments accountant framework for characterizing privacy guarantees of stochastic gradient descent. When compared to the state-of-the-art, our bounds may lead to about 100 more stochastic gradient descent iterations for training deep learning models for the same privacy budget.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/14/2020

Three Variants of Differential Privacy: Lossless Conversion and Applications

We consider three different variants of differential privacy (DP), namel...
research
06/25/2020

Stability Enhanced Privacy and Applications in Private Stochastic Gradient Descent

Private machine learning involves addition of noise while training, resu...
research
11/26/2019

Deep Learning with Gaussian Differential Privacy

Deep learning models are often trained on datasets that contain sensitiv...
research
06/07/2019

Computing Exact Guarantees for Differential Privacy

Quantification of the privacy loss associated with a randomised algorith...
research
11/27/2018

LEASGD: an Efficient and Privacy-Preserving Decentralized Algorithm for Distributed Learning

Distributed learning systems have enabled training large-scale models ov...
research
07/11/2019

Amplifying Rényi Differential Privacy via Shuffling

Differential privacy is a useful tool to build machine learning models w...
research
05/02/2023

Revisiting Gradient Clipping: Stochastic bias and tight convergence guarantees

Gradient clipping is a popular modification to standard (stochastic) gra...

Please sign up or login with your details

Forgot password? Click here to reset