Computing Tight Differential Privacy Guarantees Using FFT

Show full item record



Permalink

http://hdl.handle.net/10138/317154

Citation

Koskela , A , Honkela , A & Jälkö , J 2019 , ' Computing Tight Differential Privacy Guarantees Using FFT ' , TPDP 2019 - Theory and Practice of Differential Privacy CCS Workshop , Lontoo , Britannia , 11/11/2019 .

Title: Computing Tight Differential Privacy Guarantees Using FFT
Author: Koskela, Antti; Honkela, Antti; Jälkö, Joonas
Contributor: Helsingin yliopisto, Tietojenkäsittelytieteen osasto
Helsingin yliopisto, Antti Honkela / Vastuullinen tutkija
Date: 2019-11-11
URI: http://hdl.handle.net/10138/317154
Abstract: Computing privacy parameters for the differentially private stochastic gradient descent method (DP-SGD) is equivalent to analysing one dimensional mechanisms. We propose a numerical accountant for evaluating the (ε, δ)-privacy loss for mech- anisms with continuous one dimensional output. The proposed method is based on a numerical approximation of an integral formula which gives the tight (ε, δ)-values. The approximation is carried out by discretising the integral and by evaluating the resulting discrete convolutions using the fast Fourier transform algorithm. We focus on the subsampled Gaussian mechanism which underlies DP-SGD. We give both theoretical error bounds and numerical error estimates for the approximation. Experimen- tal comparisons with state-of-the-art techniques demonstrate significant improvements in bound tightness and/or computation time. Python code for the method can be found in Github (https://github.com/DPBayes/PLD-Accountant/).
Subject: 113 Tietojenkäsittely- ja informaatiotieteet
Rights:


Files in this item

Total number of downloads: Loading...

Files Size Format View
poster_computing_tight_DP_2.pdf 199.2Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record