AIセキュリティポータル K Program
DiSK: Differentially Private Optimizer with Simplified Kalman Filter for Noise Reduction
Share
Abstract
Differential privacy (DP) offers a robust framework for safeguarding individual data privacy. To utilize DP in training modern machine learning models, differentially private optimizers have been widely used in recent years. A popular approach to privatize an optimizer is to clip the individual gradients and add sufficiently large noise to the clipped gradient. This approach led to the development of DP optimizers that have comparable performance with their non-private counterparts in fine-tuning tasks or in tasks with a small number of training parameters. However, a significant performance drop is observed when these optimizers are applied to large-scale training. This degradation stems from the substantial noise injection required to maintain DP, which disrupts the optimizer's dynamics. This paper introduces DiSK, a novel framework designed to significantly enhance the performance of DP optimizers. DiSK employs Kalman filtering, a technique drawn from control and signal processing, to effectively denoise privatized gradients and generate progressively refined gradient estimations. To ensure practicality for large-scale training, we simplify the Kalman filtering process, minimizing its memory and computational demands. We establish theoretical privacy-utility trade-off guarantees for DiSK, and demonstrate provable improvements over standard DP optimizers like DPSGD in terms of iteration complexity upper-bound. Extensive experiments across diverse tasks, including vision tasks such as CIFAR-100 and ImageNet-1k and language fine-tuning tasks such as GLUE, E2E, and DART, validate the effectiveness of DiSK. The results showcase its ability to significantly improve the performance of DP optimizers, surpassing state-of-the-art results under the same privacy constraints on several benchmarks.
Deep learning with differential privacy
Martin Abadi, Andy Chu, Ian Goodfellow, H Brendan McMahan, Ilya Mironov, Kunal Talwar, Li Zhang
Published: 2016
Variance reduction for faster non-convex optimization
Zeyuan Allen-Zhu, Elad Hazan
Published: 2016
Differentially private learning with adaptive clipping
Galen Andrew, Om Thakkar, Brendan McMahan, Swaroop Ramaswamy
Published: 2021
Analysis of the heavy-ball algorithm using integral quadratic constraints
Apurva Badithela, Peter Seiler
Published: 2019
Improving the gaussian mechanism for differential privacy: Analytical calibration and optimal denoising
Borja Balle, Yu-Xiang Wang
Published: 2018
Dp-mix: mixup-based data augmentation for differentially private learning
Wenxuan Bao, Francesco Pittaluga, Vijay Kumar BG, Vincent Bindschaedler
Published: 2024
Kalman filtering in stochastic gradient algorithms: construction of a stopping rule
Barbara Bittner, Luc Pronzato
Published: 2004
Differentially private optimization on large model at small cost
Z. Bu, Y. Wang, S. Zha, G. Karypis
Published: 2023
Automatic clipping: Differentially private deep learning made easier and stronger
Zhiqi Bu, Yu-Xiang Wang, Sheng Zha, George Karypis
Published: 2024
Improve single-point zeroth-order optimization using high-pass and low-pass filters
Xin Chen, Yujie Tang, Na Li
Published: 2022
Correlated noise provably beats independent noise for differentially private learning
Christopher A Choquette-Choo, Krishnamurthy Dj Dvijotham, Krishna Pillutla, Arun Ganesh, Thomas Steinke, Abhradeep Guha Thakurta
Published: 2024
Share