Access the full text.
Sign up today, get DeepDyve free for 14 days.
I. Glicksberg (1952)
A FURTHER GENERALIZATION OF THE KAKUTANI FIXED POINT THEOREM, WITH APPLICATION TO NASH EQUILIBRIUM POINTS, 3
Maher Nouiehed, Maziar Sanjabi, Tianjian Huang, J. Lee, Meisam Razaviyayn (2019)
Solving a Class of Non-Convex Min-Max Games Using Iterative First Order MethodsArXiv, abs/1902.08297
M. Heusel, Hubert Ramsauer, Thomas Unterthiner, Bernhard Nessler, S. Hochreiter (2017)
GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium
Eric Mazumdar, Michael Jordan, S. Sastry (2019)
On Finding Local Nash Equilibria (and Only Local Nash Equilibria) in Zero-Sum Games
Carles Domingo-Enrich, Samy Jelassi, A. Mensch, Grant Rotskoff, Joan Bruna (2020)
A mean-field analysis of two-player zero-sum gamesArXiv, abs/2002.06277
P. Mertikopoulos, Houssam Zenati, Bruno Lecouat, Chuan-Sheng Foo, V. Chandrasekhar, G. Piliouras (2018)
Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile
Chi Jin, Praneeth Netrapalli, Michael Jordan (2019)
Minmax Optimization: Stable Limit Points of Gradient Descent Ascent are Locally OptimalArXiv, abs/1902.00618
A. Eberle, A. Guillin, Raphael Zimmer (2016)
Quantitative Harris-type theorems for diffusions and McKean–Vlasov processesTransactions of the American Mathematical Society
I. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, Yoshua Bengio (2014)
Generative adversarial networksCommunications of the ACM, 63
Leonard Adolphs, Hadi Daneshmand, Aurélien Lucchi, Thomas Hofmann (2018)
Local Saddle Point Optimization: A Curvature Exploitation Approach
Qihang Lin, Mingrui Liu, Hassan Rafique, Tianbao Yang (2018)
Solving Weakly-Convex-Weakly-Concave Saddle-Point Problems as Weakly-Monotone Variational Inequality
Ya-Ping Hsieh, Chen Liu, V. Cevher (2018)
Finding Mixed Nash Equilibria of Generative Adversarial NetworksArXiv, abs/1811.02002
(1961)
others: On measures of information and entropy
We study the two-player zero-sum game with mixed strategies. For a class of commonly used regularizers and a class of metrics, we show the existence of a Lyapunov function of the gradient ascent descent dynamics. We also propose for a new particle method for a specific combination of regularizers and metrics.
Research in the Mathematical Sciences – Springer Journals
Published: Jun 1, 2022
Keywords: Path divergence; Wasserstein gradient descent ascent; Minimax problems
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.