Fetching the paper…
Reading the bibliography…
We study the efficient learnability of high-dimensional Gaussian mixtures in the outlier-robust setting, where a small constant fraction of the data is adversarially corrupted.
F. R. Hampel, E. M. Ronchetti, P. J. Rousseeuw, and W. A. Stahel, Robust statistics. the approach based on influence functions , Wiley New York, 1986
1986
Earlier work this paper cites.
S. Dasgupta, Learning mixtures of Gaussians , Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999, pp. 634–644
1999
Earlier work this paper cites.
S. Arora and R. Kannan, Learning mixtures of arbitrary Gaussians , Proceedings of the 33rd Symposium on Theory of Computing, 2001, pp. 247–257
2001
Earlier work this paper cites.
2002
Earlier work this paper cites.
D. Achlioptas and F. McSherry, On spectral learning of mixtures of distributions , Proceedings of the Eighteenth Annual Conference on Learning Theory (COLT), 2005, pp. 458–469
2005
Earlier work this paper cites.
J. Feldman, R. O’Donnell, and R. Servedio, PAC learning mixtures of Gaussians with no separation assumption , Proc. 19th Annual Conference on Learning Theory (COLT), 2006, pp. 20–34
2006
Earlier work this paper cites.
R. O’Donnell, Analysis of boolean functions , http://www.cs.cmu.edu/ odonnell/boolean-analysis/, 2007
2007
Earlier work this paper cites.
S. C. Brubaker and S. Vempala, Isotropic PCA and Affine-Invariant Clustering , Proc. 49th IEEE Symposium on Foundations of Computer Science, 2008, pp. 551–560
2008
Earlier work this paper cites.
R. Kannan, H. Salmasian, and S. Vempala, The spectral method for general mixture models , SIAM J. Comput. 38
2008
Earlier work this paper cites.
P. J. Huber and E. M. Ronchetti, Robust statistics , Wiley New York, 2009
2009
Earlier work this paper cites.
M. Belkin and K. Sinha, Polynomial learning of distribution families , FOCS, 2010, pp. 103–112
2010
Earlier work this paper cites.
I. Diakonikolas, P. Gopalan, R. Jaiswal, R. Servedio, and E. Viola, Bounded independence fools halfspaces , SIAM J. on Comput. 39
2010
Earlier work this paper cites.
A. T. Kalai, A. Moitra, and G. Valiant, Efficiently learning mixtures of two Gaussians , STOC, 2010, pp. 553–562
2010
Earlier work this paper cites.
A. Moitra and G. Valiant, Settling the polynomial learnability of mixtures of Gaussians , FOCS, 2010, pp. 93–102
2010
Earlier work this paper cites.
2010
Earlier work this paper cites.
B. Barak, F. Brandao, A. W. Harrow, J. Kelner, D. Steurer, and Y. Zhou, Hypercontractivity, sum-of-squares proofs, and their applications , Proceedings of the forty-fourth annual ACM symposium on Theory of computing, 2012, pp. 307–326
2012
Earlier work this paper cites.
C. Daskalakis, I. Diakonikolas, and R.A. Servedio, Learning Poisson Binomial Distributions , Proceedings of the 44th Symposium on Theory of Computing, 2012, pp. 709–728
2012
Cited alongside, same era.
C. Daskalakis and G. Kamath, Faster and sample near-optimal algorithms for proper learning mixtures of Gaussians , Proc. 27th Annual Conference on Learning Theory (COLT), 2014, pp. 1183–1213
2014
Cited alongside, same era.
M. Kauers, R. O’Donnell, L.-Y. Tan, and Y. Zhou, Hypercontractive inequalities via sos, and the frankl–rödl graph , Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, SIAM, 2014, pp. 1644–1658
2014
Cited alongside, same era.
A. T. Suresh, A. Orlitsky, J. Acharya, and A. Jafarpour, Near-optimal-sample estimators for spherical Gaussian mixtures , Proc. 29th Annual Conference on Neural Information Processing Systems (NIPS), 2014, pp. 1395–1403
2014
Cited alongside, same era.
2018
Later among the works it cites.
J. Steinhardt, M. Charikar, and G. Valiant, Resilience: A criterion for learning in the presence of arbitrary outliers , Proc. 9th Innovations in Theoretical Computer Science Conference (ITCS), 2018, pp. 45:1–45:21
2018
Later among the works it cites.
2019
Later among the works it cites.
Y. Cheng, I. Diakonikolas, R. Ge, and D. P. Woodruff, Faster algorithms for high-dimensional robust covariance estimation , Conference on Learning Theory, COLT 2019, 2019, pp. 727–757
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. De, I. Diakonikolas, and R. Servedio, Learning from satisfying assignments , Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, 2015, pp. 478–497
2015
Cited alongside, same era.
M. Hardt and E. Price, Tight bounds for learning a mixture of two gaussians , Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, 2015, pp. 753–760
2015
Cited alongside, same era.
I. Diakonikolas, G. Kamath, D. M. Kane, J. Li, A. Moitra, and A. Stewart, Robust estimators in high dimensions without the computational intractability , Proc. 57th IEEE Symposium on Foundations of Computer Science (FOCS), 2016, pp. 655–664
2016
Cited alongside, same era.
K. A. Lai, A. B. Rao, and S. Vempala, Agnostic estimation of mean and covariance , Proc. 57th IEEE Symposium on Foundations of Computer Science (FOCS), 2016, pp. 665–674
2016
Cited alongside, same era.
S. Balakrishnan, S. S. Du, J. Li, and A. Singh, Computationally efficient robust sparse estimation in high dimensions , Proc. 30th Annual Conference on Learning Theory, 2017, pp. 169–212
2017
Cited alongside, same era.
I. Diakonikolas, D. M. Kane, and A. Stewart, Statistical query lower bounds for robust estimation of high-dimensional Gaussians and Gaussian mixtures , Proc. 58th IEEE Symposium on Foundations of Computer Science (FOCS), 2017, pp. 73–84
2017
Cited alongside, same era.
J. Li and L. Schmidt, Robust and proper learning for mixtures of gaussians via systems of polynomial inequalities , Proceedings of the 30th Conference on Learning Theory, COLT 2017, Proceedings of Machine Learning Research, vol. 65, PMLR, 2017, pp. 1302–1382
2017
Cited alongside, same era.
Y. Cheng, I. Diakonikolas, D. M. Kane, and A. Stewart, Robust learning of fixed-structure Bayesian networks , Proc. 33rd Annual Conference on Neural Information Processing Systems (NeurIPS), 2018, pp. 10304–10316
2018
Cited alongside, same era.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
I. Diakonikolas, S. Karmalkar, D. Kane, E. Price, and A. Stewart, Outlier-robust high-dimensional sparse estimation via iterative filtering , Advances in Neural Information Processing Systems 33, NeurIPS 2019, 2019
2019
Later among the works it cites.
I. Diakonikolas, W. Kong, and A. Stewart, Efficient algorithms and lower bounds for robust linear regression , Proc. 30th Annual Symposium on Discrete Algorithms (SODA), 2019, pp. 2745–2754
2019
Later among the works it cites.
2019
Later among the works it cites.
I. Diakonikolas, S. Vempala, and D. Woodruff, Research vignette: Foundations of data science , UC Berkeley Simons Institute newsletter (2019)
2019
Later among the works it cites.
2019
Later among the works it cites.
S. Karmalkar, A. Klivans, and P. Kothari, List-decodable linear regression , Advances in Neural Information Processing Systems, 2019, pp. 7423–7432
2019
Later among the works it cites.
A. Bakshi and P. Kothari, Personal Communication, 2020
2020
Closest in time.
P. Raghavendra and M. Yau, List decodable learning via sum of squares , Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 161–180
2020
Closest in time.