CRDSLGMLJun 9, 2022

Analytical Composition of Differential Privacy via the Edgeworth Accountant

arXiv:2206.04236v123 citationsh-index: 39
Originality Incremental advance
AI Analysis

This addresses the need for scalable privacy accounting in machine learning, offering a faster alternative to prior methods with increasing computational costs, though it appears incremental as it builds on existing frameworks like f-differential privacy.

The paper tackles the problem of efficiently computing overall privacy loss under composition in differential privacy by introducing the Edgeworth Accountant, which provides non-asymptotic (ε, δ)-differential privacy bounds with essentially no extra computational cost, demonstrating tight bounds in federated analytics and private deep learning regimes.

Many modern machine learning algorithms are composed of simple private algorithms; thus, an increasingly important problem is to efficiently compute the overall privacy loss under composition. In this study, we introduce the Edgeworth Accountant, an analytical approach to composing differential privacy guarantees of private algorithms. The Edgeworth Accountant starts by losslessly tracking the privacy loss under composition using the $f$-differential privacy framework, which allows us to express the privacy guarantees using privacy-loss log-likelihood ratios (PLLRs). As the name suggests, this accountant next uses the Edgeworth expansion to the upper and lower bounds the probability distribution of the sum of the PLLRs. Moreover, by relying on a technique for approximating complex distributions using simple ones, we demonstrate that the Edgeworth Accountant can be applied to the composition of any noise-addition mechanism. Owing to certain appealing features of the Edgeworth expansion, the $(ε, δ)$-differential privacy bounds offered by this accountant are non-asymptotic, with essentially no extra computational cost, as opposed to the prior approaches in, wherein the running times increase with the number of compositions. Finally, we demonstrate that our upper and lower $(ε, δ)$-differential privacy bounds are tight in federated analytics and certain regimes of training private deep learning models.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes