paper-with-me

홈 › Papers

DPSUR: Accelerating Differentially Private Stochastic Gradient Descent Using Selective Update and Release

2023-11-23 · Jie Fu, Qingqing Ye, Haibo Hu, Zhili Chen, Lulu Wang, Kuncan Wang, Xun Ran

Machine learning models are known to memorize private data to reduce their training loss, which can be inadvertently exploited by privacy attacks such as model inversion and membership inference. To protect against these attacks, differential privacy (DP) has become the de facto standard for privacy-preserving machine learning, particularly those popular training algorithms using stochastic gradient descent, such as DPSGD. Nonetheless, DPSGD still suffers from severe utility loss due to its slow convergence. This is partially caused by the random sampling, which brings bias and variance to the gradient, and partially by the Gaussian noise, which leads to fluctuation of gradient updates. Our key idea to address these issues is to apply selective updates to the model training, while discarding those useless or even harmful updates. Motivated by this, this paper proposes DPSUR, a Differentially Private training framework based on Selective Updates and Release, where the gradient from each iteration is evaluated based on a validation test, and only those updates leading to convergence are applied to the model. As such, DPSUR ensures the training in the right direction and thus can achieve faster convergence than DPSGD. The main challenges lie in two aspects -- privacy concerns arising from gradient evaluation, and gradient selection strategy for model update. To address the challenges, DPSUR introduces a clipping strategy for update randomization and a threshold mechanism for gradient selection. Experiments conducted on MNIST, FMNIST, CIFAR-10, and IMDB datasets show that DPSUR significantly outperforms previous works in terms of convergence speed and model utility.

📄 PDF Abstract BibTeX arXiv:2311.14056

Code (2)

jefffffffu/dpsur 공식 구현 pytorch
yangyucheng000/Paper-3/tree/main/DPSUR-Implemented-by-Mindspore mindspore

Tasks

Privacy Preserving

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

Revisiting Privacy Amplification by Subsampling in Selective Release DPSGD

2026-06-03 · Xiaobo Huang, Fang Xie arxiv

Machine learning's reliance on sensitive data necessitates privacy-preserving techniques like Differentially Private Stochastic Gradient Descent (DPSGD). However, DPSGD suffers from substantial utility degradation and sl…

Adaptive Differentially Private Empirical Risk Minimization

2021-10-14 · Xiaoxia Wu, Lingxiao Wang, Irina Cristali, Quanquan Gu 외

We propose an adaptive (stochastic) gradient perturbation method for differentially private empirical risk minimization. At each iteration, the random noise added to the gradient is optimally adapted to the stepsize; we …

SA-DPSGD: Differentially Private Stochastic Gradient Descent based on Simulated Annealing

2022-11-14 · Jie Fu, Zhili Chen, XinPeng Ling

Differential privacy (DP) provides a formal privacy guarantee that prevents adversaries with access to machine learning models from extracting information about individual training points. Differentially private stochast…

image-classificationImage Classification

Differentially Private Stochastic Gradient Descent with Low-Noise

2022-09-09 · Puyu Wang, Yunwen Lei, Yiming Ying, Ding-Xuan Zhou

Modern machine learning algorithms aim to extract fine-grained information from data to provide accurate predictions, which often conflicts with the goal of privacy protection. This paper addresses the practical and theo…

Privacy Preserving

Differentially Private Gradient Flow based on the Sliced Wasserstein Distance

2023-12-13 · Ilana Sebag, Muni Sreenivas Pydi, Jean-Yves Franceschi, Alain Rakotomamonjy 외

Safeguarding privacy in sensitive training data is paramount, particularly in the context of generative modeling. This can be achieved through either differentially private stochastic gradient descent or a differentially…