[DKS18] I. Diakonikolas, D. M. Kane, and A. Stewart. "List-Decodable Robust Mean Estimation and Learning Mixtures of Spherical Gaussians". In: Proc. 50th Annual ACM Symposium on Theory of Computing (STOC). 2018.
[DMR18] Luc Devroye, Abbas Mehrabian, and Tommy Reddad. “The total variation distance between high-dimensional Gaussians with the same mean”. In: arXiv preprint arXiv:1810.08693 (2018).
[DS07] S. Dasgupta and L. J. Schulman. "A probabilistic analysis of EM for mixtures of separated, spherical Gaussians". In: Journal of Machine Learning Research 8 (2007), pp. 203-226.
[HR09] P. J. Huber and E. M. Ronchetti. Robust Statistics. Wiley Series in Probability and Statistics. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2009. ISBN: 978-0-470-43469-7 978-0-470-12990-6.
[Hub64] P. J. Huber. "Robust Estimation of a Location Parameter". In: The Annals of Mathematical Statistics 35.1 (Mar. 1964), pp. 73-101. ISSN: 0003-4851.
[IK22] M. Ivkov and P. K. Kothari. "List-decodable covariance estimation". In: Proc. 54th Annual ACM Symposium on Theory of Computing (STOC). 2022.
[KK10] A. Kumar and R. Kannan. "Clustering with spectral norm and the k-means algorithm". In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. IEEE. 2010, pp. 299-308.
[KKK19] S. Karmalkar, A. Klivans, and P. Kothari. "List-decodable linear regression". In: Advances in Neural Information Processing Systems. 2019, pp. 7423-7432.
[Kot21] P. Kothari. Robustly Learning Mixtures of Gaussians. TCS+ Talk. Available online at: https://youtu.be/Yjk0Xzvjy0w?t=2593. 2021.
[KS17] P. K. Kothari and J. Steinhardt. "Better Agnostic Clustering Via Relaxed Tensor Norms". In: CoRR abs/1711.07465 (2017).
[Li18] J. Li. “Principled approaches to robust machine learning and beyond”. PhD thesis. Massachusetts Institute of Technology, 2018.
[LM21] A. Liu and A. Moitra. "Settling the Robust Learnability of Mixtures of Gaussians". In: Proc. 53rd Annual ACM Symposium on Theory of Computing (STOC). 2021.
[LM22] A. Liu and A. Moitra. "Learning GMMs with Nearly Optimal Robustness Guarantees". In: Proc. 35th Annual Conference on Learning Theory (COLT). 2022.
[K. A. Lai, A. B. Rao, and S. Vempala. "Agnostic Estimation of Mean and Covariance". In: Proceedings of FOCS'16. 2016.
[MMV10] A. Moitra and G. Valiant. "Settling the polynomial learnability of mixtures of Gaussians". In: FOCS. 2010, pp. 93-102.
[MV18] M. Meister and G. Valiant. “A data prism: Semi-verified learning in the small-alpha regime”. In: Proc. 31st Annual Conference on Learning Theory (COLT). PMLR. 2018, pp. 1530–1546.
[RY20a] P. Raghavendra and M. Yau. "List decodable learning via sum of squares". In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM. 2020, pp. 161-180.
[RY20b] P. Raghavendra and M. Yau. "List Decodable Subspace Recovery". In: Proc. 33rd Annual Conference on Learning Theory (COLT). 2020.
[SVC16] J. Steinhardt, G. Valiant, and M. Charikar. “Avoiding imposters and delinquents: Adversarial crowdsourcing and peer prediction”. In: Advances in Neural Information Processing Systems 29 (NeurIPS). 2016.
[Vem22] S. Vempala. Robustly Learning Mixtures of Arbitrary Gaussians in Polynomial Time. Bangalore Theory Seminar Series. Available online at: https://youtu.be/eF9XTJrBFTg?t=3107.2022.
[VP04] S. Vempala and G. Wang. "A spectral algorithm for learning mixture models". In: Journal of Computer and System Sciences 68.4 (2004), pp. 841-860.
[ZS22] S. Zeng and J. Shen. "List-Decodable Sparse Mean Estimation". In: Advances in Neural Information Processing Systems 35 (NeurIPS). 2022.