[DPs21] Carles Domingo-Enrich, Fabian Pedregosa, and Damien Scieur. “Average-case Acceleration for Bilinear Games and Normal Matrices”. In: International Conference on Learning Representations. 2021.
[DH19] Simon S Du and Wei Hu. "Linear convergence of the primal-dual gradient method for convex-concave saddle point problems without strong convexity". In: The 22nd International Conference on Artificial Intelligence and Statistics. PMLR. 2019, pp. 196-205.
[Gid+19] Gauthier Gidel, Reyhane Askari Hemmat, Mohammad Pezeshki, Rémi Le Priol, Gabriel Huang, Simon Lacoste-Julien, and Ioannis Mitliagkas. “Negative momentum for improved game dynamics”. In: The 22nd International Conference on Artificial Intelligence and Statistics. PMLR. 2019, pp. 1802–1811.
[GLWM22] Benjamin Grimmer, Haihao Lu, Pratik Worah, and Vahab Mirrokni. “Limiting behaviors of nonconvex-nonconcave minimax optimization via continuous-time systems”. In: International Conference on Algorithmic Learning Theory. PMLR. 2022, pp. 465–487.
[GWS21] Suriya Gunasekar, Blake Woodworth, and Nathan Srebro. "Mirrorless mirror descent: A natural derivation of mirror descent". In: International Conference on Artificial Intelligence and Statistics. PMLR. 2021, pp. 2305-2313.
[LM00] Beatrice Laurent and Pascal Massart. "Adaptive estimation of a quadratic functional by model selection". In: Annals of Statistics (2000), pp. 1302-1338.
[Let+19] Alistair Letcher, David Balduzzi, Sébastien Racaniere, James Martens, Jakob Foerster, Karl Tuyls, and Thore Graepel. "Differentiable game mechanics". In: The Journal of Machine Learning Research 20.1 (2019), pp. 3032-3071.
[LS19] Tengyuan Liang and James Stokes. “Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks”. In: The 22nd International Conference on Artificial Intelligence and Statistics. PMLR. 2019, pp. 907–915.
[Lu22] Haihao Lu. "An  $O(s^r)$ -resolution ODE framework for understanding discrete-time algorithms and applications to the linear convergence of minimax problems". In: Mathematical Programming 194.1 (2022), pp. 1061-1112.
[MPP18] Panayotis Mertikopoulos, Christos Papadimitriou, and Georgios Piliouras. "Cycles in adversarial regularized learning". In: Proceedings of the twenty-ninth annual ACM-SIAM symposium on discrete algorithms. SIAM. 2018, pp. 2703-2717.
[MOP20] Aryan Mokhtari, Asuman Ozdaglar, and Sarath Pattathil. “A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach”. In: International Conference on Artificial Intelligence and Statistics. PMLR. 2020, pp. 1497–1507.
[NK17] Vaishnavh Nagarajan and J Zico Kolter. "Gradient descent GAN optimization is locally stable". In: Advances in neural information processing systems 30 (2017).
[Nem04] Arkadi Nemirovski. "Prox-method with rate of convergence  $\mathrm{O}(1 / t)$  for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems". In: SIAM Journal on Optimization 15.1 (2004), pp. 229-251.
[PS20] Fabian Pedregosa and Damien Scieur. "Acceleration through spectral density estimation". In: International Conference on Machine Learning. PMLR. 2020, pp. 7553-7562.
[Per13] Lawrence Perko. Differential equations and dynamical systems. Vol. 7. Springer Science & Business Media, 2013.
[PP+08] Kaare Brandt Petersen, Michael Syskind Pedersen, et al. “The matrix cookbook”. In: Technical University of Denmark 7.15 (2008), p. 510.
[ROC76] R Tyrrell Rockafellar. “Monotone operators and the proximal point algorithm”. In: SIAM journal on control and optimization 14.5 (1976), pp. 877–898.
[SOP08] Noah D Stein, Asuman Ozdaglar, and Pablo A Parrilo. "Separable and low-rank continuous games". In: International Journal of Game Theory 37.4 (2008), pp. 475-504.
[Tao08] Terence Tao. When are eigenvalues stable. Oct. 28, 2008. URL: https : //terrytao.wordpress.com/2008/10/28/when-are-eigenvalues-stable.