Mixtures of Gaussians are Privately Learnable with a Polynomial Number of Samples

arXiv:2309.03847v3 Announce Type: replace-cross
Abstract: We study the problem of estimating mixtures of Gaussians under the constraint of differential privacy (DP). Our main result is that $\text{poly}(k,d,1/\alpha,1/\varepsilon,\log(1/\delta))$ samples are sufficient to estimate a mixture of $k$ Gaussians in $\mathbb{R}^d$ up to total variation distance $\alpha$ while satisfying $(\varepsilon, \delta)$-DP. This is the first finite sample complexity upper bound for the problem that does not make any structural assumptions on the GMMs.
To solve the problem, we devise a new framework …

alpha arxiv cs.cr cs.ds cs.it cs.lg delta differential privacy log main math.it poly privacy privately problem result stat.ml study text under