Fetching the paper…
Reading the bibliography…
We consider the problem of minimizing the composition of a smooth (nonconvex) function and a smooth vector mapping, where the inner mapping is in the form of an expectation over some random variable or a finite sum.
Convex Analysis
R. Tyrrell Rockafellar · 1970
Earlier work this paper cites.
Fast incremental method for smooth nonconvex optimization
Sashank J Reddi, Suvrit Sra, Barnabás Póczos, and Alex Smola · 1977
Earlier work this paper cites.
Reinforcement Learning: An Introduction
Richard S Sutton and Andrew G Barto · 1998
Earlier work this paper cites.
Coherent approaches to risk in optimization under uncertainty
R. Tyrrell Rockafellar · 2007
Earlier work this paper cites.
Stochastic first- and zeroth-order methods for nonconvex stochastic programming
Saeed Ghadimi and Guanghui Lan · 2013
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Earlier work this paper cites.
Gradient methods for minimizing composite functions
Yurii Nesterov · 2013
Earlier work this paper cites.
Advances in risk-averse optimization
Andrzej Ruszczyński · 2013
Earlier work this paper cites.
Policy evaluation with temporal differences: a survey and comparison
Christoph Dann, Gerhard Neumann, and Jan Peters · 2014
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.
A proximal stochastic gradient method with progressive variance reduction
Lin Xiao and Tong Zhang · 2014
Earlier work this paper cites.
On the link between gaussian homotopy continuation and convex envelopes
Hossein Mobahi and John W Fisher · 2015
Cited alongside, same era.
Variance reduction for faster non-convex optimization
Zeyuan Allen-Zhu and Elad Hazan · 2016
Cited alongside, same era.
Entropy-sgd: Biasing gradient descent into wide valleys
Pratik Chaudhari, Anna Choromanska, Stefano Soatto, Yann LeCun, Carlo Baldassi, Christian Borgs, Jennifer Chayes, Levent Sagun, and Riccardo Zecchina · 2016
Cited alongside, same era.
Caglar Gulcehre, Marcin Moczulski, Francesco Visin, and Yoshua Bengio · 2016
Cited alongside, same era.
On graduated optimization for stochastic non-convex problems
Elad Hazan, Kfir Yehuda Levy, and Shai Shalev-Shwartz · 2016
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
Later among the works it cites.
Natasha 2: Faster non-convex optimization than SGD
Zeyuan Allen-Zhu · 2018
Later among the works it cites.
Spider: Near-optimal non-convex optimization via stochastic path-integrated differential estimator
Cong Fang, Chris Junchi Li, Zhouchen Lin, and Tong Zhang · 2018
Later among the works it cites.
Accelerated method for stochastic composition optimization with nonsmooth regularization
Zhouyuan Huo, Bin Gu, Ji Jiu, and Heng Huang · 2018
Later among the works it cites.
A simple proximal stochastic gradient method for nonsmooth nonconvex optimization
Zhize Li and Jian Li · 2018
Later among the works it cites.
SpiderBoost: A class of faster variance-reduced algorithms for nonconvex optimization
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Linear convergence of gradient method and proximal-gradient methods under the Polyak-Łojasiewicz condition
Hamed Karimi, Julie Nutini, and Mark Schmidt · 2016
Cited alongside, same era.
Natasha: Faster non-convex stochastic optimization via strongly non-convex parameter
Zeyuan Allen-Zhu · 2017
Cited alongside, same era.
First-Order Methods in Optimization
Amir Beck · 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.
Finite-sum composition optimization via variance reduced gradient descent
Xiangru Lian, Mengdi Wang, and Ji Liu · 2017
Cited alongside, same era.
Stochastic variance reduction for nonconvex optimization
Sashank J. Reddi, Ahmed Hefny, Suvrit Sra, Barnabas Poczos, and Alex Smola
Cited in the paper.
Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization
Sashank J Reddi, Suvrit Sra, Barnabás Póczos, and Alexander J Smola
Cited in the paper.
Zhe Wang, Kaiyi Ji, Yi Zhou, Yingbin Liang, and Vahid Tarokh · 2018
Later among the works it cites.
Stochastic nested variance reduced gradient descent for nonconvex optimization
Dongruo Zhou, Pan Xu, and Quanquan Gu · 2018
Later among the works it cites.
Finite-sum smooth optimization with sarah
Lam M. Nguyen, Marten van Dijk, Dzung T. Phan, Phuong Ha Nguyen, Tsui-Wei Weng, and Jayant R. Kalagnanam · 2019
Closest in time.
ProxSARAH: An efficient algorithmic framework for stochastic composite nonconvex optimization
Nhan H. Pham, Lam M. Nguyen, Dzung T. Phan, and Quoc Tran-Dinh · 2019
Closest in time.
A composite randomized incremental gradient method
Junyu Zhang and Lin Xiao · 2019
Closest in time.