Fetching the paper…
Reading the bibliography…
We consider nonconvex-concave minimax optimization problems of the form $\min_{\bf x}\max_{\bf y\in{\mathcal Y}} f({\bf x},{\bf y})$, where $f$ is strongly-concave in $\bf y$ but possibly nonconvex in $\bf x$ and ${\mathcal Y}$ is a convex and compact set.
Penalized likelihood regression for generalized linear models with non-quadratic penalties
Anestis Antoniadis, Irène Gijbels, and Mila Nikolova · 2011
Earlier work this paper cites.
A first-order primal-dual algorithm for convex problems with applications to imaging
Antonin Chambolle and Thomas Pock · 2011
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Earlier work this paper cites.
Linear convergence with condition number independent access of full gradients
Lijun Zhang, Mehrdad Mahdavi, and Rong Jin · 2013
Earlier work this paper cites.
SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives
Aaron Defazio, Francis Bach, and Simon Lacoste-Julien · 2014
Earlier work this paper cites.
Variance reduction for faster non-convex optimization
Zeyuan Allen-Zhu and Elad Hazan · 2016
Earlier work this paper cites.
A simple practical accelerated method for finite sums
Aaron Defazio · 2016
Earlier work this paper cites.
Stochastic variance reduction methods for saddle-point problems
Balamurugan Palaniappan and Francis Bach · 2016
Earlier work this paper cites.
Stochastic variance reduction for nonconvex optimization
Sashank J. Reddi, Ahmed Hefny, Suvrit Sra, Barnabas Poczos, and Alex Smola · 2016
Earlier work this paper cites.
Stochastic online AUC maximization
Yiming Ying, Longyin Wen, and Siwei Lyu · 2016
Earlier work this paper cites.
Stochastic variance reduction methods for policy evaluation
Simon S. Du, Jianshu Chen, Lihong Li, Lin Xiao, and Dengyong Zhou · 2017
Earlier work this paper cites.
Sub-sampled cubic regularization for non-convex optimization
Jonas Moritz Kohler and Aurelien Lucchi · 2017
Earlier work this paper cites.
Non-convex finite-sum optimization via SCSG methods
Lihua Lei, Cheng Ju, Jianbo Chen, and Michael I. Jordan · 2017
Earlier work this paper cites.
SARAH: A novel method for machine learning problems using stochastic recursive gradient
Lam M. Nguyen, Jie Liu, Katya Scheinberg, and Martin Takáč · 2017
Earlier work this paper cites.
Minimizing finite sums with the stochastic average gradient
Mark Schmidt, Nicolas Le Roux, and Francis Bach · 2017
Earlier work this paper cites.
Stochastic primal-dual coordinate method for regularized empirical risk minimization
Yuchen Zhang and Lin Xiao · 2017
Earlier work this paper cites.
Katyusha X: Practical momentum method for stochastic sum-of-nonconvex optimization
Zeyuan Allen-Zhu · 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 · 2018
Cited alongside, same era.
SPIDER: Near-optimal non-convex optimization via stochastic path-integrated differential estimator
Cong Fang, Chris Junchi Li, Zhouchen Lin, and Tong Zhang · 2018
Cited alongside, same era.
A simple proximal stochastic gradient method for nonsmooth nonconvex optimization
Zhize Li and Jian Li · 2018
Cited alongside, same era.
Catalyst acceleration for first-order convex optimization: from theory to practice
Hongzhou Lin, Julien Mairal, and Zaid Harchaoui · 2018
Cited alongside, same era.
Lectures on convex optimization , volume 137
Variance-based regularization with convex objectives
John C. Duchi and Hongseok Namkoong · 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.
Hybrid block successive approximation for one-sided non-convex min-max problems: algorithms and applications
Songtao Lu, Ioannis Tsaknakis, Mingyi Hong, and Yongxin Chen · 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.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Yurii Nesterov · 2018
Cited alongside, same era.
Inexact SARAH algorithm for stochastic optimization
Lam M. Nguyen, Katya Scheinberg, and Martin Takáč · 2018
Cited alongside, same era.
Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
Yuyuan Ouyang and Yangyang Xu · 2018
Cited alongside, same era.
Non-convex min-max optimization: Provable algorithms and applications in machine learning
Hassan Rafique, Mingrui Liu, Qihang Lin, and Tianbao Yang · 2018
Cited alongside, same era.
Towards more efficient stochastic decentralized learning: Faster convergence and sparse communication
Zebang Shen, Aryan Mokhtari, Tengfei Zhou, Peilin Zhao, and Hui Qian · 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.
Stochastic primal-dual method for empirical risk minimization with O(1) per-iteration complexity
Conghui Tan, Tong Zhang, Shiqian Ma, and Ji Liu · 2018
Cited alongside, same era.
Nhan H. Pham, Lam M. Nguyen, Dzung T. Phan, and Quoc Tran-Dinh · 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.
SpiderBoost and momentum: Faster variance reduction algorithms
Zhe Wang, Kaiyi Ji, Yi Zhou, Yingbin Liang, and Vahid Tarokh · 2019
Later among the works it cites.
Yan Yan, Yi Xu, Qihang Lin, Lijun Zhang, and Tianbao Yang · 2019
Later among the works it cites.
Multi-level composite stochastic optimization via nested variance reduction
Junyu Zhang and Lin Xiao · 2019
Later among the works it cites.
On lower iteration complexity bounds for the saddle point problems
Junyu Zhang, Mingyi Hong, and Shuzhong Zhang · 2019
Later among the works it cites.
Solving non-convex non-differentiable min-max games using proximal gradient method
Babak Barazandeh and Meisam Razaviyayn · 2020
Closest in time.
What is local optimality in nonconvex-nonconcave minimax optimization?
Chi Jin, Praneeth Netrapalli, and Michael I. Jordan · 2020
Closest in time.
Efficient search of first-order Nash equilibria in nonconvex-concave smooth min-max problems
Dmitrii M. Ostrovskii, Andrew Lowy, and Meisam Razaviyayn · 2020
Closest in time.
Lower complexity bounds for finite-sum convex-concave minimax optimization problems
Guangzeng Xie, Luo Luo, Yijiang Lian, and Zhihua Zhang · 2020
Closest in time.
Sharp analysis of epoch stochastic gradient descent ascent methods for min-max optimization
Yan Yan, Yi Xu, Qihang Lin, Wei Liu, and Tianbao Yang · 2020
Closest in time.