Fetching the paper…
Reading the bibliography…
We study the smooth minimax optimization problem $\min_{\bf x}\max_{\bf y} f({\bf x},{\bf y})$, where $f$ is $\ell$-smooth, strongly-concave in ${\bf y}$ but possibly nonconvex in ${\bf x}$.
A method for solving the convex programming problem with convergence rate o ( 1 / k 2 ) o(1/k^{2})
Yurii E Nesterov · 1983
Earlier work this paper cites.
Second-order derivatives of extremal-value functions and optimality conditions for semi-infinite programs
Alexander Shapiro · 1985
Earlier work this paper cites.
Iterative Solution Methods
Owe Axelsson · 1994
Earlier work this paper cites.
Fast exact multiplication by the Hessian
Barak A. Pearlmutter · 1994
Earlier work this paper cites.
Gradient-based learning applied to document recognition
Yann LeCun, Léon Bottou, Yoshua Bengio, and Patrick Haffner · 1998
Earlier work this paper cites.
Fast curvature matrix-vector products for second-order gradient descent
Nicol N. Schraudolph · 2002
Earlier work this paper cites.
Cubic regularization of newton method and its global performance
Yurii Nesterov and Boris T. Polyak · 2006
Earlier work this paper cites.
Escaping from saddle points-online stochastic gradient for tensor decomposition
Rong Ge, Furong Huang, Chi Jin, and Yang Yuan · 2015
Earlier work this paper cites.
Global optimality of local search for low rank matrix recovery
Srinadh Bhojanapalli, Behnam Neyshabur, and Nati Srebro · 2016
Earlier work this paper cites.
Domain-adversarial training of neural networks
Yaroslav Ganin, Evgeniya Ustinova, Hana Ajakan, Pascal Germain, Hugo Larochelle, François Laviolette, Mario Marchand, and Victor Lempitsky · 2016
Earlier work this paper cites.
Matrix completion has no spurious local minimum
Rong Ge, Jason D. Lee, and Tengyu Ma · 2016
Earlier work this paper cites.
Complete dictionary recovery over the sphere I: Overview and the geometric picture
Ju Sun, Qing Qu, and John Wright · 2016
Earlier work this paper cites.
Finding approximate local minima faster than gradient descent
Naman Agarwal, Zeyuan Allen-Zhu, Brian Bullins, Elad Hazan, and Tengyu Ma · 2017
Earlier work this paper cites.
How to escape saddle points efficiently
Chi Jin, Rong Ge, Praneeth Netrapalli, Sham M Kakade, and Michael I Jordan · 2017
Cited alongside, same era.
Sub-sampled cubic regularization for non-convex optimization
Jonas Moritz Kohler and Aurelien Lucchi · 2017
Cited alongside, same era.
Lectures on convex optimization , volume 137
Yurii Nesterov · 2018
Cited alongside, same era.
On the convergence and robustness of training GANs with regularized optimal transport
Maziar Sanjabi, Jimmy Ba, Meisam Razaviyayn, and Jason D. Lee · 2018
Cited alongside, same era.
Certifying some distributional robustness with principled adversarial training
Aman Sinha, Hongseok Namkoong, and John Duchi · 2018
Cited alongside, same era.
A geometric analysis of phase retrieval
Ju Sun, Qing Qu, and John Wright · 2018
Accelerated zeroth-order momentum methods from mini to minimax optimization
Feihu Huang, Shangqian Gao, Jian Pei, and Heng Huang · 2020
Later among the works it cites.
What is local optimality in nonconvex-nonconcave minimax optimization?
Chi Jin, Praneeth Netrapalli, and Michael I. Jordan · 2020
Later among the works it cites.
Stochastic recursive gradient descent ascent for stochastic nonconvex-strongly-concave minimax problems
Luo Luo, Haishan Ye, Zhichao Huang, and Tong Zhang · 2020
Later among the works it cites.
Single-timescale stochastic nonconvex-concave optimization for smooth nonlinear TD learning
Shuang Qiu, Zhuoran Yang, Xiaohan Wei, Jieping Ye, and Zhaoran Wang · 2020
Later among the works it cites.
Improved algorithms for convex-concave minimax optimization
Yuanhao Wang and Jian Li · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Stochastic cubic regularization for fast nonconvex optimization
Nilesh Tripuraneni, Mitchell Stern, Chi Jin, Jeffrey Regier, and Michael I. Jordan · 2018
Cited alongside, same era.
Gradient descent finds the cubic-regularized nonconvex newton step
Yair Carmon and John Duchi · 2019
Cited alongside, same era.
On finding local nash equilibria (and only local nash equilibria) in zero-sum games
Eric V Mazumdar, Michael I Jordan, and S Shankar Sastry · 2019
Cited alongside, same era.
On solving minimax optimization locally: A follow-the-ridge approach
Yuanhao Wang, Guodong Zhang, and Jimmy Ba · 2019
Cited alongside, same era.
Stochastic variance-reduced cubic regularization methods
Dongruo Zhou, Pan Xu, and Quanquan Gu · 2019
Cited alongside, same era.
Fast objective & duality gap convergence for nonconvex-strongly-concave min-max problems
Zhishuai Guo, Zhuoning Yuan, Yan Yan, and Tianbao Yang · 2020
Cited alongside, same era.
Gradient free minimax optimization: Variance reduction and faster convergence
Tengyu Xu, Zhe Wang, Yingbin Liang, and H Vincent Poor · 2020
Later among the works it cites.
Newton-type methods for minimax optimization
Guojun Zhang, Kaiwen Wu, Pascal Poupart, and Yaoliang Yu · 2020
Later among the works it cites.
Ziyi Chen, Qunwei Li, and Yi Zhou · 2021
Closest in time.
Global convergence to local minmax equilibrium in classes of nonconvex zero-sum games
Tanner Fiez, Lillian Ratliff, Eric Mazumdar, Evan Faulkner, and Adhyyan Narang · 2021
Closest in time.
Lower complexity bounds of finite-sum optimization problems: The results and construction
Yuze Han, Guangzeng Xie, and Zhihua Zhang · 2021
Closest in time.
Near optimal stochastic algorithms for finite-sum unbalanced convex-concave minimax optimization
Luo Luo, Guangzeng Xie, Tong Zhang, and Zhihua Zhang · 2021
Closest in time.
A faster decentralized algorithm for nonconvex minimax problems
Wenhan Xian, Feihu Huang, Yanfu Zhang, and Heng Huang · 2021
Closest in time.
The complexity of nonconvex-strongly-concave minimax optimization
Siqi Zhang, Junchi Yang, Cristóbal Guzmán, Negar Kiyavash, and Niao He · 2021
Closest in time.