An adaptive stochastic gradient method with variance reduction for smooth optimization problems
From MaRDI portal
Cites work
- A line search based proximal stochastic gradient algorithm with dynamical variance reduction
- A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems
- A proximal stochastic gradient method with progressive variance reduction
- A Stochastic Approximation Method
- A stochastic gradient method with variance control and variable learning rate for deep learning
- Adaptive subgradient methods for online learning and stochastic optimization
- Deep learning
- First-order methods in optimization
- Gradient methods with adaptive step-sizes
- scientific article; zbMATH DE number 1869443 (Why is no real title available?)
- Importance sampling in stochastic optimization: an application to intertemporal portfolio choice
- Performance analysis of stochastic gradient algorithms under weak conditions
- Stabilized Barzilai-Borwein method
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic nested variance reduction for nonconvex optimization
- The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth
- Two-Point Step Size Gradient Methods
This page was built for publication: An adaptive stochastic gradient method with variance reduction for smooth optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7257138)