Fetching the paper…
Reading the bibliography…
Previous studies on stochastic primal-dual algorithms for solving min-max problems with faster convergence heavily rely on the bilinear structure of the problem, which restricts their applicability to a narrowed range of problems.
Linear-quadratic programming and optimal control
RT Rockafellar · 1987
Earlier work this paper cites.
Error bounds in mathematical programming
Jong-Shi Pang · 1997
Earlier work this paper cites.
Prediction, Learning, and Games
N. Cesa-Bianchi and G. Lugosi · 2006
Earlier work this paper cites.
Support vector machines on a budget
Ofer Dekel and Yoram Singer · 2006
Earlier work this paper cites.
Logarithmic regret algorithms for online convex optimization
Elad Hazan, Amit Agarwal, and Satyen Kale · 2007
Earlier work this paper cites.
On the generalization ability of online strongly convex programming algorithms
Sham M. Kakade and Ambuj Tewari · 2008
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.
Solving variational inequalities with stochastic mirror-prox algorithm
Anatoli Juditsky, Arkadi Nemirovski, and Claire Tauvel · 2011
Earlier work this paper cites.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization i: A generic algorithmic framework
Saeed Ghadimi and Guanghui Lan · 2012
Earlier work this paper cites.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, ii: shrinking procedures and optimal algorithms
Saeed Ghadimi and Guanghui Lan · 2013
Earlier work this paper cites.
Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
Shai Shalev-Shwartz and Tong Zhang · 2013
Cited alongside, same era.
Optimal primal-dual methods for a class of saddle point problems
Y. Chen, G. Lan, and Y. Ouyang · 2014
Cited alongside, same era.
An accelerated proximal coordinate gradient method
Qihang Lin, Zhaosong Lu, and Lin Xiao · 2014
Cited alongside, same era.
From error bounds to the complexity of first-order descent methods for convex functions
Jerome Bolte, Trong Phong Nguyen, Juan Peypouquet, and Bruce Suter · 2015
Cited alongside, same era.
Universal gradient methods for convex optimization problems
Yu Nesterov · 2015
Cited alongside, same era.
Stochastic online AUC maximization
Yiming Ying, Longyin Wen, and Siwei Lyu · 2016
Later among the works it cites.
Learning with average top-k loss
Yanbo Fan, Siwei Lyu, Yiming Ying, and Bao-Gang Hu · 2017
Later among the works it cites.
Variance-based regularization with convex objectives
Hongseok Namkoong and John C. Duchi · 2017
Later among the works it cites.
Sharpness, restart and acceleration
Vincent Roulet and Alexandre d’Aspremont · 2017
Later among the works it cites.
Stochastic convex optimization: Faster local growth implies faster global convergence
Yi Xu, Qihang Lin, and Tianbao Yang · 2017
Later among the works it cites.
Simon S. Du and Wei Hu · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Adams Wei Yu, Qihang Lin, and Tianbao Yang · 2015
Cited alongside, same era.
Stochastic primal-dual coordinate method for regularized empirical risk minimization
Yuchen Zhang and Xiao Lin · 2015
Cited alongside, same era.
Frank-wolfe algorithms for saddle point problems
Gauthier Gidel, Tony Jebara, and Simon Lacoste-Julien · 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.
Robust optimization for non-convex objectives
Robert S. Chen, Brendan Lucier, Yaron Singer, and Vasilis Syrgkanis
Cited in the paper.
Accelerated schemes for a class of variational inequalities
Yunmei Chen, Guanghui Lan, and Yuyuan Ouyang
Cited in the paper.
Later among the works it cites.
Pavel Dvurechensky, Alexander Gasnikov, Fedor Stonyakin, and Alexander Titov · 2018
Later among the works it cites.
Stochastic proximal algorithms for AUC maximization
Michael Natole, Yiming Ying, and Siwei Lyu · 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.
Rsg: Beating subgradient method without smoothness and strong convexity
Tianbao Yang and Qihang Lin · 2018
Later among the works it cites.