Fetching the paper…
Reading the bibliography…
The gradient descent-ascent (GDA) algorithm has been widely applied to solve minimax optimization problems.
Zur theorie der gesellschaftsspiele
Neumann, J. v. (1928) · 1928
Earlier work this paper cites.
An iterative method of solving a game
Robinson, J. (1951) · 1951
Earlier work this paper cites.
A topological property of real analytic subsets
Łojasiewicz, S. (1963) · 1963
Earlier work this paper cites.
Convex analysis
Rockafellar, R. T. (1970) · 1970
Earlier work this paper cites.
Splitting algorithms for the sum of two nonlinear operators
Lions, P.-L. and Mercier, B. (1979) · 1979
Earlier work this paper cites.
On a theorem of danskin with an application to a theorem of von neumann-sion
Bernhard, P. and Rapaport, A. (1995) · 1995
Earlier work this paper cites.
On fréchet subdifferentials
Kruger, A. Y. (2003) · 2003
Earlier work this paper cites.
Enhanced first and zeroth order variance reduced algorithms for min-max optimization
Xu, T., Wang, Z., Liang, Y., and Poor, H. V. (2020a) · 2006
Earlier work this paper cites.
Xu, Z., Zhang, H., Xu, Y., and Lan, G. (2020b) · 2006
Earlier work this paper cites.
The Łojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems
Bolte, J., Daniilidis, A., and Lewis, A. (2007) · 2007
Earlier work this paper cites.
Alternating proximal-gradient steps for (stochastic) nonconvex-concave minimax problems
Boţ, R. I. and Böhm, A. (2020) · 2007
Earlier work this paper cites.
Accelerated zeroth-order momentum methods from mini to minimax optimization
Huang, F., Gao, S., Pei, J., and Huang, H. (2020) · 2008
Earlier work this paper cites.
Single-timescale stochastic nonconvex-concave optimization for smooth nonlinear td learning
Qiu, S., Yang, Z., Wei, X., Ye, J., and Wang, Z. (2020) · 2008
Earlier work this paper cites.
On the suboptimality of negative momentum for minimax optimization
Zhang, G. and Wang, Y. (2020) · 2008
Earlier work this paper cites.
On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
Attouch, H. and Bolte, J. (2009) · 2009
Cited alongside, same era.
Subgradient methods for saddle-point problems
Nedić, A. and Ozdaglar, A. (2009) · 2009
Cited alongside, same era.
Variational analysis
Rockafellar, R. T. and Wets, R. J.-B. (2009) · 2009
Cited alongside, same era.
Minimax theorem and nash equilibrium
Ferreira, M. A. M., Andrade, M., Matos, M. C. P., Filipe, J. A., and Coelho, M. P. (2012) · 2012
Cited alongside, same era.
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized gauss–seidel methods
Attouch, H., Bolte, J., and Svaiter, B. F. (2013) · 2013
Cited alongside, same era.
Convergence of linesearch and trust-region methods using the Kurdyka–Łojasiewicz inequality
Characterization of Gradient Dominance and Regularity Conditions for Neural Networks
Zhou, Y. and Liang, Y. (2017) · 2017
Later among the works it cites.
The limit points of (optimistic) gradient descent in min-max optimization
Daskalakis, C. and Panageas, I. (2018) · 2018
Later among the works it cites.
Multi-agent generative adversarial imitation learning
Song, J., Ren, H., Sadigh, D., and Ermon, S. (2018) · 2018
Later among the works it cites.
On the Quadratic Convergence of the Cubic Regularization Method under a Local Error Bound Condition
Yue, M., Zhou, Z., and So, M. (2018) · 2018
Later among the works it cites.
Local saddle point optimization: A curvature exploitation approach
Adolphs, L., Daneshmand, H., Lucchi, A., and Hofmann, T. (2019) · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Noll, D. and Rondepierre, A. (2013) · 2013
Cited alongside, same era.
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Bolte, J., Sabach, S., and Teboulle, M. (2014) · 2014
Cited alongside, same era.
Generative adversarial nets
Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., and Bengio, Y. (2014) · 2014
Cited alongside, same era.
Splitting methods with variable metric for Kurdyka–Łojasiewicz functions and general convergence rates
Frankel, P., Garrigos, G., and Peypouquet, J. (2015) · 2015
Cited alongside, same era.
Generative adversarial imitation learning
Ho, J. and Ermon, S. (2016) · 2016
Cited alongside, same era.
Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition
Karimi, H., Nutini, J., and Schmidt, M. (2016) · 2016
Cited alongside, same era.
Saddle-point dynamics: conditions for asymptotic stability of saddle points
Cherukuri, A., Gharesifard, B., and Cortes, J. (2017) · 2017
Cited alongside, same era.
Linear convergence of the primal-dual gradient method for convex-concave saddle point problems without strong convexity
Du, S. S. and Hu, W. (2019) · 2019
Later among the works it cites.
Solving a class of non-convex min-max games using iterative first order methods
Nouiehed, M., Sanjabi, M., Huang, T., Lee, J. D., and Razaviyayn, M. (2019) · 2019
Later among the works it cites.
What is local optimality in nonconvex-nonconcave minimax optimization?
Jin, C., Netrapalli, P., and Jordan, M. I. (2020) · 2020
Later among the works it cites.
On gradient descent ascent for nonconvex-concave minimax problems
Lin, T., Jin, C., and Jordan, M. I. (2020) · 2020
Later among the works it cites.
Hybrid block successive approximation for one-sided non-convex min-max problems: algorithms and applications
Lu, S., Tsaknakis, I., Hong, M., and Chen, Y. (2020) · 2020
Later among the works it cites.
A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach
Mokhtari, A., Ozdaglar, A., and Pattathil, S. (2020) · 2020
Later among the works it cites.
Lower complexity bounds for finite-sum convex-concave minimax optimization problems
Xie, G., Luo, L., Lian, Y., and Zhang, Z. (2020) · 2020
Later among the works it cites.
Global convergence and variance reduction for a class of nonconvex-nonconcave minimax problems
Yang, J., Kiyavash, N., and He, N. (2020) · 2020
Later among the works it cites.
Proximal gradient algorithm with momentum and flexible parameter restart for nonconvex optimization
Zhou, Y., Wang, Z., Ji, K., Liang, Y., and Tarokh, V. (2020) · 2020
Later among the works it cites.