Differentially Private Distributed Stochastic Optimization with Time-Varying Sample Sizes

doi:10.1109/TAC.2024.3379387

2024-09-01

Jimin Wang

张

张纪凤 (Ji‐Feng Zhang) *

DOI：10.1109/TAC.2024.3379387

原文链接

原文求助

摘要

En 中文

Differentially private distributed stochastic optimization has become a hot topic due to the need for privacy protection in distributed stochastic optimization. In this article, two-time scale stochastic approximation-type algorithms for differentially private distributed stochastic optimization with time-varying sample sizes are proposed using gradient- and output-perturbation methods. For both gradient- and output-perturbation cases, the convergence of the algorithm and differential privacy with a finite cumulative privacy budget $\varepsilon$ for an infinite number of iterations are simultaneously established, which is substantially different from the existing works. By a time-varying sample size method, the privacy level is enhanced, and differential privacy with a finite cumulative privacy budget $\varepsilon$ for an infinite number of iterations is established. By properly choosing a Lyapunov function, the algorithm achieves almost sure and mean square convergence even when the added privacy noise has an increasing variance. Furthermore, we rigorously provide the mean square convergence rates of the algorithm and show how the added privacy noise affects the convergence rate of the algorithm. Finally, numerical examples, including distributed training on a benchmark machine learning dataset, are presented to demonstrate the efficiency and advantages of the algorithms.

Keyword:

Optimization

Privacy

Convergence

Differential privacy

Machine learning algorithms

Approximation algorithms

Standards

Convergence rate

differential privacy

distributed stochastic optimization

privacy-preserving