Fetching the paper…
Reading the bibliography…
Epoch gradient descent method (a.k.a.
Excessive gap technique in nonsmooth convex minimization
Yu Nesterov · 2005
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.
Robust stochastic approximation approach to stochastic programming
Arkadi Nemirovski, Anatoli Juditsky, Guanghui Lan, and Alexander Shapiro · 2009
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.
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization
Elad Hazan and Satyen Kale · 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.
Validation analysis of mirror descent stochastic approximation method
Guanghui Lan, Arkadi Nemirovski, and Alexander Shapiro · 2012
Earlier work this paper cites.
Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
Shai Shalev-Shwartz and Tong Zhang · 2013
Earlier work this paper cites.
Optimal primal-dual methods for a class of saddle point problems
Yunmei Chen, Guanghui Lan, and Yuyuan Ouyang · 2014
Earlier work this paper cites.
Randomized first-order methods for saddle point optimization
Cong Dang and Guanghui Lan · 2014
Earlier work this paper cites.
Generative adversarial nets
Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio · 2014
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.
An efficient primal dual prox method for non-smooth optimization
Tianbao Yang, Mehrdad Mahdavi, Rong Jin, and Shenghuo Zhu · 2015
Earlier work this paper cites.
Adams Wei Yu, Qihang Lin, and Tianbao Yang · 2015
Earlier work this paper cites.
Frank-wolfe algorithms for saddle point problems
Gauthier Gidel, Tony Jebara, and Simon Lacoste-Julien · 2016
Cited alongside, same era.
Mingyi Hong · 2016
Cited alongside, same era.
Stochastic gradient methods for distributionally robust optimization with f-divergences
Hongseok Namkoong and John C. Duchi · 2016
Cited alongside, same era.
Stochastic variance reduction methods for saddle-point problems
Balamurugan Palaniappan and Francis R. Bach · 2016
Cited alongside, same era.
Stochastic online auc maximization
Yiming Ying, Longyin Wen, and Siwei Lyu · 2016
Cited alongside, same era.
Fast stochastic auc maximization with o(1/n)-convergence rate
Mingrui Liu, Xiaoxuan Zhang, Zaiyi Chen, Xiaoyu Wang, and Tianbao Yang · 2018
Later among the works it cites.
Non-convex min-max optimization: Provable algorithms and applications in machine learning
Hassan Rafique, Mingrui Liu, Qihang Lin, and Tianbao Yang · 2018
Later among the works it cites.
Stochastic primal-dual method for empirical risk minimization with o (1) per-iteration complexity
Conghui Tan, Tong Zhang, Shiqian Ma, and Ji Liu · 2018
Later among the works it cites.
Lower bounds for non-convex stochastic optimization
Yossi Arjevani, Yair Carmon, John C Duchi, Dylan J Foster, Nathan Srebro, and Blake Woodworth · 2019
Later among the works it cites.
Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization
Davood Hajinezhad and Mingyi Hong · 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…
Martin Arjovsky, Soumith Chintala, and Léon Bottou · 2017
Cited alongside, same era.
Learning with average top-k loss
Yanbo Fan, Siwei Lyu, Yiming Ying, and Baogang Hu · 2017
Cited alongside, same era.
An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems
Le Thi Khanh Hien, Renbo Zhao, and William B Haskell · 2017
Cited alongside, same era.
Variance-based regularization with convex objectives
Hongseok Namkoong and John C. Duchi · 2017
Cited alongside, same era.
Exploiting strong convexity from data with primal-dual first-order algorithms
Jialei Wang and Lin Xiao · 2017
Cited alongside, same era.
Stochastic primal-dual coordinate method for regularized empirical risk minimization
Yuchen Zhang and Lin Xiao · 2017
Cited alongside, same era.
Simon S Du and Wei Hu · 2018
Cited alongside, same era.
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.
On gradient descent ascent for nonconvex-concave minimax problems
Tianyi Lin, Chi Jin, and Michael I. Jordan · 2019
Later among the works it cites.
Stochastic auc maximization with deep neural networks
Mingrui Liu, Zhuoning Yuan, Yiming Ying, and Tianbao Yang · 2019
Later among the works it cites.
Songtao Lu, Ioannis Tsaknakis, Mingyi Hong, and Yongxin Chen · 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.
Yan Yan, Yi Xu, Qihang Lin, Lijun Zhang, and Tianbao Yang · 2019
Later among the works it cites.
Optimal algorithms for stochastic three-composite convex-concave saddle point problems
Renbo Zhao · 2019
Later among the works it cites.
Tong Zhang Luo Luo, Haishan Ye · 2020
Closest in time.