[5] M. Arbel and J. Mairal. “Non-Convex Bilevel Games with Critical Point Selection Maps.” In: Advances in Neural Information Processing Systems (NeurIPS) 2022 (2022).
[6] S. Arora, S. Du, W. Hu, Z. Li, and R. Wang. "Fine-grained analysis of optimization and generalization for overparameterized two-layer neural networks." In: International Conference on Machine Learning. PMLR. 2019, pp. 322-332.
[7] M. Belkin, A. Rakhlin, and A. B. Tsybakov. "Does data interpolation contradict statistical optimality?" In: The 22nd International Conference on Artificial Intelligence and Statistics. PMLR. 2019, pp. 1611-1619.
[8] G. Blanc, N. Gupta, G. Valiant, and P. Valiant. "Implicit regularization for deep neural networks driven by an Ornstein-uhlenbeck like process." In: Conference on learning theory. PMLR. 2020, pp. 483-513.
[9] A. Botev, H. Ritter, and D. Barber. "Practical gauss-newton optimisation for deep learning." In: International Conference on Machine Learning. PMLR. 2017, pp. 557-565.
[10] E. Boursier, L. Pillaud-Vivien, and N. Flammarion. "Gradient flow dynamics of shallow ReLU networks for square loss and orthogonal inputs." In: arXiv preprint arXiv:2206.00939 (2022).
[11] T. Cai, R. Gao, J. Hou, S. Chen, D. Wang, D. He, Z. Zhang, and L. Wang. "Gram-gauss-newton method: Learning overparameterized neural networks for regression problems." In: arXiv preprint arXiv:1905.11675 (2019).
[12] Z. Chen, E. Vanden-Eijnden, and J. Bruna. "On feature learning in neural networks with global convergence guarantees." In: arXiv preprint arXiv:2204.10782 (2022).
[13] L. Chizat. "Sparse Optimization on Measures with Over-parameterized Gradient Descent." In: arXiv:1907.10300 [math, stat] (July 2019). arXiv: 1907.10300. URL: http://arxiv.org/abs/1907.10300.
[14] L. Chizat and F. Bach. “On the Global Convergence of Gradient Descent for Overparameterized Models using Optimal Transport.” May 2018. URL: https://hal.archives-ouvertes.fr/hal-01798792.
[15] L. Chizat, E. Oyallon, and F. Bach. "On lazy training in differentiable programming." In: Advances in Neural Information Processing Systems 32 (2019).
[16] L. Deng. "The mnist database of handwritten digit images for machine learning research." In: IEEE Signal Processing Magazine 29.6 (2012), pp. 141-142.
[17] S. Du, J. Lee, H. Li, L. Wang, and X. Zhai. "Gradient descent finds global minima of deep neural networks." In: International conference on machine learning. PMLR. 2019, pp. 1675-1685.
[18] S. S. Du, X. Zhai, B. Poczos, and A. Singh. "Gradient descent provably optimizes overparameterized neural networks." In: arXiv preprint arXiv:1810.02054 (2018).
[19] S. Elfwing, E. Uchibe, and K. Doya. "Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learning. ArXiv e-prints (2017)." In: arXiv preprint arXiv:1702.03118 (2017).
[20] J. R. Garcia, F. Freddi, S. Fotiadis, M. Li, S. Vakili, A. Bernacchia, and G. Hennequin. "Fisher-Legendre (FishLeg) optimization of deep neural networks." In: The Eleventh International Conference on Learning Representations. 2023.
[21] R. Grosse and J. Martens. “A Kronecker-factored Approximate Fisher Matrix for Convolution Layers.” In: Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48. ICML'16. event-place: New York, NY, USA. JMLR.org, 2016, pp. 573-582. URL: http://dl.acm.org/citation.cfm?id=3045390.3045452.
[22] T. Hastie, A. Montanari, S. Rosset, and R. J. Tibshirani. "Surprises in high-dimensional ridgeless least squares interpolation." In: The Annals of Statistics 50.2 (2022), pp. 949-986.
[23] A. Jacot, F. Gabriel, and C. Hongler. "Neural Tangent Kernel: Convergence and Generalization in Neural Networks." In: arXiv:1806.07572 [cs, math, stat] (June 2018). arXiv: 1806.07572. URL: http://arxiv.org/abs/1806.07572.
[24] B. Kaltenbacher, A. Neubauer, and A. Ramm. "Convergence rates of the continuous regularized Gauss—Newton method." In: Journal of Inverse and Ill-Posed Problems 10.3 (2002), pp. 261–280.