[21] Hamed Karimi, Julie Nutini, and Mark Schmidt. "Linear convergence of gradient and proximal-gradient methods under the polyak-lojasiewicz condition". In: Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2016, Riva del Garda, Italy, September 19-23, 2016, Proceedings, Part I 16. Springer. 2016, pp. 795-811.
[22] Ahmed Khaled and Peter Richtárik. "Better theory for SGD in the nonconvex world". In: arXiv preprint arXiv:2002.03329 (2020).
[23] Alexander Kolesnikov, Lucas Beyer, Xiaohua Zhai, Joan Puigcerver, Jessica Yung, Sylvain Gelly, and Neil Houlsby. “Big transfer (bit): General visual representation learning”. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23–28, 2020, Proceedings, Part V 16. Springer. 2020, pp. 491–507.
[24] Chaoyue Liu, Libin Zhu, and Mikhail Belkin. "Loss landscapes and optimization in overparameterized non-linear systems and neural networks". In: Applied and Computational Harmonic Analysis 59 (2022), pp. 85-116.
[25] Chaoyue Liu, Libin Zhu, and Misha Belkin. "On the linearity of large non-linear models: when and why the tangent kernel is constant". In: Advances in Neural Information Processing Systems 33 (2020), pp. 15954-15964.
[26] Stanislaw Lojasiewicz. "A topological property of real analytic subsets". In: Coll. du CNRS, Les équations aux dérivées partielles 117.87-89 (1963), p. 2.
[27] Z.-Q. Luo and P. Tseng. "Error bounds and convergence analysis of feasible descent methods: a general approach". In: Annals of Operations Research 46.1 (Mar. 1993), pp. 157-178. ISSN: 1572-9338. DOI: 10.1007/BF02096261. URL: https://doi.org/10.1007/BF02096261.
[28] Shahar Mendelson. "Learning without concentration". In: Journal of the ACM (JACM) 62.3 (2015), pp. 1-25.
[29] STANISLAV MINSKER. "Geometric median and robust estimation in Banach spaces". In: Bernoulli 21.4 (2015), pp. 2308-2335. ISSN: 13507265, 15739759. URL: http://www.jstor.org/stable/43590532 (visited on 05/14/2023).
[30] Ion Necoara, Yu Nesterov, and Francois Glineur. "Linear convergence of first order methods for non-strongly convex optimization". In: Mathematical Programming 175 (2019), pp. 69-107.
[31] Arkadj Semenovič Nemirovskij and David Borisovich Yudin. “Problem complexity and method efficiency in optimization”. In: (1983).
[32] Samet Oymak and Mahdi Soltanolkotabi. "Overparameterized nonlinear learning: Gradient descent takes the shortest path?" In: International Conference on Machine Learning. PMLR. 2019, pp. 4951-4960.
[33] Raymond EAC Paley and Antoni Zygmund. “A note on analytic functions in the unit circle”. In: Mathematical Proceedings of the Cambridge Philosophical Society. Vol. 28. 3. Cambridge University Press. 1932, pp. 266–272.
[34] B. T. Poljak. "Gradient methods for minimizing functionals". In: Ž. Vycisl. Mat i Mat. Fiz. 3 (1963), pp. 643-653. ISSN: 0044-4669.
[35] Quentin Rebjock and Nicolas Boumal. "Fast convergence to non-isolated minima: four equivalent conditions for  $C^2$  functions". In: arXiv preprint arXiv:2303.00096 (2023).
[36] Karthik Abinav Sankararaman, Soham De, Zheng Xu, W Ronny Huang, and Tom Goldstein. "The impact of neural network overparameterization on gradient confusion and stochastic gradient descent". In: International conference on machine learning. PMLR. 2020, pp. 8469-8479.
[37] Mingxing Tan and Quoc Le. "Efficientnet: Rethinking model scaling for convolutional neural networks". In: International conference on machine learning. PMLR. 2019, pp. 6105-6114.
[38] Sharan Vaswani, Francis Bach, and Mark Schmidt. "Fast and faster convergence of sgd for overparameterized models and an accelerated perceptron". In: The 22nd international conference on artificial intelligence and statistics. PMLR. 2019, pp. 1195-1204.
[39] Chiyuan Zhang, Samy Bengio, Moritz Hardt, Benjamin Recht, and Oriol Vinyals. "Understanding deep learning (still) requires rethinking generalization". In: Communications of the ACM 64.3 (2021), pp. 107-115.