Differentially Private Algorithms for Learning Mixtures of Separated\n Gaussians

2019/09/09 by Gautam Kamath, Or Sheffet, Kamath, Gautam +5
Computer Science · #Privacy-Preserving Technologies in Data #Machine Learning and Algorithms #Bayesian Modeling and Causal Inference

paper · pdf · doi:10.48550/arxiv.1909.03951

Abstract

Learning the parameters of Gaussian mixture models is a fundamental and\nwidely studied problem with numerous applications. In this work, we give new\nalgorithms for learning the parameters of a high-dimensional, well separated,\nGaussian mixture model subject to the strong constraint of differential\nprivacy. In particular, we give a differentially private analogue of the\nalgorithm of Achlioptas and McSherry. Our algorithm has two key properties not\nachieved by prior work: (1) The algorithm's sample complexity matches that of\nthe corresponding non-private algorithm up to lower order terms in a wide range\nof parameters. (2) The algorithm does not require strong a priori bounds on the\nparameters of the mixture components.\n

Related

• Polynomial Time and Private Learning of Unbounded Gaussian Mixture Models
• Sample-Efficient Private Learning of Mixtures of Gaussians
• Mixtures of Gaussians are Privately Learnable with a Polynomial Number of Samples
• Private estimation algorithms for stochastic block models and mixture models
• Privately Learning Mixtures of Axis-Aligned Gaussians