Fetching the paper…
Reading the bibliography…
We study the problem of privately estimating the parameters of $d$-dimensional Gaussian Mixture Models (GMMs) with $k$ components.
“Privately learning high-dimensional distributions”
Gautam Kamath, Jerry Li, Vikrant Singhal and Jonathan Ullman · 1902
Earlier work this paper cites.
“Rates of convergence of minimum distance estimators and Kolmogorov’s entropy”
Yannis Yatracos · 1985
Earlier work this paper cites.
“Learning mixtures of Gaussians”
Sanjoy Dasgupta · 1999
Earlier work this paper cites.
“Adaptive estimation of a quadratic functional by model selection”
Beatrice Laurent and Pascal Massart · 2000
Earlier work this paper cites.
“Combinatorial methods in density estimation”
Luc Devroye and Gábor Lugosi · 2001
Earlier work this paper cites.
“Learning mixtures of arbitrary gaussians”
Arora Sanjeev and Ravi Kannan · 2001
Earlier work this paper cites.
“A spectral algorithm for learning mixture models”
Santosh Vempala and Grant Wang · 2004
Earlier work this paper cites.
“On spectral learning of mixtures of distributions”
Dimitris Achlioptas and Frank McSherry · 2005
Earlier work this paper cites.
“Our data, ourselves: Privacy via distributed noise generation”
Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov and Moni Naor · 2006
Earlier work this paper cites.
“Calibrating noise to sensitivity in private data analysis”
Cynthia Dwork, Frank McSherry, Kobbi Nissim and Adam Smith · 2006
Earlier work this paper cites.
“PAC learning axis-aligned mixtures of Gaussians with no separation assumption”
Jon Feldman, Rocco Servedio and Ryan O’Donnell · 2006
Earlier work this paper cites.
“Gaussian processes for machine learning”
Christopher Williams and Carl Rasmussen · 2006
Earlier work this paper cites.
“Smooth sensitivity and sampling in private data analysis”
Kobbi Nissim, Sofya Raskhodnikova and Adam Smith · 2007
Earlier work this paper cites.
“Isotropic PCA and affine-invariant clustering”
S Brubaker and Santosh Vempala · 2008
Earlier work this paper cites.
“Learning Gaussian mixtures with arbitrary separation”
Mikhail Belkin and Kaushik Sinha · 2009
Earlier work this paper cites.
“Differential privacy and robust statistics”
Cynthia Dwork and Jing Lei · 2009
Earlier work this paper cites.
“Polynomial learning of distribution families”
Mikhail Belkin and Kaushik Sinha · 2010
Earlier work this paper cites.
“Boosting and Differential Privacy”
Cynthia Dwork, Guy. Rothblum and Salil. Vadhan · 2010
Earlier work this paper cites.
“Efficiently learning mixtures of two Gaussians”
Adam Kalai, Ankur Moitra and Gregory Valiant · 2010
Earlier work this paper cites.
“Settling the polynomial learnability of mixtures of gaussians”
Ankur Moitra and Gregory Valiant · 2010
Earlier work this paper cites.
“Learning mixtures of spherical gaussians: moment methods and spectral decompositions”
Daniel Hsu and Sham Kakade · 2013
Earlier work this paper cites.
“The more, the merrier: the blessing of dimensionality for learning large Gaussian mixtures”
Joseph Anderson, Mikhail Belkin, Navin Goyal, Luis Rademacher and James Voss · 2014
Earlier work this paper cites.
“Efficient density estimation via piecewise polynomial approximation”
Siu-On Chan, Ilias Diakonikolas, Rocco Servedio and Xiaorui Sun · 2014
Cited alongside, same era.
“The algorithmic foundations of differential privacy”
Cynthia Dwork and Aaron Roth · 2014
Cited alongside, same era.
“Sharp bounds for learning a mixture of two Gaussians”
Moritz Hardt and Eric Price · 2014
Cited alongside, same era.
“Sample-optimal density estimation in nearly-linear time”
Jayadev Acharya, Ilias Diakonikolas, Jerry Li and Ludwig Schmidt · 2017
Cited alongside, same era.
“Statistical query lower bounds for robust estimation of high-dimensional gaussians and gaussian mixtures”
Ilias Diakonikolas, Daniel Kane and Alistair Stewart · 2017
Cited alongside, same era.
“Covariance-aware private mean estimation without private covariance estimation”
Gavin Brown, Marco Gaboardi, Adam Smith, Jonathan Ullman and Lydia Zakynthinou · 2021
Later among the works it cites.
“Robust and differentially private mean estimation”
Xiyang Liu, Weihao Kong, Sham Kakade and Sewoong Oh · 2021
Later among the works it cites.
“Settling the robust learnability of mixtures of gaussians”
Allen Liu and Ankur Moitra · 2021
Later among the works it cites.
“Privately Estimating a Gaussian: Efficient, Robust and Optimal”
Daniel Alabi, Pravesh. Kothari, Pranay Tankala, Prayaag Venkat and Fred Zhang · 2022
Later among the works it cites.
“Private and polynomial time algorithms for learning Gaussians and beyond”
Hassan Ashtiani and Christopher Liaw · 2022
Later among the works it cites.
“Robustly learning mixtures of k arbitrary gaussians”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Vishesh Karwa and Salil Vadhan · 2017
Cited alongside, same era.
“Robust and proper learning for mixtures of gaussians via systems of polynomial inequalities”
Jerry Li and Ludwig Schmidt · 2017
Cited alongside, same era.
“On learning mixtures of well-separated gaussians”
Oded Regev and Aravindan Vijayaraghavan · 2017
Cited alongside, same era.
“Nearly tight sample complexity bounds for learning mixtures of gaussians via sample compression schemes”
Hassan Ashtiani, Shai Ben-David, Nicholas Harvey, Christopher Liaw, Abbas Mehrabian and Yaniv Plan · 2018
Cited alongside, same era.
“Sample-efficient learning of mixtures”
Hassan Ashtiani, Shai Ben-David and Abbas Mehrabian · 2018
Cited alongside, same era.
“The total variation distance between high-dimensional Gaussians”
Luc Devroye, Abbas Mehrabian and Tommy Reddad · 2018
Cited alongside, same era.
“Truncated Laplacian mechanism for approximate differential privacy”
Quan Geng, Wei Ding, Ruiqi Guo and Sanjiv Kumar · 2018
Cited alongside, same era.
Ainesh Bakshi, Ilias Diakonikolas, He Jia, Daniel Kane, Pravesh Kothari and Santosh Vempala · 2022
Later among the works it cites.
“Private Estimation with Public Data”
Alex Bie, Gautam Kamath and Vikrant Singhal · 2022
Later among the works it cites.
“Privacy Induces Robustness: Information-Computation Gaps and Sparse Mean Estimation”
Kristian Georgiev and Samuel Hopkins · 2022
Later among the works it cites.
“Efficient mean estimation with pure differential privacy via a sum-of-squares exponential mechanism”
Samuel Hopkins, Gautam Kamath and Mahbod Majid · 2022
Later among the works it cites.
“New Lower Bounds for Private Estimation and a Generalized Fingerprinting Lemma”
Gautam Kamath, Argyris Mouzakis and Vikrant Singhal · 2022
Later among the works it cites.
“A private and computationally-efficient estimator for unbounded gaussians”
Gautam Kamath, Argyris Mouzakis, Vikrant Singhal, Thomas Steinke and Jonathan Ullman · 2022
Later among the works it cites.
“Private robust estimation by stabilizing convex relaxations”
Pravesh Kothari, Pasin Manurangsi and Ameya Velingker · 2022
Later among the works it cites.
“Differential privacy and robust statistics in high dimensions”
Xiyang Liu, Weihao Kong and Sewoong Oh · 2022
Later among the works it cites.
“Clustering mixtures with almost optimal separation in polynomial time”
Allen Liu and Jerry Li · 2022
Later among the works it cites.
“Robust Model Selection and Nearly-Proper Learning for GMMs”
Allen Liu, Jerry Li and Ankur Moitra · 2022
Later among the works it cites.
“Learning gmms with nearly optimal robustness guarantees”
Allen Liu and Ankur Moitra · 2022
Later among the works it cites.
“Friendlycore: Practical differentially private aggregation”
Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour and Uri Stemmer · 2022
Later among the works it cites.
“From Robustness to Privacy and Back”
Hilal Asi, Jonathan Ullman and Lydia Zakynthinou · 2023
Closest in time.
“Private estimation algorithms for stochastic block models and mixture models”
Hongjie Chen, Vincent Cohen-Addad, Tommaso d’Orsi, Alessandro Epasto, Jacob Imola, David Steurer and Stefan Tiegel · 2023
Closest in time.
“A Fast Algorithm for Adaptive Private Mean Estimation”
John Duchi, Saminul Haque and Rohith Kuditipudi · 2023
Closest in time.
“Robustness Implies Privacy in Statistical Estimation”
Samuel Hopkins, Gautam Kamath, Mahbod Majid and Shyam Narayanan · 2023
Closest in time.
“Differentially-private clustering of easy instances”
Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer and Eliad Tsfadia · 2059
Closest in time.