Fetching the paper…
Reading the bibliography…
Nonconvex minimax problems appear frequently in emerging machine learning applications, such as generative adversarial networks and adversarial learning.
Two-person cooperative games
John Nash · 1953
Earlier work this paper cites.
Gradient methods for minimizing functionals
Boris Teodorovich Polyak · 1963
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
GM Korpelevich · 1976
Earlier work this paper cites.
Fast incremental method for smooth nonconvex optimization
Sashank J Reddi, Suvrit Sra, Barnabás Póczos, and Alex Smola · 1977
Earlier work this paper cites.
Error bounds and convergence analysis of feasible descent methods: a general approach
Zhi-Quan Luo and Paul Tseng · 1993
Earlier work this paper cites.
Robust solutions to least-squares problems with uncertain data
Laurent El Ghaoui and Hervé Lebret · 1997
Earlier work this paper cites.
Maximum margin clustering
Linli Xu, James Neufeld, Bryce Larson, and Dale Schuurmans · 2005
Earlier work this paper cites.
Solving strongly monotone variational and quasi-variational inequalities
Yurii Nesterov and Laura Scrimali · 2006
Earlier work this paper cites.
Finite-dimensional variational inequalities and complementarity problems
Francisco Facchinei and Jong-Shi Pang · 2007
Earlier work this paper cites.
Theory of games and economic behavior (commemorative edition)
John Von Neumann, Oskar Morgenstern, and Harold William Kuhn · 2007
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Earlier work this paper cites.
Gradient methods for convex minimization: better rates under weaker conditions
Hui Zhang and Wotao Yin · 2013
Earlier work this paper cites.
Prediction of acute aquatic toxicity toward daphnia magna by using the ga-k nn method
Matteo Cassotti, Davide Ballabio, Viviana Consonni, Andrea Mauri, Igor V Tetko, and Roberto Todeschini · 2014
Earlier work this paper cites.
A proximal stochastic gradient method with progressive variance reduction
Lin Xiao and Tong Zhang · 2014
Earlier work this paper cites.
Stochastic primal-dual methods and sample complexity of reinforcement learning
Yichen Chen and Mengdi Wang · 2016
Earlier work this paper cites.
Deep learning
Ian Goodfellow, Yoshua Bengio, and Aaron Courville · 2016
Earlier work this paper cites.
Linear convergence of gradient and proximal-gradient methods under the polyak-łojasiewicz condition
Hamed Karimi, Julie Nutini, and Mark Schmidt · 2016
Cited alongside, same era.
Stochastic gradient methods for distributionally robust optimization with f-divergences
Hongseok Namkoong and John C Duchi · 2016
Cited alongside, same era.
Stochastic variance reduction methods for saddle-point problems
Balamurugan Palaniappan and Francis Bach · 2016
Cited alongside, same era.
Geometrical properties and accelerated gradient solvers of non-convex phase retrieval
Yi Zhou, Huishuai Zhang, and Yingbin Liang · 2016
Cited alongside, same era.
Robust optimization for non-convex objectives
Robert S Chen, Brendan Lucier, Yaron Singer, and Vasilis Syrgkanis · 2017
Cited alongside, same era.
Learning from conditional distributions via dual embeddings
A geometric analysis of phase retrieval
Ju Sun, Qing Qu, and John Wright · 2018
Later among the works it cites.
Last-iterate convergence rates for min-max optimization
Jacob Abernethy, Kevin A Lai, and Andre Wibisono · 2019
Later among the works it cites.
Finite regret and cycles with fixed step-size via alternating gradient descent-ascent
James P Bailey, Gauthier Gidel, and Georgios Piliouras · 2019
Later among the works it cites.
On the global convergence of imitation learning: A case for linear quadratic regulator
Qi Cai, Mingyi Hong, Yongxin Chen, and Zhaoran Wang · 2019
Later among the works it cites.
Gradient descent finds global minima of deep neural networks
Simon Du, Jason Lee, Haochuan Li, Liwei Wang, and Xiyu Zhai · 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…
Bo Dai, Niao He, Yunpeng Pan, Byron Boots, and Le Song · 2017
Cited alongside, same era.
Towards deep learning models resistant to adversarial attacks
Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu · 2017
Cited alongside, same era.
Variance-based regularization with convex objectives
Hongseok Namkoong and John C Duchi · 2017
Cited alongside, same era.
Certifiable distributional robustness with principled adversarial training
Aman Sinha, Hongseok Namkoong, and John Duchi · 2017
Cited alongside, same era.
SBEED: Convergent reinforcement learning with nonlinear function approximation
Bo Dai, Albert Shaw, Lihong Li, Lin Xiao, Niao He, Zhen Liu, Jianshu Chen, and Le Song · 2018
Cited alongside, same era.
Training gans with optimism
Constantinos Daskalakis, Andrew Ilyas, Vasilis Syrgkanis, and Haoyang Zeng · 2018
Cited alongside, same era.
Global convergence of policy gradient methods for the linear quadratic regulator
Maryam Fazel, Rong Ge, Sham Kakade, and Mehran Mesbahi · 2018
Cited alongside, same era.
Linear convergence of the primal-dual gradient method for convex-concave saddle point problems without strong convexity
Simon S Du and Wei Hu · 2019
Later among the works it cites.
Negative momentum for improved game dynamics
Gauthier Gidel, Reyhane Askari Hemmat, Mohammad Pezeshki, Rémi Le Priol, Gabriel Huang, Simon Lacoste-Julien, and Ioannis Mitliagkas · 2019
Later among the works it cites.
What is local optimality in nonconvex-nonconcave minimax optimization?
Chi Jin, Praneeth Netrapalli, and Michael I Jordan · 2019
Later among the works it cites.
On gradient descent ascent for nonconvex-concave minimax problems
Tianyi Lin, Chi Jin, and Michael I Jordan · 2019
Later among the works it cites.
A stochastic proximal point algorithm for saddle-point problems
Luo Luo, Cheng Chen, Yujun Li, Guangzeng Xie, and Zhihua Zhang · 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.
Robust optimization over multiple domains
Qi Qian, Shenghuo Zhu, Jiasheng Tang, Rong Jin, Baigui Sun, and Hao Li · 2019
Later among the works it cites.
Efficient algorithms for smooth minimax optimization
Kiran K Thekumparampil, Prateek Jain, Praneeth Netrapalli, and Sewoong Oh · 2019
Later among the works it cites.
Near-optimal algorithms for minimax optimization
Tianyi Lin, Chi Jin, Michael Jordan, et al · 2020
Closest in time.
Luo Luo, Haishan Ye, and Tong Zhang · 2020
Closest in time.