Improved Rates for Differentially Private Stochastic Convex Optimization with Heavy-Tailed Data

06/02/2021 ∙ by Gautam Kamath, et al. ∙ 0

We study stochastic convex optimization with heavy-tailed data under the constraint of differential privacy. Most prior work on this problem is restricted to the case where the loss function is Lipschitz. Instead, as introduced by Wang, Xiao, Devadas, and Xu, we study general convex loss functions with the assumption that the distribution of gradients has bounded k-th moments. We provide improved upper bounds on the excess population risk under approximate differential privacy of Õ(√(d/n)+(d/ϵ n)^k-1/k) and Õ(d/n+(d/ϵ n)^2k-2/k) for convex and strongly convex loss functions, respectively. We also prove nearly-matching lower bounds under the constraint of pure differential privacy, giving strong evidence that our bounds are tight.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.