Fetching the paper…
Reading the bibliography…
In this work we solve the problem of robustly learning a high-dimensional Gaussian mixture model with $k$ components from $\epsilon$-corrupted samples up to accuracy $\widetilde{O}(\epsilon)$ in total variation distance for any constant $k$ and with mild assumptions on the mixture.
Identifiability of mixtures
Henry Teicher · 1961
Earlier work this paper cites.
Learning mixtures of gaussians
Sanjoy Dasgupta · 1999
Earlier work this paper cites.
Neural network learning: Theoretical foundations
Martin Anthony and Peter L Bartlett · 2009
Earlier work this paper cites.
Polynomial learning of distribution families
Mikhail Belkin and Kaushik Sinha · 2010
Earlier work this paper cites.
Efficiently learning mixtures of two gaussians
Adam Tauman 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.
Hypercontractive inequalities via sos, and the frankl–rödl graph
Manuel Kauers, Ryan O’Donnell, Li-Yang Tan, and Yuan Zhou · 2014
Earlier work this paper cites.
Learning mixtures of gaussians in high dimensions
Rong Ge, Qingqing Huang, and Sham M Kakade · 2015
Earlier work this paper cites.
Tight bounds for learning a mixture of two gaussians
Moritz Hardt and Eric Price · 2015
Earlier work this paper cites.
On the uniform convergence of relative frequencies of events to their probabilities
Vladimir N Vapnik and A Ya Chervonenkis · 2015
Earlier work this paper cites.
Agnostic estimation of mean and covariance
Kevin A Lai, Anup B Rao, and Santosh Vempala · 2016
Earlier work this paper cites.
Computationally efficient robust sparse estimation in high dimensions
Sivaraman Balakrishnan, Simon S Du, Jerry Li, and Aarti Singh · 2017
Earlier work this paper cites.
Learning from untrusted data
Moses Charikar, Jacob Steinhardt, and Gregory Valiant · 2017
Earlier work this paper cites.
Being robust (in high dimensions) can be practical
Ilias Diakonikolas, Gautam Kamath, Daniel M Kane, Jerry Li, Ankur Moitra, and Alistair Stewart · 2017
Cited alongside, same era.
Statistical query lower bounds for robust estimation of high-dimensional gaussians and gaussian mixtures
Ilias Diakonikolas, Daniel M Kane, and Alistair Stewart · 2017
Cited alongside, same era.
Sample-efficient learning of mixtures
Hassan Ashtiani, Shai Ben-David, and Abbas Mehrabian · 2018
Cited alongside, same era.
Deviation of polynomials from their expectations and isoperimetry
Lavrentin M Arutyunyan, Egor D Kosov, et al · 2018
Cited alongside, same era.
Robustly learning a gaussian: Getting optimal error, efficiently
Ilias Diakonikolas, Gautam Kamath, Daniel M Kane, Jerry Li, Ankur Moitra, and Alistair Stewart · 2018
Cited alongside, same era.
The total variation distance between high-dimensional gaussians
Robust estimators in high-dimensions without the computational intractability
Ilias Diakonikolas, Gautam Kamath, Daniel Kane, Jerry Li, Ankur Moitra, and Alistair Stewart · 2019
Later among the works it cites.
Sever: A robust meta-algorithm for stochastic optimization
Ilias Diakonikolas, Gautam Kamath, Daniel Kane, Jerry Li, Jacob Steinhardt, and Alistair Stewart · 2019
Later among the works it cites.
How hard is robust mean estimation?
Samuel B. Hopkins and Jerry Li · 2019
Later among the works it cites.
Near-optimal sample complexity bounds for robust learning of gaussian mixtures via compression schemes
Hassan Ashtiani, Shai Ben-David, Nicholas JA Harvey, Christopher Liaw, Abbas Mehrabian, and Yaniv Plan · 2020
Later among the works it cites.
Robustly learning mixtures of k k arbitrary gaussians, 2020
Ainesh Bakshi, Ilias Diakonikolas, He Jia, Daniel M. Kane, Pravesh K. Kothari, and Santosh S. Vempala · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Luc Devroye, Abbas Mehrabian, and Tommy Reddad · 2018
Cited alongside, same era.
Mixture models, robustness, and sum of squares proofs
Samuel B Hopkins and Jerry Li · 2018
Cited alongside, same era.
Efficient algorithms for outlier-robust regression
Adam Klivans, Pravesh K Kothari, and Raghu Meka · 2018
Cited alongside, same era.
Robust moment estimation and improved clustering via sum of squares
Pravesh K Kothari, Jacob Steinhardt, and David Steurer · 2018
Cited alongside, same era.
Principled approaches to robust machine learning and beyond
Jerry Zheng Li · 2018
Cited alongside, same era.
Robust Learning: Information Theory and Algorithms
Jacob Steinhardt · 2018
Cited alongside, same era.
Recent advances in algorithmic high-dimensional robust statistics
Ilias Diakonikolas and Daniel M. Kane · 2019
Cited alongside, same era.
Ainesh Bakshi and Pravesh Kothari · 2020
Later among the works it cites.
Online and distribution-free robustness: Regression and contextual bandits with huber contamination
Sitan Chen, Frederic Koehler, Ankur Moitra, and Morris Yau · 2020
Later among the works it cites.
Robustly learning any clusterable mixture of gaussians
Ilias Diakonikolas, Samuel B Hopkins, Daniel Kane, and Sushrut Karmalkar · 2020
Later among the works it cites.
Outlier robust mean estimation with subgaussian rates via stability
Ilias Diakonikolas, Daniel M. Kane, and Ankit Pensia · 2020
Later among the works it cites.
Robust linear regression: Optimal rates in polynomial time
Ainesh Bakshi and Adarsh Prasad · 2021
Closest in time.
Robust learning of mixtures of gaussians
Daniel M. Kane · 2021
Closest in time.
Settling the robust learnability of mixtures of gaussians
Allen Liu and Ankur Moitra · 2021
Closest in time.