Fetching the paper…
Reading the bibliography…
This paper considers stochastic first-order algorithms for convex-concave minimax problems of the form $\min_{\bf x}\max_{\bf y}f(\bf x, \bf y)$, where $f$ can be presented by the average of $n$ individual components which are $L$-average smooth.
Extragradient method for finding saddle points and other problems
GM Korpelevich · 1977
Earlier work this paper cites.
The meaning and use of the area under a receiver operating characteristic (ROC) curve
James A Hanley and Barbara J McNeil · 1982
Earlier work this paper cites.
Convex optimization
Stephen Boyd, Stephen P Boyd, and Lieven Vandenberghe · 2004
Earlier work this paper cites.
An eavesdropping game with SINR as an objective function
Andrey Garnaev and Wade Trappe · 2009
Earlier work this paper cites.
LIBSVM: A library for support vector machines
Chih-Chung Chang and Chih-Jen Lin · 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.
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.
Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization
Roy Frostig, Rong Ge, Sham Kakade, and Aaron Sidford · 2015
Earlier work this paper cites.
Stochastic variance reduction methods for saddle-point problems
Balamurugan Palaniappan and Francis Bach · 2016
Earlier work this paper cites.
Tight complexity bounds for optimizing composite objectives
Blake Woodworth and Nathan Srebro · 2016
Earlier work this paper cites.
Stochastic online AUC maximization
Yiming Ying, Longyin Wen, and Siwei Lyu · 2016
Earlier work this paper cites.
Katyusha: The first direct acceleration of stochastic gradient methods
Zeyuan Allen-Zhu · 2017
Earlier work this paper cites.
An optimal randomized incremental gradient method
Guanghui Lan and Yi Zhou · 2017
Earlier work this paper cites.
SPIDER: Near-optimal non-convex optimization via stochastic path-integrated differential estimator
Cong Fang, Chris Junchi Li, Zhouchen Lin, and Tong Zhang · 2018
Earlier work this paper cites.
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
Yurii Nesterov · 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.
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.
Communication-efficient distributed stochastic AUC maximization with deep neural networks
Zhishuai Guo, Mingrui Liu, Zhuoning Yuan, Li Shen, Wei Liu, and Tianbao Yang · 2020
Later among the works it cites.
Linear lower bounds and conditioning of differentiable games
Adam Ibrahim, Waıss Azizian, Gauthier Gidel, and Ioannis Mitliagkas · 2020
Later among the works it cites.
Don’t jump through hoops and remove those loops: Svrg and katyusha are better without the outer loop
Dmitry Kovalev, Samuel Horváth, and Peter Richtárik · 2020
Later among the works it cites.
Stochastic AUC maximization with deep neural networks
Mingrui Liu, Zhuoning Yuan, Yiming Ying, and Tianbao Yang · 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.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Hoi-To Wai, Zhuoran Yang, Zhaoran Wang, and Mingyi Hong · 2018
Cited alongside, same era.
Reducing noise in GAN training with variance reduced extragradient
Tatjana Chavdarova, Gauthier Gidel, François Fleuret, and Simon Lacoste-Julien · 2019
Cited alongside, same era.
Variance-based regularization with convex objectives
John C. Duchi and Hongseok Namkoong · 2019
Cited alongside, same era.
A variational inequality perspective on generative adversarial networks
Gauthier Gidel, Hugo Berard, Gaëtan Vignoud, Pascal Vincent, and Simon Lacoste-Julien · 2019
Cited alongside, same era.
A stochastic proximal point algorithm for saddle-point problems
Luo Luo, Cheng Chen, Yujun Li, Guangzeng Xie, and Zhihua Zhang · 2019
Cited alongside, same era.
Efficient algorithms for smooth minimax optimization
Kiran K. Thekumparampil, Prateek Jain, Praneeth Netrapalli, and Sewoong Oh · 2019
Cited alongside, same era.
Yan Yan, Yi Xu, Qihang Lin, Lijun Zhang, and Tianbao Yang · 2019
Cited alongside, same era.
A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach
Aryan Mokhtari, Asuman Ozdaglar, and Sarath Pattathil · 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.
Lower complexity bounds for finite-sum convex-concave minimax optimization problems
Guangzeng Xie, Luo Luo, Yijiang Lian, and Zhihua Zhang · 2020
Later among the works it cites.
A catalyst framework for minimax optimization
Junchi Yang, Siqi Zhang, Negar Kiyavash, and Niao He · 2020
Later among the works it cites.
Stochastic variance reduction for variational inequality methods
Ahmet Alacaoglu and Yura Malitsky · 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.
On accelerated methods for saddle-point problems with composite structure
Vladislav Tominin, Yaroslav Tominin, Ekaterina Borodich, Dmitry Kovalev, Alexander Gasnikov, and Pavel Dvurechensky · 2021
Closest in time.
DIPPA: An improved method for bilinear saddle point problems
Guangzeng Xie, Yuze Han, and Zhihua Zhang · 2021
Closest in time.