[DKS17] I. Diakonikolas, D. M. Kane, and A. Stewart. "Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures". In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). 2017, pp. 73-84.
[DKS19] I. Diakonikolas, W. Kong, and A. Stewart. "Efficient algorithms and lower bounds for robust linear regression". In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Philadelphia, PA, 2019, pp. 2745-2754.
[Dur19] R. Durrett. Probability—theory and examples. Vol. 49. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge, 2019.
[Fel+17] V. Feldman, E. Grigorescu, L. Reyzin, S. Vempala, and Y. Xiao. "Statistical Algorithms and a Lower Bound for Detecting Planted Cliques". In: J. ACM 64.2 (2017), 8:1-8:37.
[Gao20] C. Gao. "Robust regression via multivariate regression depth". In: Bernoulli 26.2 (2020), pp. 1139-1170.
[GC23] X. Gao and Y. Cheng. "Robust Matrix Sensing in the Semi-Random Model". In: Proceedings of the 37th Conference on Neural Information Processing Systems (NeurIPS) (2023).
[Ge+15] R. Ge, F. Huang, C. Jin, and Y. Yuan. "Escaping from saddle points—online stochastic gradient for tensor decomposition". In: Conference on Learning Theory. 2015, pp. 797-842.
[GJZ17] R. Ge, C. Jin, and Y. Zheng. “No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis”. In: Proceedings of the 34th International Conference on Machine Learning. Ed. by D. Precup and Y. W. Teh. Vol. 70. Proceedings of Machine Learning Research. PMLR, June 2017, pp. 1233–1242.
[GLM16] R. Ge, J. D. Lee, and T. Ma. "Matrix completion has no spurious local minimum". In: Advances in Neural Information Processing Systems. 2016, pp. 2973-2981.
[Hal10] J. K. Hale. Asymptotic behavior of dissipative systems. 25. American Mathematical Soc., 2010.
[Ham+86] F. R. Hampel, E. M. Ronchetti, P. J. Rousseuw, and W. A. Stahel. Robust statistics. The approach based on influence functions. Wiley New York, 1986.
[HR09] P. J. Huber and E. M. Ronchetti. Robust statistics. Wiley New York, 2009.
[Hub64] P. J. Huber. "Robust estimation of a location parameter". In: Annals of Mathematical Statistics 35 (1964), pp. 73-101.
[IPL23] E. Ioannou, M. S. Pydi, and P.-L. Loh. "Robust empirical risk minimization via Newton's method". In: arXiv preprint arXiv:2301.13192 (2023).
[Jin+17] C. Jin, R. Ge, P. Netrapalli, S. M. Kakade, and M. I. Jordan. "How to Escape Saddle Points Efficiently". In: Proceedings of the 34th International Conference on Machine Learning. Ed. by D. Precup and Y. W. Teh. Vol. 70. Proceedings of Machine Learning Research. PMLR, June 2017, pp. 1724-1732.
[Jan+21] C. Jin, P. Netrapalli, R. Ge, S. M. Kakade, and M. I. Jordan. "On nonconvex optimization for machine learning: gradients, stochasticity, and saddle points". In: Journal of the ACM 68.2 (2021), Art. 11, 29.
[Kea98] M. J. Kearns. "Efficient noise-tolerant Learning from Statistical Queries". In: Journal of the ACM 45.6 (1998), pp. 983-1006.
[Li+08] J. Li, D. Absher, H. Tang, A. Southwick, A. Casto, S. Ramachandran, H. Cann, G. Barsh, M. Feldman, L. Cavalli-Sforza, and R. Myers. "Worldwide human relationships inferred from genome-wide patterns of variation". In: Science 319 (2008), pp. 1100-1104.
[Li+20a] X. Li, Z. Zhu, A. Man-Cho So, and R. Vidal. "Nonconvex robust low-rank matrix recovery". In: SIAM Journal on Optimization 30.1 (2020), pp. 660-686.
[Li+20b] Y. Li, Y. Chi, H. Zhang, and Y. Liang. "Non-convex low-rank matrix recovery with arbitrary outliers via median-truncated gradient descent". In: Information and Inference: A Journal of the IMA 9.2 (2020), pp. 289–325.
[LRV16] K. A. Lai, A. B. Rao, and S. Vempala. "Agnostic Estimation of Mean and Covariance". In: *focs2016*. 2016, pp. 665-674.
[LW23] S. Li and S. J. Wright. "A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees". In: arXiv preprint arXiv:2310.18841 (2023).