Optimal Rates for $O(1)$-Smooth DP-SCO with a Single Epoch and Large Batches
Christopher A. Choquette-Choo, Arun Ganesh, Abhradeep Thakurta

TL;DR
This paper introduces a new differentially private stochastic optimization algorithm that achieves optimal convergence rates in a single epoch with large batches, improving efficiency over previous methods.
Contribution
The paper presents Accelerated-DP-SRGD, a novel DP-SCO algorithm that attains optimal rates in one epoch using fewer batch gradient steps, applicable to non-convex losses with privacy guarantees.
Findings
Achieves optimal DP-SCO rates in a single epoch.
Uses $ ilde{O}( oot n)$ batch gradient steps with batch size $ oot n$.
Can handle non-convex losses with privacy via clipping.
Abstract
In this paper we revisit the DP stochastic convex optimization (SCO) problem. For convex smooth losses, it is well-known that the canonical DP-SGD (stochastic gradient descent) achieves the optimal rate of under -DP, and also well-known that variants of DP-SGD can achieve the optimal rate in a single epoch. However, the batch gradient complexity (i.e., number of adaptive optimization steps), which is important in applications like federated learning, is less well-understood. In particular, all prior work on DP-SCO requires batch gradient steps, multiple epochs, or convexity for privacy. We propose an algorithm, Accelerated-DP-SRGD (stochastic recursive gradient descent), which bypasses the limitations of past work: it achieves the optimal rate for DP-SCO (up to polylog…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems
MethodsLogistic Regression
