Fetching the paper…
Reading the bibliography…
We present a new algorithm to solve min-max or min-min problems out of the convex world.
Zur theorie der gesellschaftsspiele
John Von Neumann · 1928
Earlier work this paper cites.
On Rings of Operators. Reduction Theory
John Von Neumann · 1949
Earlier work this paper cites.
A relationship between arbitrary positive matrices and doubly stochastic matrices
Richard Sinkhorn · 1964
Earlier work this paper cites.
An Extragradient Method for Finding Saddle Points and for Other Problems
G. M. Korpelevich · 1976
Earlier work this paper cites.
Proximal subgradients, marginal values, and augmented lagrangians in nonconvex optimization
R Tyrrell Rockafellar · 1981
Earlier work this paper cites.
Géométrie algébrique réelle
Jacek Bochnak, Michel Coste, and Marie-Françoise Roy · 1987
Earlier work this paper cites.
On gradients of functions definable in o-minimal structures
Krzysztof Kurdyka · 1998
Earlier work this paper cites.
Variational Analysis
R. Tyrrell Rockafellar and Roger J.-B. Wets · 1998
Earlier work this paper cites.
An Introduction to Semialgebraic Geometry
Michel Coste · 1999
Earlier work this paper cites.
Convex Optimization
Stephen P. Boyd and Lieven Vandenberghe · 2004
Earlier work this paper cites.
Prox-Method with Rate of Convergence o ( 1 / t ) o(1/t) ) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
Arkadi Nemirovski · 2004
Earlier work this paper cites.
Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the kurdyka-łojasiewicz inequality
Hédy Attouch, Jérôme Bolte, Patrick Redont, and Antoine Soubeyran · 2010
Earlier work this paper cites.
Convergence of descent methods for semi-algebraic and tame problems: Proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods
Hedy Attouch, Jérôme Bolte, and Benar Fux Svaiter · 2013
Earlier work this paper cites.
Sinkhorn distances: Lightspeed computation of optimal transport
Marco Cuturi · 2013
Cited alongside, same era.
Constrained optimization and Lagrange multiplier methods
Dimitri P. Bertsekas · 2014
Cited alongside, same era.
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Jérôme Bolte, Shoham Sabach, and Marc Teboulle · 2014
Cited alongside, same era.
Generative adversarial nets
Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio · 2014
Cited alongside, same era.
Universal gradient methods for convex optimization problems
Yu Nesterov · 2015
Cited alongside, same era.
An inertial newton algorithm for deep learning
Camille Castera, Jérôme Bolte, Cédric Févotte, and Edouard Pauwels · 2019
Later among the works it cites.
A variational inequality perspective on generative adversarial networks
Gauthier Gidel, Hugo Berard, Gaëtan Vignoud, Pascal Vincent, and Simon Lacoste-Julien · 2019
Later among the works it cites.
Tensor Methods for Minimizing Functions with Hölder Continuous Higher-Order Derivatives
Geovani N. Grapiglia and Yurii Nesterov · 2019
Later among the works it cites.
On the convergence of single-call stochastic extra-gradient methods
Yu-Guan Hsieh, Franck Iutzeler, Jérôme Malick, and Panayotis Mertikopoulos · 2019
Later among the works it cites.
Mathematical foundations of game theory
Rida Laraki, Jérôme Renault, and Sylvain Sorin · 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…
Maryam Yashtini · 2016
Cited alongside, same era.
Wasserstein generative adversarial networks
Martin Arjovsky, Soumith Chintala, and Léon Bottou · 2017
Cited alongside, same era.
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Patrick L. Combettes and Heinz H. Bauschke · 2017
Cited alongside, same era.
Gan and vae from an optimal transport point of view, 2017
Aude Genevay, Gabriel Peyré, and Marco Cuturi · 2017
Cited alongside, same era.
Improved training of wasserstein GANs
Ishaan Gulrajani, Faruk Ahmed, Martin Arjovsky, Vincent Dumoulin, and Aaron Courville · 2017
Cited alongside, same era.
Nonconvex lagrangian-based optimization: monitoring schemes and global convergence
Jérôme Bolte, Shoham Sabach, and Marc Teboulle · 2018
Cited alongside, same era.
Learning generative models with sinkhorn divergences
Aude Genevay, Gabriel Peyré, and Marco Cuturi · 2018
Cited alongside, same era.
Optimistic mirror descent in saddle-point problems: Going the extra(-gradient) mile
Panayotis Mertikopoulos, Bruno Lecouat, Houssam Zenati, Chuan-Sheng Foo, Vijay Chandrasekhar, and Georgios Piliouras · 2019
Later among the works it cites.
Solving a class of non-convex min-max games using iterative first order methods
Maher Nouiehed, Maziar Sanjabi, Tianjian Huang, Jason D. Lee, and Meisam Razaviyayn · 2019
Later among the works it cites.
Solving a class of non-convex min-max games using iterative first order methods
Maher Nouiehed, Maziar Sanjabi, Tianjian Huang, Jason D. Lee, and Meisam Razaviyayn · 2019
Later among the works it cites.
Lagrangian methods for composite optimization
Shoham Sabach and Marc Teboulle · 2019
Later among the works it cites.
Towards A Unified Min-Max Framework for Adversarial Exploration and Robustness
Jingkang Wang, Tianyun Zhang, Sijia Liu, Pin-Yu Chen, Jiacen Xu, Makan Fardad, and Bo Li · 2019
Later among the works it cites.
On the Quality of First-Order Approximation of Functions with Hölder Continuous Gradient
Guillaume O. Berger, Pierre-Antoine Absil, Raphaël M. Jungers, and Yurii Nesterov · 2020
Closest in time.
On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
Tianyi Lin, Chi Jin, and Michael I. Jordan · 2020
Closest in time.