Fetching the paper…
Reading the bibliography…
We consider minimization of stochastic functionals that are compositions of a (potentially) non-smooth convex function $h$ and smooth function $c$ and, more generally, stochastic weakly-convex functionals.
A function not constant on a connected set of critical points
H. Whitney · 1935
Earlier work this paper cites.
On the stochastic quasi-gradient method and stochastic quasi-Feyer sequences
Y. M. Ermoliev · 1969
Earlier work this paper cites.
Measurable dependence of convex sets and functions on parameters
R. T. Rockafellar · 1969
Earlier work this paper cites.
A convergence theorem for non-negative almost supermartingales and some applications
H. Robbins and D. Siegmund · 1971
Earlier work this paper cites.
Stochastic optimization problems with nondifferentiable cost functionals
D. P. Bertsekas · 1973
Earlier work this paper cites.
Monotone operators and the proximal point algorithm
R. T. Rockafellar · 1976
Earlier work this paper cites.
Analysis of recursive stochastic algorithms
L. Ljung · 1977
Earlier work this paper cites.
Stokhasticheskie Methody Resheniya Negladkikh Ekstremal’nykh Zadach (Stochastic Methods for Solving Nonsmooth Extremal Problems)
A. M. Gupal · 1979
Earlier work this paper cites.
First and second order conditions for a class of nondifferentiable optimization problems
R. Fletcher and G. A. Watson · 1980
Earlier work this paper cites.
A model algorithm for composite nondifferentiable optimization problems
R. Fletcher · 1982
Earlier work this paper cites.
Differential Inclusions: Set-Valued Maps and Viability Theory
J.-P. Aubin and A. Cellina · 1984
Earlier work this paper cites.
Descent methods for composite nondifferentiable optimization problems
J. Burke · 1985
Earlier work this paper cites.
Some properties of the generalized gradient method
P. A. Dorofeyev · 1985
Earlier work this paper cites.
A linearization method for nonsmooth stochastic programming problems
A. Ruszczyński · 1987
Earlier work this paper cites.
Convex Analysis and Minimization Algorithms I & II
J. Hiriart-Urruty and C. Lemaréchal · 1993
Earlier work this paper cites.
Prox-regular functions in variational analysis
R. Poliquin and R. T. Rockafellar · 1996
Earlier work this paper cites.
Regression shrinkage and selection via the lasso
R. Tibshirani · 1996
Earlier work this paper cites.
Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization
Y. M. Ermoliev and V. Norkin · 1998
Earlier work this paper cites.
Variational Analysis
R. T. Rockafellar and R. J. B. Wets · 1998
Cited alongside, same era.
Trust Region Methods
A. R. Conn, N. I. M. Gould, and P. L. Toint · 2000
Cited alongside, same era.
Non-Smooth Dynamical Systems
M. Kunze · 2000
Cited alongside, same era.
Solution of nonconvex nonsmooth stochastic optimization problems
Y. M. Ermoliev and V. Norkin · 2003
Cited alongside, same era.
Stochastic Approximation and Recursive Algorithms and Applications
H. J. Kushner and G. Yin · 2003
Cited alongside, same era.
Introductory Lectures on Convex Optimization
Y. Nesterov · 2004
Cited alongside, same era.
Stochastic approximations and differential inclusions
Convex optimization in Julia
M. Udell, K. Mohan, D. Zeng, J. Hong, S. Diamond, and S. Boyd · 2014
Later among the works it cites.
Phase retrieval via Wirtinger flow: Theory and algorithms
E. J. Candès, X. Li, and M. Soltanolkotabi · 2015
Later among the works it cites.
Solving random quadratic systems of equations is nearly as easy as solving linear systems
Y. Chen and E. Candès · 2015
Later among the works it cites.
Phase retrieval with application to optical imaging
Y. Schechtman, Y. C. Eldar, O. Cohen, H. N. Chapman, J. Miao, and M. Segev · 2015
Later among the works it cites.
Lecture notes on probability theory: Stanford statistics 310
A. Dembo · 2016
Later among the works it cites.
Efficiency of minimizing compositions of convex functions and smooth maps
D. Drusvyatskiy and C. Paquette · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Benaïm, J. Hofbauer, and S. Sorin · 2005
Cited alongside, same era.
Numerical Optimization
J. Nocedal and S. J. Wright · 2006
Cited alongside, same era.
Clarke subgradients of stratifiable functions
J. Bolte, A. Daniilidis, A. S. Lewis, and M. Shiota · 2007
Cited alongside, same era.
Stochastic Approximation
V. Borkar · 2008
Cited alongside, same era.
Critical values of set-valued maps with stratifiable graphs. extensions of Sard and Smale-Sard theorems
A. D. Ioffe · 2008
Cited alongside, same era.
A proximal method for composite minimization
A. S. Lewis and S. J. Wright · 2008
Cited alongside, same era.
Later among the works it cites.
Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
D. Drusvyatskiy, A. Ioffe, and A. Lewis · 2016
Later among the works it cites.
Accelerating stochastic composition optimization
M. Wang, J. Liu, and E. Fang · 2016
Later among the works it cites.
A variational perspective on accelerated methods in optimization
A. Wibisono, A. Wilson, and M. I. Jordan · 2016
Later among the works it cites.
Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
D. Davis and B. Grimmer · 2017
Closest in time.
Stochastic methods for composite and weakly convex optimization problems
J. C. Duchi and F. Ruan · 2017
Closest in time.
Identity matters in deep learning
M. Hardt and T. Ma · 2017
Closest in time.
Variational Analysis of Regular Mappings
A. D. Ioffe · 2017
Closest in time.
Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
M. Wang, E. Fang, and H. Liu · 2017
Closest in time.
Stochastic subgradient method converges on tame functions
D. Davis, D. Drusvyatskiy, S. Kakade, and J. D. Lee · 2018
Closest in time.
The proximal point method revisited
D. Drusvyatskiy · 2018
Closest in time.
Error bounds, quadratic growth, and linear convergence of proximal methods
D. Drusvyatskiy and A. Lewis · 2018
Closest in time.
Solving (most) of a set of quadratic equalities: Composite optimization for robust phase retrieval
J. C. Duchi and F. Ruan · 2018
Closest in time.