Fetching the paper…
Reading the bibliography…
This paper studies the complexity for finding approximate stationary points of nonconvex-strongly-concave (NC-SC) smooth minimax problems, in both general and averaged smooth finite-sum settings.
Monotone operators and the proximal point algorithm
R Tyrrell Rockafellar · 1976
Earlier work this paper cites.
Probabilistic computations: Toward a unified measure of complexity
Andrew Chi-Chin Yao · 1977
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
Arkadi. S. Nemirovski and David. B. Yudin · 1983
Earlier work this paper cites.
Information-based complexity
Joseph F. Traub, G. W. Wasilkowski, and H. Woźniakowski · 1988
Earlier work this paper cites.
On the convergence of the proximal point algorithm for convex minimization
Osman Güler · 1991
Earlier work this paper cites.
On optimality of krylov’s information when solving linear operator equations
Arkadi S. Nemirovsky · 1991
Earlier work this paper cites.
New proximal point algorithms for convex minimization
Osman Güler · 1992
Earlier work this paper cites.
Information-based complexity of linear operator equations
Arkadi S Nemirovsky · 1992
Earlier work this paper cites.
On linear convergence of iterative methods for the variational inequality problem
Paul Tseng · 1995
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Yu Nesterov · 2005
Earlier work this paper cites.
Enhanced first and zeroth order variance reduced algorithms for min-max optimization
Tengyu Xu, Zhe Wang, Yingbin Liang, and H Vincent Poor · 2006
Earlier work this paper cites.
Zi Xu, Huiling Zhang, Yang Xu, and Guanghui Lan · 2006
Earlier work this paper cites.
Information-theoretic lower bounds on the oracle complexity of convex optimization
Alekh Agarwal, Martin J Wainwright, Peter L Bartlett, and Pradeep K Ravikumar · 2009
Earlier work this paper cites.
How to make the gradients small
Yurii Nesterov · 2012
Earlier work this paper cites.
Understanding machine learning: From theory to algorithms
Shai Shalev-Shwartz and Shai Ben-David · 2014
Earlier work this paper cites.
A lower bound for the optimization of finite sums
Alekh Agarwal and Leon Bottou · 2015
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.
A universal catalyst for first-order optimization
Hongzhou Lin, Julien Mairal, and Zaid Harchaoui · 2015
Earlier work this paper cites.
Stochastic variance reduction methods for saddle-point problems
P Balamurugan 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.
Lower bounds on the oracle complexity of nonsmooth convex optimization via information theory
Gábor Braun, Cristóbal Guzmán, and Sebastian Pokutta · 2017
Earlier work this paper cites.
Learning from conditional distributions via dual embeddings
Bo Dai, Niao He, Yunpeng Pan, Byron Boots, and Le Song · 2017
Earlier work this paper cites.
Stochastic mirror descent in variationally coherent optimization problems
Zhengyuan Zhou, Panayotis Mertikopoulos, Nicholas Bambos, Stephen Boyd, and Peter W Glynn · 2017
Earlier work this paper cites.
How to make the gradients small stochastically: even faster convex and nonconvex sgd
Zeyuan Allen-Zhu · 2018
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.
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 variational inequality perspective on generative adversarial networks
Gauthier Gidel, Hugo Berard, Gaëtan Vignoud, Pascal Vincent, and Simon Lacoste-Julien · 2018
Cited alongside, same era.
Lectures on convex optimization , volume 137
Yurii Nesterov · 2018
Cited alongside, same era.
Catalyst for gradient-based nonconvex optimization
A tight and unified analysis of gradient-based methods for a whole spectrum of differentiable games
Waïss Azizian, Ioannis Mitliagkas, Simon Lacoste-Julien, and Gauthier Gidel · 2020
Later among the works it cites.
Alternating proximal-gradient steps for (stochastic) nonconvex-concave minimax problems
Radu Ioan Boţ and Axel Böhm · 2020
Later among the works it cites.
Recent theoretical advances in non-convex optimization
Marina Danilova, Pavel Dvurechensky, Alexander Gasnikov, Eduard Gorbunov, Sergey Guminov, Dmitry Kamzolov, and Innokentiy Shibaev · 2020
Later among the works it cites.
The complexity of constrained min-max optimization
Constantinos Daskalakis, Stratis Skoulakis, and Manolis Zampetakis · 2020
Later among the works it cites.
Halpern iteration for near-optimal and parameter-free monotone inclusion and strong solutions to variational inequalities
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Courtney Paquette, Hongzhou Lin, Dmitriy Drusvyatskiy, Julien Mairal, and Zaid Harchaoui · 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.
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.
Stochastic primal-dual method for empirical risk minimization with o ( 1 ) o(1) per-iteration complexity
Conghui Tan, Tong Zhang, Shiqian Ma, and Ji Liu · 2018
Cited alongside, same era.
Lower bounds for non-convex stochastic optimization
Yossi Arjevani, Yair Carmon, John C Duchi, Dylan J Foster, Nathan Srebro, and Blake Woodworth · 2019
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.
Jelena Diakonikolas · 2020
Later among the works it cites.
Efficient methods for structured nonconvex-nonconcave min-max optimization
Jelena Diakonikolas, Constantinos Daskalakis, and Michael I Jordan · 2020
Later among the works it cites.
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.
On the convergence rate of density-ratio basedoff-policy policy gradient methods
Jiawei Huang and Nan Jiang · 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.
What is local optimality in nonconvex-nonconcave minimax optimization?
Chi Jin, Praneeth Netrapalli, and Michael Jordan · 2020
Later among the works it cites.
Sgd learns one-layer networks in wgans
Qi Lei, Jason Lee, Alex Dimakis, and Constantinos Daskalakis · 2020
Later among the works it cites.
Page: A simple and optimal probabilistic gradient estimator for nonconvex optimization
Zhize Li, Hongyan Bao, Xiangliang Zhang, and Peter Richtárik · 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.
Efficient search of first-order nash equilibria in nonconvex-concave smooth min-max problems
Dmitrii M Ostrovskii, Andrew Lowy, and Meisam Razaviyayn · 2020
Later among the works it cites.
Optimistic dual extrapolation for coherent non-monotone variational inequalities
Chaobing Song, Zhengyuan Zhou, Yichao Zhou, Yong Jiang, and Yi Ma · 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 single-loop smoothed gradient descent-ascent algorithm for nonconvex-concave min-max problems
Jiawei Zhang, Peijun Xiao, Ruoyu Sun, and Zhi-Quan Luo · 2020
Later among the works it cites.
A primal dual smoothing framework for max-structured nonconvex optimization
Renbo Zhao · 2020
Later among the works it cites.
Jelena Diakonikolas and Cristóbal Guzmán · 2021
Closest in time.
Potential function-based framework for making the gradients small in convex and min-max optimization
Jelena Diakonikolas and Puqian Wang · 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.
TaeHo Yoon and Ernest K Ryu · 2021
Closest in time.
Federated deep auc maximization for heterogeneous data with a constant communication complexity
Zhuoning Yuan, Zhishuai Guo, Yi Xu, Yiming Ying, and Tianbao Yang · 2021
Closest in time.