Fetching the paper…
Reading the bibliography…
We study stochastic monotone inclusion problems, which widely appear in machine learning applications, including robust regression and adversarial learning.
Monotone (nonlinear) operators in Hilbert space
George J Minty · 1962
Earlier work this paper cites.
Formes bilineaires coercitives sur les ensembles convexes
Guido Stampacchia · 1964
Earlier work this paper cites.
Fixed points of nonexpanding maps
Benjamin Halpern · 1967
Earlier work this paper cites.
Monotone operators associated with saddle-functions and minimax problems
R Tyrrell Rockafellar · 1970
Earlier work this paper cites.
Monotone operators and the proximal point algorithm
R Tyrrell Rockafellar · 1976
Earlier work this paper cites.
Extragradient method for finding saddle points and other problems
GM Korpelevich · 1977
Earlier work this paper cites.
A modification of the Arrow-Hurwicz method for search of saddle points
L. D. Popov · 1980
Earlier work this paper cites.
Approximation of fixed points of nonexpansive mappings
Rainer Wittmann · 1992
Earlier work this paper cites.
Robust solutions to least-squares problems with uncertain data
Laurent El Ghaoui and Hervé Lebret · 1997
Earlier work this paper cites.
Error bounds in mathematical programming
Jong-Shi Pang · 1997
Earlier work this paper cites.
Finite-dimensional variational inequalities and complementarity problems
Francisco Facchinei and Jong-Shi Pang · 2003
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.
Rates of asymptotic regularity for Halpern iterations of nonexpansive mappings
Laurentiu Leustean · 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.
On quantitative versions of theorems due to F.E. Browder and R. Wittmann
Ulrich Kohlenbach · 2011
Earlier work this paper cites.
Effective metastability of Halpern iterates in CAT(0) spaces
Ulrich Kohlenbach and Laurenţiu Leuştean · 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.
SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives
Aaron Defazio, Francis Bach, and Simon Lacoste-Julien · 2014
Earlier work this paper cites.
Accelerated gradient methods for nonconvex nonlinear and stochastic programming
Saeed Ghadimi and Guanghui Lan · 2016
Cited alongside, same era.
Stochastic variance reduction methods for saddle-point problems
Balamurugan Palaniappan and Francis Bach · 2016
Cited alongside, same era.
Stochastic variance reduction for nonconvex optimization
Sashank J Reddi, Ahmed Hefny, Suvrit Sra, Barnabas Poczos, and Alex Smola · 2016
Cited alongside, same era.
Katyusha: The first direct acceleration of stochastic gradient methods
Zeyuan Allen-Zhu · 2017
Cited alongside, same era.
First-order methods in optimization , volume 25
Amir Beck · 2017
Cited alongside, same era.
UCI Machine Learning Repository, 2017
Dheeru Dua and Casey Graff · 2017
Cited alongside, same era.
Second-order information in non-convex stochastic optimization: Power and limitations
Yossi Arjevani, Yair Carmon, John C Duchi, Dylan J Foster, Ayush Sekhari, and Karthik Sridharan · 2020
Later among the works it cites.
Halpern iteration for near-optimal and parameter-free monotone inclusion and strong solutions to variational inequalities
Jelena Diakonikolas · 2020
Later among the works it cites.
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.
Sharpness, restart, and acceleration
Vincent Roulet and Alexandre d’Aspremont · 2020
Later among the works it cites.
Variance reduction via accelerated dual averaging for finite-sum optimization
Chaobing Song, Yong Jiang, and Yi Ma · 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…
Extragradient method with variance reduction for stochastic variational inequalities
Alfredo N Iusem, Alejandro Jofré, Roberto Imbuzeiro Oliveira, and Philip Thompson · 2017
Cited alongside, same era.
Non-convex finite-sum optimization via SCSG methods
Lihua Lei, Cheng Ju, Jianbo Chen, and Michael I Jordan · 2017
Cited alongside, same era.
SARAH: A novel method for machine learning problems using stochastic recursive gradient
Lam M Nguyen, Jie Liu, Katya Scheinberg, and Martin Takáč · 2017
Cited alongside, same era.
A first order method for solving convex bilevel optimization problems
Shoham Sabach and Shimrit Shtern · 2017
Cited alongside, same era.
Minimizing finite sums with the stochastic average gradient
Mark Schmidt, Nicolas Le Roux, and Francis Bach · 2017
Cited alongside, same era.
Spider: Near-optimal non-convex optimization via stochastic path-integrated differential estimator
Cong Fang, Chris Junchi Li, Zhouchen Lin, and Tong Zhang · 2018
Cited alongside, same era.
Juan Pablo Contreras and Roberto Cominetti · 2021
Later among the works it cites.
Efficient methods for structured nonconvex-nonconcave min-max optimization
Jelena Diakonikolas, Constantinos Daskalakis, and Michael Jordan · 2021
Later among the works it cites.
Fast extra gradient methods for smooth structured nonconvex-nonconcave minimax problems
Sucheol Lee and Donghwan Kim · 2021
Later among the works it cites.
PAGE: A simple and optimal probabilistic gradient estimator for nonconvex optimization
Zhize Li, Hongyan Bao, Xiangliang Zhang, and Peter Richtárik · 2021
Later among the works it cites.
On the convergence rate of the Halpern-iteration
Felix Lieder · 2021
Later among the works it cites.
Stochastic gradient descent-ascent and consensus optimization for smooth games: Convergence analysis under expected co-coercivity
Nicolas Loizou, Hugo Berard, Gauthier Gidel, Ioannis Mitliagkas, and Simon Lacoste-Julien · 2021
Later among the works it cites.
Halpern-type accelerated and splitting algorithms for monotone inclusions
Quoc Tran-Dinh and Yang Luo · 2021
Later among the works it cites.
Accelerated algorithms for smooth convex-concave minimax problems with O ( 1 / k 2 ) O(1/k^{2}) rate on squared gradient norm
Taeho Yoon and Ernest K Ryu · 2021
Later among the works it cites.
Stochastic variance reduction for variational inequality methods
Ahmet Alacaoglu and Yura Malitsky · 2022
Closest in time.
Near-optimal algorithms for making the gradient small in stochastic minimax optimization
Lesi Chen and Luo Luo · 2022
Closest in time.
On modified Halpern and Tikhonov-Mann iterations
Horatiu Cheval, Ulrich Kohlenbach, and Laurentiu Leustean · 2022
Closest in time.
Potential function-based framework for minimizing gradients in convex and min-max optimization
Jelena Diakonikolas and Puqian Wang · 2022
Closest in time.