Fetching the paper…
Reading the bibliography…
We develop a novel and single-loop variance-reduced algorithm to solve a class of stochastic nonconvex-convex minimax problems involving a nonconvex-linear objective function, which has various applications in different fields such as machine learning and robust optimization.
An extragradient method for finding saddle-points and for other problems
G. M. Korpelevic · 1976
Earlier work this paper cites.
Minimax analysis of stochastic problems
A. Shapiro and A. Kleywegt · 2002
Earlier work this paper cites.
Finite-dimensional variational inequalities and complementarity problems
F. Facchinei and J.-S. Pang · 2003
Earlier work this paper cites.
Prox-method with rate of convergence 𝒪 ( 1 / t ) \mathcal{O}(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems
A. Nemirovskii · 2004
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Y. Nesterov · 2005
Earlier work this paper cites.
Modified Gauss-Newton scheme with worst case guarantees for global performance
Y. Nesterov · 2007
Earlier work this paper cites.
On accelerated proximal gradient methods for convex-concave optimization
P. Tseng · 2008
Earlier work this paper cites.
Robust optimization
A. Ben-Tal, L. El Ghaoui, and A. Nemirovski · 2009
Earlier work this paper cites.
From convex to nonconvex: a loss function analysis for binary classification
L. Zhao, M. Mammadov, and J. Yearwood · 2010
Earlier work this paper cites.
A first-order primal-dual algorithm for convex problems with applications to imaging
A. Chambolle and T. Pock · 2011
Earlier work this paper cites.
LIBSVM: A library for Support Vector Machines
C.-C. Chang and C.-J. Lin · 2011
Earlier work this paper cites.
Proximal methods for minimizing the sum of a convex function and a composite function
Q. Tran-Dinh and M. Diehl · 2011
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
R. Johnson and T. Zhang · 2013
Earlier work this paper cites.
Generative adversarial nets
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio · 2014
Earlier work this paper cites.
Accelerated gradient methods for nonconvex nonlinear and stochastic programming
S. Ghadimi and G. Lan · 2016
Earlier work this paper cites.
A proximal method for composite minimization
A. S. Lewis and S. J. Wright · 2016
Cited alongside, same era.
Convex analysis and monotone operators theory in Hilbert spaces
H. H. Bauschke and P. Combettes · 2017
Cited alongside, same era.
Finite-sum composition optimization via variance reduced gradient descent
X. Lian, M. Wang, and J. Liu · 2017
Cited alongside, same era.
Variance reduced methods for non-convex composition optimization
L. Liu, J. Liu, and D. Tao · 2017
Cited alongside, same era.
SARAH: A novel method for machine learning problems using stochastic recursive gradient
L. M. Nguyen, J. Liu, K. Scheinberg, and M. Takáč · 2017
Cited alongside, same era.
Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
Efficient algorithms for smooth minimax optimization
K. K. Thekumparampil, P. Jain, P. Netrapalli, and S. Oh · 2019
Later among the works it cites.
Katyusha acceleration for convex finite-sum compositional optimization
Y. Xu and Y. Xu · 2019
Later among the works it cites.
Multilevel stochastic gradient methods for nested composition optimization
S. Yang, M. Wang, and E. X. Fang · 2019
Later among the works it cites.
Multi-level composite stochastic optimization via nested variance reduction
J. Zhang and L. Xiao · 2019
Later among the works it cites.
A stochastic composite gradient method with incremental variance reduction
J. Zhang and L. Xiao · 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…
M. Wang, E. Fang, and L. Liu · 2017
Cited alongside, same era.
Accelerating stochastic composition optimization
M. Wang, J. Liu, and E. X. Fang · 2017
Cited alongside, same era.
Fast stochastic variance reduced admm for stochastic composition optimization
Y. Yu and L. Huang · 2017
Cited alongside, same era.
Stochastic methods for composite and weakly convex optimization problems
J. Duchi and F. Ruan · 2018
Cited alongside, same era.
Solving weakly-convex-weakly-concave saddle-point problems as weakly-monotone variational inequality
Q. Lin, M. Liu, H. Rafique, and T. Yang · 2018
Cited alongside, same era.
Lower bounds for non-convex stochastic optimization
Y. Arjevani, Y. Carmon, J. C. Duchi, D. J. Foster, N. Srebro, and B. Woodworth · 2019
Cited alongside, same era.
Momentum-based variance reduction in non-convex SGD
A. Cutkosky and F. Orabona · 2019
Cited alongside, same era.
T. Lin, C. Jin, and M. I. Jordan · 2020
Closest in time.
Stochastic hamiltonian gradient methods for smooth games
N. Loizou, H. Berard, A. Jolicoeur-Martineau, P. Vincent, S. Lacoste-Julien, and I. Mitliagkas · 2020
Closest in time.
L. Luo, H. Ye, and T. Zhang · 2020
Closest in time.
Efficient search of first-order nash equilibria in nonconvex-concave smooth min-max problems
D. M. Ostrovskii, A. Lowy, and M. Razaviyayn · 2020
Closest in time.
ProxSARAH: An efficient algorithmic framework for stochastic composite nonconvex optimization
H. N. Pham, M. L. Nguyen, T. D. Phan, and Q. Tran-Dinh · 2020
Closest in time.
Stochastic Gauss-Newton algorithms for nonconvex compositional optimization
Q. Tran-Dinh, N. H. Pham, and L. M. Nguyen · 2020
Closest in time.
A hybrid stochastic optimization framework for stochastic composite nonconvex optimization
Q. Tran-Dinh, N. H. Pham, D. T. Phan, and L. M. Nguyen · 2020
Closest in time.
J. Yang, N. Kiyavash, and N. He · 2020
Closest in time.
Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization
J. Zhang and L. Xiao · 2020
Closest in time.