Stochastic Multilevel Composition Optimization Algorithms with Level-Independent Convergence Rates
DOI10.1137/21M1406222zbMath1491.90155arXiv2008.10526OpenAlexW3080245286MaRDI QIDQ5072589
Krishnakumar Balasubramanian, Anthony G. Nguyen, Saeed Ghadimi
Publication date: 29 April 2022
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.10526
nonconvex optimizationcomplexity boundslevel-independent convergence ratemultilevel stochastic composition
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Stochastic programming (90C15) Numerical methods based on nonlinear programming (49M37)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Gradient methods for minimizing composite functions
- Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
- Introductory lectures on convex optimization. A basic course.
- Bridging the gap between constant step size stochastic gradient descent and Markov chains
- Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization
- Statistical estimation of composite risk functionals and risk optimization problems
- A Linearization Method for Nonsmooth Stochastic Programming Problems
- Acceleration of Stochastic Approximation by Averaging
- Semiparametric Regression
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- Stochastic Model-Based Minimization of Weakly Convex Functions
- Multilevel Stochastic Gradient Methods for Nested Composition Optimization
- Accelerating Stochastic Composition Optimization
- MultiLevel Composite Stochastic Optimization via Nested Variance Reduction
- A Stochastic Subgradient Method for Nonsmooth Nonconvex Multilevel Composition Optimization
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
- A Single Timescale Stochastic Approximation Method for Nested Stochastic Optimization
- Optimization of Convex Risk Functions
- Sample Average Approximation Method for Compound Stochastic Optimization Problems
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- A Stochastic Approximation Method
- Solving Stochastic Compositional Optimization is Nearly as Easy as Solving Stochastic Optimization
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
This page was built for publication: Stochastic Multilevel Composition Optimization Algorithms with Level-Independent Convergence Rates