Privacy of the last iterate in cyclically-sampled DP-SGD on nonconvex composite losses
<|reference_start|>Privacy of the last iterate in cyclically-sampled DP-SGD on nonconvex composite losses: Differentially private stochastic gradient descent (DP-SGD) refers to a family of optimization algorithms that provide a guaranteed level of differential privacy (DP) through DP accounting techniques. However, current accounting techniques make assumptions that diverge significantly from practical DP-SGD implementations. For example, they may assume the loss function is Lipschitz continuous and convex, sample the batches randomly with replacement, or omit the gradient clipping step.   In this work, we analyze the most commonly used variant of DP-SGD, in which we sample batches cyclically with replacement, perform gradient clipping, and only release the last DP-SGD iterate. More specifically - without assuming convexity, smoothness, or Lipschitz continuity of the loss function - we establish new R\'enyi differential privacy (RDP) bounds for the last DP-SGD iterate under the mild assumption that (i) the DP-SGD stepsize is small relative to the topological constants in the loss function, and (ii) the loss function is weakly-convex. Moreover, we show that our bounds converge to previously established convex bounds when the weak-convexity parameter of the objective function approaches zero. In the case of non-Lipschitz smooth loss functions, we provide a weaker bound that scales well in terms of the number of DP-SGD iterations.<|reference_end|>
@article{kong2024privacy,
    title={Privacy of the last iterate in cyclically-sampled DP-SGD on nonconvex
  composite losses},
    author={Weiwei Kong, M'onica Ribero},
    journal={arXiv preprint arXiv:2407.05237},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.05237},
    primaryClass={cs.LG cs.CR cs.DS math.OC stat.ML}
}