[4] R. I. Bot and A. Bohm. Alternating proximal-gradient steps for (stochastic) nonconvex-concave minimax problems. SIAM J. Optim., 2023.
[5] Y. Cai and W. Zheng. Accelerated single-call methods for constrained min-max optimization. In International Conference on Learning Representations (ICLR), 2023.
[6] Z. Chen, Z. Hu, Q. Li, Z. Wang, and Y. Zhou. A cubic regularization approach for finding local minimax points in nonconvex minimax optimization. Transactions on Machine Learning Research, pages 1-43, 2023.
[7] C. D. Dang and G. Lan. On the convergence properties of non-euclidean extragradient methods for variational inequalities with generalized monotone operators. Comput. Optim. Appl., 60(2):277-310, 2015.
[8] C. Daskalakis and I. Panageas. The limit points of (optimistic) gradient descent in min-max optimization. In The Annual Conference on Neural Information Processing Systems (NeurIPS), pages 9256-9266, 2018.
[9] D. Davis and D. Drusvyatskiy. Stochastic model-based minimization of weakly convex functions. SIAM J. Optim., 29(1):207-239, 2019.
[10] J. Diakonikolas, C. Daskalakis, and M. I. Jordan. Efficient methods for structured nonconvex-nonconcave min-max optimization. In AISTATS, pages 2746-2754, 2021.
[11] J. Diakonikolas, C. Daskalakis, and M. I. Jordan. Efficient methods for structured nonconvex-nonconcave min-max optimization. In The International Conference on Artificial Intelligence and Statistics (AISTATS), pages 2746-2754, 2021.
[12] S. S. Du, J. Chen, L. Li, L. Xiao, and D. Zhou. Stochastic variance reduction methods for policy evaluation. In International Conference on Machine Learning (ICML), pages 1049-1058, 2017.
[13] J. C. Duchi and H. Namkoong. Variance-based regularization with convex objectives. J. Mach. Learn. Res., 20:1-55, 2019.
[14] I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio. Generative adversarial nets. In The Annual Conference on Neural Information Processing Systems (NIPS), pages 2672–2680, 2014.
[15] I. Goodfellow, J. Shlens, and C. Szegedy. Explaining and harnessing adversarial examples. In International Conference on Learning Representations (ICLR), 2015.
[16] A. N. Iusem, A. Jofre, R. I. Oliveira, and P. Thompson. Extragradients method with variance reduction for stochastic variational inequalities. SIAM J. Optim., 27(2):686-724, 2017.
[17] C. Jin, P. Netrapalli, and M. I. Jordan. What is local optimality in nonconvex-nonconcave minimax optimization? In International Conference on Machine Learning (ICML), pages 4880-4889, 2020.
[18] W. Kong and R. D. Monteiro. An accelerated inexact proximal point method for solving nonconvex-concave min-max problems. In arXiv preprint arXiv:1905.13433v3, 2021.
[19] A. Kurakin, I. Goodfellow, and S. Bengio. Adversarial machine learning at scale. In International Conference on Learning Representations (ICLR), 2017.
[20] S. Lee and D. Kim. Fast extra gradient methods for smooth structured nonconvex-nonconcave minimax problems. In NeurIPS, 2021.
[21] Y. Lei, Z. Yang, T. Yang, and Y. Ying. Stability and generalization of stochastic gradient methods for minimax problems. In International Conference on Machine Learning (ICML), pages 6175-6186, 2021.
[22] A. Letcher, D. Balduzzi, S. Racaniere, J. Martens, J. N. Foerster, K. Tuyls, and T. Graepel. Differentiable game mechanics. J. Mach. Learn. Res., 20:1-40, 2019.
[23] H. Li, Y. Tian, J. Zhang, and A. Jabbabaie. Complexity lower bounds for nonconvex-strongly-concave min-max optimization. In arXiv preprint arXiv:2104.08708v1, 2021.
[24] T. Lin, C. Jin, and M. I. Jordan. Near-optimal algorithms for minimax optimization. In The Annual Conference on Learning Theory (COLT), pages 2738-2779, 2020.
[25] T. Lin, C. Jin, and M. I. Jordan. On gradient descent ascent for nonconvex-concave minimax problems. In International Conference on Machine Learning (ICML), pages 6083-6093, 2020.