Asymptotic Optimality of the High-Dimensional Gaussian Mechanism and Improved Low-Dimensional Mechanisms for Differential Privacy
Abstract
Lay Summary
Differential privacy allows data curator to publish useful statistics or train machine-learning models while limiting what can be learned about individual records. A common way to do this is to add random noise to the numerical result; the Gaussian noise is widely used, but it has not been clear when it is truly the best choice. This paper shows that when the query result is in high dimenions, as in modern machine-learning models, no additive-noise mechanism can asymptotically improve on the Gaussian mechanism's privacy--utility tradeoff for the strong privacy settings typically used. The paper also studies cases where the query result is in low dimenions. There, it introduces a flexible new family of noise choices and finds settings where some choices give the same privacy with up to 15% less error than both Gaussian noise and a recent alternative. Finally, the paper gives a way to accurately track privacy when these methods are used many times.