Fetching the paper…
Reading the bibliography…
This paper focuses on stochastic methods for solving smooth non-convex strongly-concave min-max problems, which have received increasing attention due to their potential applications in deep learning (e.g., deep AUC maximization, distributionally robust optimization).
Gradient methods for minimizing functionals
Boris Teodorovich Polyak · 1963
Earlier work this paper cites.
Monotone operators and the proximal point algorithm
R Tyrrell Rockafellar · 1976
Earlier work this paper cites.
On a theorem of danskin with an application to a theorem of von neumann-sion
Pierre Bernhard and Alain Rapaport · 1995
Earlier work this paper cites.
Prox-method with rate of convergence O (1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems
Arkadi Nemirovski · 2004
Earlier work this paper cites.
Introductory Lectures on Convex Optimization - A Basic Course , volume 87 of Applied Optimization
Yurii E. Nesterov · 2004
Earlier work this paper cites.
Asirra: a CAPTCHA that exploits interest-aligned manual image categorization
Jeremy Elson, John R. Douceur, Jon Howell, and Jared Saul · 2007
Earlier work this paper cites.
Efficient projections onto the l 1-ball for learning in high dimensions
John Duchi, Shai Shalev-Shwartz, Yoram Singer, and Tushar Chandra · 2008
Earlier work this paper cites.
Learning multiple layers of features from tiny images
Alex Krizhevsky, Geoffrey Hinton, et al · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
Arkadi Nemirovski, Anatoli Juditsky, Guanghui Lan, and Alexander Shapiro · 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.
Adaptive subgradient methods for online learning and stochastic optimization
John Duchi, Elad Hazan, and Yoram Singer · 2011
Earlier work this paper cites.
Solving variational inequalities with stochastic mirror-prox algorithm
Anatoli Juditsky, Arkadi Nemirovski, and Claire Tauvel · 2011
Earlier work this paper cites.
Beyond the regret minimization barrier: Optimal algorithms for stochastic strongly-convex optimization
Elad Hazan and Satyen Kale · 2014
Earlier work this paper cites.
Identity mappings in deep residual networks
Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun · 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
Earlier work this paper cites.
Stochastic gradient methods for distributionally robust optimization with f-divergences
Hongseok Namkoong and John C Duchi · 2016
Earlier work this paper cites.
Stochastic variance reduction for nonconvex optimization
Sashank J Reddi, Ahmed Hefny, Suvrit Sra, Barnabás Póczos, 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.
Identity matters in deep learning
Moritz Hardt and Tengyu Ma · 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.
Convergence analysis of two-layer neural networks with relu activation
Yuanzhi Li and Yang Yuan · 2017
Earlier work this paper cites.
Variance-based regularization with convex objectives
Hongseok Namkoong and John C Duchi · 2017
Earlier work this paper cites.
Stochastic recursive gradient algorithm for nonconvex optimization
Lam M Nguyen, Jie Liu, Katya Scheinberg, and Martin Takáč · 2017
Earlier work this paper cites.
Characterization of gradient dominance and regularity conditions for neural networks
Yi Zhou and Yingbin Liang · 2017
Cited alongside, same era.
Stability and generalization of learning algorithms that converge to global optima
Zachary B. Charles and Dimitris S. Papailiopoulos · 2018
Cited alongside, same era.
Sadagrad: Strongly adaptive stochastic gradient methods
Zaiyi Chen, Yi Xu, Enhong Chen, and Tianbao Yang · 2018
Cited alongside, same era.
Calculus of the exponent of kurdyka–łojasiewicz inequality and its applications to linear convergence of first-order methods
Guoyin Li and Ting Kei Pong · 2018
Cited alongside, same era.
Learning overparameterized neural networks via stochastic gradient descent on structured data
Yuanzhi Li and Yingyu Liang · 2018
Cited alongside, same era.
Alternating proximal-gradient steps for (stochastic) nonconvex-concave minimax problems
Radu Ioan Boţ and Axel Böhm · 2020
Closest in time.
Communication-efficient distributed stochastic auc maximization with deep neural networks
Zhishuai Guo, Mingrui Liu, Zhuoning Yuan, Li Shen, Wei Liu, and Tianbao Yang · 2020
Closest in time.
Hybrid block successive approximation for one-sided non-convex min-max problems: Algorithms and applications
Songtao Lu, Ioannis C. Tsaknakis, Mingyi Hong, and Yongxin Chen · 2020
Closest in time.
Stochastic recursive gradient descent ascent for stochastic nonconvex-strongly-concave minimax problems
Luo Luo, Haishan Ye, Zhichao Huang, and Tong Zhang · 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
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A simple proximal stochastic gradient method for nonsmooth nonconvex optimization
Zhize Li and Jian Li · 2018
Cited alongside, same era.
Solving weakly-convex-weakly-concave saddle-point problems as weakly-monotone variational inequality
Qihang Lin, Mingrui Liu, Hassan Rafique, and Tianbao Yang · 2018
Cited alongside, same era.
Fast stochastic auc maximization with O ( 1 / n ) {O}(1/n) -convergence rate
Mingrui Liu, Xiaoxuan Zhang, Zaiyi Chen, Xiaoyu Wang, and Tianbao Yang · 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.
Solving non-convex non-concave min-max games under polyak-l ojasiewicz condition
Maziar Sanjabi, Meisam Razaviyayn, and Jason D Lee · 2018
Cited alongside, same era.
Spiderboost: A class of faster variance-reduced algorithms for nonconvex optimization
Zhe Wang, Kaiyi Ji, Yi Zhou, Yingbin Liang, and Vahid Tarokh · 2018
Cited alongside, same era.
Stochastic nested variance reduced gradient descent for nonconvex optimization
Dongruo Zhou, Pan Xu, and Quanquan Gu · 2018
Cited alongside, same era.
Closest in time.
Single-timescale stochastic nonconvex-concave optimization for smooth nonlinear td learning
Shuang Qiu, Zhuoran Yang, Xiaohan Wei, Jieping Ye, and Zhaoran Wang · 2020
Closest in time.
Hybrid variance-reduced SGD algorithms for minimax problems with nonconvex-linear function
Quoc Tran-Dinh, Deyi Liu, and Lam M. Nguyen · 2020
Closest in time.
Hybrid variance-reduced sgd algorithms for minimax problems with nonconvex-linear function
Quoc Tran-Dinh, Deyi Liu, and Lam M Nguyen · 2020
Closest in time.
Zeroth-order algorithms for nonconvex minimax problems with improved complexities
Zhongruo Wang, Krishnakumar Balasubramanian, Shiqian Ma, and Meisam Razaviyayn · 2020
Closest in time.
Enhanced first and zeroth order variance reduced algorithms for min-max optimization
Tengyu Xu, Zhe Wang, Yingbin Liang, and H Vincent Poor · 2020
Closest in time.
Optimal 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.
Zhuoning Yuan, Yan Yan, Milan Sonka, and Tianbao Yang · 2020
Closest in time.
A primal dual smoothing framework for max-structured nonconvex optimization
Renbo Zhao · 2020
Closest in time.
Minimax optimization with smooth algorithmic adversaries
Tanner Fiez, Chi Jin, Praneeth Netrapalli, and Lillian J Ratliff · 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.
Efficient mirror descent ascent methods for nonsmooth minimax problems
Feihu Huang, Xidong Wu, and Heng Huang · 2021
Closest in time.
Stability and generalization of stochastic gradient methods for minimax problems
Yunwen Lei, Zhenhuan Yang, Tianbao Yang, and Yiming Ying · 2021
Closest in time.
Finding second-order stationary point for nonconvex-strongly-concave minimax problem
Luo Luo and Cheng Chen · 2021
Closest in time.
An online method for a class of distributionally robust optimization with non-convex objectives
Qi Qi, Zhishuai Guo, Yi Xu, Rong Jin, and Tianbao Yang · 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.
Zi Xu, Jingjing Shen, Ziqi Wang, and Yuhong Dai · 2021
Closest in time.
Accelerated zeroth-order and first-order momentum methods from mini to minimax optimization
Feihu Huang, Shangqian Gao, Jian Pei, and Heng Huang · 2022
Closest in time.
Accelerated stochastic algorithms for convex-concave saddle-point problems
Renbo Zhao · 2022
Closest in time.