Fetching the paper…
Reading the bibliography…
We propose stochastic variance reduced algorithms for solving convex-concave saddle point problems, monotone variational inequalities, and monotone inclusions.
“ A convergence theorem for non negative almost supermartingales and some applications ”
Herbert Robbins and David Siegmund · 1971
Earlier work this paper cites.
“The extragradient method for finding saddle points and other problems”
Galina. Korpelevich · 1976
Earlier work this paper cites.
“ A modification of the Arrow-Hurwicz method for search of saddle points ”
Leonid. Popov · 1980
Earlier work this paper cites.
“ Variance-reduced methods for machine learning ”
Robert Gower, Mark Schmidt, Francis Bach and Peter Richtarik · 1983
Earlier work this paper cites.
“ A sublinear-time randomized approximation algorithm for matrix games ”
Michael Grigoriadis and Leonid Khachiyan · 1995
Earlier work this paper cites.
“ A modified forward-backward splitting method for maximal monotone mappings ”
Paul Tseng · 2000
Earlier work this paper cites.
“ Prox-method with rate of convergence O ( 1 / t ) 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.
“ Smooth minimization of non-smooth functions ”
Yurii Nesterov · 2005
Earlier work this paper cites.
“ Finite-dimensional variational inequalities and complementarity problems ”
Francisco Facchinei and Jong-Shi Pang · 2007
Earlier work this paper cites.
“ Dual extrapolation and its applications to solving variational inequalities and related problems ”
Yurii Nesterov · 2007
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 general framework for a class of first order primal-dual algorithms for convex optimization in imaging science ”
Ernie Esser, Xiaoqun Zhang and Tony Chan · 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.
“ Sublinear optimization for machine learning ”
Kenneth Clarkson, Elad Hazan and David Woodruff · 2012
Earlier work this paper cites.
“ Accelerating stochastic gradient descent using predictive variance reduction ”
Rie Johnson and Tong Zhang · 2013
Earlier work this paper cites.
“ Mini-Course on Convex Programming Algorithms ”, Lecture notes, 2013
Arkadi Nemirovski · 2013
Earlier work this paper cites.
“ On first order algorithms for ℓ 1 \ell_{1} /nuclear norm minimization ”
Yurii Nesterov and Arkadi Nemirovski · 2013
Cited alongside, same era.
“ Online learning with predictable sequences ”
Alexander Rakhlin and Karthik Sridharan · 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.
“ Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping ”
Patrick Combettes and Jean-Christophe Pesquet · 2015
Cited alongside, same era.
“ Variance reduced stochastic gradient descent with neighbors ”
Thomas Hofmann, Aurelien Lucchi, Simon Lacoste-Julien and Brian McWilliams · 2015
Cited alongside, same era.
“ Projected reflected gradient methods for monotone variational inequalities ”
“ Reducing noise in GAN training with variance reduced extragradient ”
Tatjana Chavdarova, Gauthier Gidel, François Fleuret and Simon Lacoste-Julien · 2019
Later among the works it cites.
“ A Variational Inequality Perspective on Generative Adversarial Networks ”
Gauthier Gidel, Hugo Berard, Gaëtan Vignoud, Pascal Vincent and Simon Lacoste-Julien · 2019
Later among the works it cites.
“ Optimistic mirror descent in saddle-point problems: Going the extra(-gradient) mile ”
Panayotis Mertikopoulos, Bruno Lecouat, Houssam Zenati, Chuan-Sheng Foo, Vijay Chandrasekhar and Georgios Piliouras · 2019
Later among the works it cites.
“ Two steps at a time – taking GAN training in stride with Tseng’s method ”
Axel Böhm, Michael Sedlmayer, Ernö Csetnek and Radu Boţ · 2020
Later among the works it cites.
“ Coordinate methods for matrix games ”
Yair Carmon, Yujia Jin, Aaron Sidford and Kevin Tian · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Yura Malitsky · 2015
Cited alongside, same era.
“ Improved SVRG for non-strongly-convex or sum-of-non-convex objectives ”
Zeyuan Allen-Zhu and Yang Yuan · 2016
Cited alongside, same era.
“ Stochastic variance reduction methods for saddle-point problems ”
Palaniappan Balamurugan and Francis Bach · 2016
Cited alongside, same era.
“ Fast projection onto the simplex and the ℓ 1 \ell_{1} ball ”
Laurent Condat · 2016
Cited alongside, same era.
“ Stochastic variance reduction for nonconvex optimization ”
Sashank Reddi, Ahmed Hefny, Suvrit Sra, Barnabas Poczos and Alex Smola · 2016
Cited alongside, same era.
“ Tight complexity bounds for optimizing composite objectives ”
Blake Woodworth and Nathan Srebro · 2016
Cited alongside, same era.
“ Katyusha: The first direct acceleration of stochastic gradient methods ”
Zeyuan Allen-Zhu · 2017
Cited alongside, same era.
“ Last iterate is slower than averaged iterate in smooth convex-concave saddle point problems ”
Noah Golowich, Sarath Pattathil, Constantinos Daskalakis and Asuman Ozdaglar · 2020
Later among the works it cites.
“ Don’t Jump Through Hoops and Remove Those Loops: SVRG and Katyusha are Better Without the Outer Loop ”
Dmitry Kovalev, Samuel Horvath and Peter Richtárik · 2020
Later among the works it cites.
“ A forward-backward splitting method for monotone inclusions without cocoercivity ”
Yura Malitsky and Matthew Tam · 2020
Later among the works it cites.
“ Revisiting stochastic extragradient ”
Konstantin Mishchenko, Dmitry Kovalev, Egor Shulgin, Peter Richtárik and Yura Malitsky · 2020
Later among the works it cites.
“ Forward-reflected-backward method with variance reduction ”
Ahmet Alacaoglu, Yura Malitsky and Volkan Cevher · 2021
Closest in time.
“ Minibatch forward-backward-forward methods for solving stochastic variational inequalities ”
Radu Boţ, Panayotis Mertikopoulos, Mathias Staudigl and Phan Vuong · 2021
Closest in time.
“ On the analysis of variance-reduced and randomized projection variants of single projection schemes for monotone stochastic variational inequality problems ”
Shisheng Cui and Uday Shanbhag · 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.
“ Stochastic extragradient: General analysis and improved rates ”
Eduard Gorbunov, Hugo Berard, Gauthier Gidel and Nicolas Loizou · 2022
Closest in time.
Hui Zhang · 2022
Closest in time.