paper-with-me

홈 › Papers

Differentially Private Algorithms for Learning Mixtures of Separated Gaussians

2019-09-09 · NeurIPS 2019 12 · Gautam Kamath, Or Sheffet, Vikrant Singhal, Jonathan Ullman

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

📄 PDF Abstract BibTeX arXiv:1909.03951

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Private estimation algorithms for stochastic block models and mixture models

2023-01-11 · NeurIPS 2023 11

We introduce general tools for designing efficient private estimation algorithms, in the high-dimensional settings, whose statistical guarantees almost match those of the best known non-private algorithms. To illustrate …

Private Estimation with Public Data

2022-08-16 · Alex Bie, Gautam Kamath, Vikrant Singhal

We initiate the study of differentially private (DP) estimation with access to a small amount of public data. For private estimation of d-dimensional Gaussians, we assume that the public data comes from a Gaussian that m…

Sample-Efficient Private Learning of Mixtures of Gaussians

2024-11-04 · Hassan Ashtiani, Mahbod Majid, Shyam Narayanan

We study the problem of learning mixtures of Gaussians with approximate differential privacy. We prove that roughly $kd^2 + k^{1.5} d^{1.75} + k^2 d$ samples suffice to learn a mixture of $k$ arbitrary $d$-dimensional Ga…

Privately Learning Mixtures of Axis-Aligned Gaussians

2021-06-03 · NeurIPS 2021 12 · Ishaq Aden-Ali, Hassan Ashtiani, Christopher Liaw

We consider the problem of learning mixtures of Gaussians under the constraint of approximate differential privacy. We prove that $\widetilde{O}(k^2 d \log^{3/2}(1/\delta) / \alpha^2 \varepsilon)$ samples are sufficient …

Learning Mixtures of Gaussians Using the DDPM Objective

2023-07-03 · NeurIPS 2023 11

Recent works have shown that diffusion models can learn essentially any distribution provided one can perform score estimation. Yet it remains poorly understood under what settings score estimation is possible, let alone…

Denoising