Fetching the paper…
Reading the bibliography…
Monotone operators associated with saddle-functions and minimax problems
R Tyrrell Rockafellar · 1970
Earlier work this paper cites.
A method for solving the convex programming problem with convergence rate o (1/kˆ 2)
Yurii E Nesterov · 1983
Earlier work this paper cites.
Convergence rates in forward–backward splitting
George HG Chen and R Tyrrell Rockafellar · 1997
Earlier work this paper cites.
Analysis of temporal-diffference learning with function approximation
John N Tsitsiklis and Benjamin Van Roy · 1997
Earlier work this paper cites.
Large margin rank boundaries for ordinal regression
Ralf Herbrich, Thore Graepel, and Klaus Obermayer · 2000
Earlier work this paper cites.
A support vector method for multivariate performance measures
Thorsten Joachims · 2005
Earlier work this paper cites.
Maximum margin clustering
Linli Xu, James Neufeld, Bryce Larson, and Dale Schuurmans · 2005
Earlier work this paper cites.
Convex sparse matrix factorizations
Francis Bach, Julien Mairal, and Jean Ponce · 2008
Earlier work this paper cites.
Robust optimization , volume 28
Aharon Ben-Tal, Laurent El Ghaoui, and Arkadi Nemirovski · 2009
Earlier work this paper cites.
Large-scale machine learning with stochastic gradient descent
Léon Bottou · 2010
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.
Stochastic dual coordinate ascent methods for regularized loss minimization
Shai Shalev-Shwartz and Tong Zhang · 2013
Earlier work this paper cites.
Linear convergence with condition number independent access of full gradients
Lijun Zhang, Mehrdad Mahdavi, and Rong Jin · 2013
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Cited alongside, same era.
Saga: A fast incremental gradient method with support for non-strongly convex composite objectives
Aaron Defazio, Francis Bach, and Simon Lacoste-Julien · 2014
Cited alongside, same era.
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
Shai Shalev-Shwartz and Tong Zhang · 2014
Cited alongside, same era.
A stochastic forward-backward splitting method for solving monotone inclusions in hilbert spaces
Lorenzo Rosasco, Silvia Villa, and Bang Công Vũ · 2014
Cited alongside, same era.
Policy evaluation with temporal differences: A survey and comparison
Christoph Dann, Gerhard Neumann, and Jan Peters · 2014
Cited alongside, same era.
Stochastic primal-dual coordinate method for regularized empirical risk minimization
Yuchen Zhang and Lin Xiao · 2017
Later among the works it cites.
Doubly greedy primal-dual coordinate descent for sparse empirical risk minimization
Qi Lei, Ian EH Yen, Chao-yuan Wu, Inderjit S Dhillon, and Pradeep Ravikumar · 2017
Later among the works it cites.
Exploiting strong convexity from data with primal-dual first-order algorithms
Jialei Wang and Lin Xiao · 2017
Later among the works it cites.
Stochastic variance reduction methods for policy evaluation
Simon S Du, Jianshu Chen, Lihong Li, Lin Xiao, and Dengyong Zhou · 2017
Later among the works it cites.
Minimizing finite sums with the stochastic average gradient
Mark Schmidt, Nicolas Le Roux, and Francis Bach · 2017
Later among the works it cites.
Katyusha: The first direct acceleration of stochastic gradient methods
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Adaptive stochastic primal-dual coordinate descent for separable saddle point problems
Zhanxing Zhu and Amos J Storkey · 2015
Cited alongside, same era.
A universal catalyst for first-order optimization
Hongzhou Lin, Julien Mairal, and Zaid Harchaoui · 2015
Cited alongside, same era.
Human-level control through deep reinforcement learning
Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A Rusu, Joel Veness, Marc G Bellemare, Alex Graves, Martin Riedmiller, Andreas K Fidjeland, Georg Ostrovski, Stig Petersen, Charles Beatti, Amir Sadik, Ioannis Antonoglou, Helen King, Dharshan Kumaran, Daan Wierstra, Shane Legg, and Demis Hassabis · 2015
Cited alongside, same era.
A simple practical accelerated method for finite sums
Aaron Defazio · 2016
Cited alongside, same era.
Stochastic variance reduction methods for saddle-point problems
Palaniappan Balamurugan and Francis Bach · 2016
Cited alongside, same era.
Openai gym, 2016
Greg Brockman, Vicki Cheung, Ludwig Pettersson, Jonas Schneider, John Schulman, Jie Tang, and Wojciech Zaremba · 2016
Cited alongside, same era.
Tight complexity bounds for optimizing composite objectives
Blake E Woodworth and Nati Srebro · 2016
Cited alongside, same era.
Zeyuan Allen-Zhu · 2017
Later among the works it cites.
An optimal randomized incremental gradient method
Guanghui Lan and Yi Zhou · 2018
Later among the works it cites.
Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
Yuyuan Ouyang and Yangyang Xu · 2018
Later among the works it cites.
Stochastic quasi-gradient methods: Variance reduction via Jacobian sketching
Robert M Gower, Peter Richtárik, and Francis Bach · 2018
Later among the works it cites.
Dscovr: Randomized primal-dual block coordinate algorithms for asynchronous distributed optimization
Lin Xiao, Adams Wei Yu, Qihang Lin, and Weizhu Chen · 2019
Closest in time.
Xu Qian, Zheng Qu, and Peter Richtárik · 2019
Closest in time.
Local saddle point optimization: A curvature exploitation approach
Leonard Adolphs, Hadi Daneshmand, Aurelien Lucchi, and Thomas Hofmann · 2019
Closest in time.