Solving Stochastic Compositional Optimization is Nearly as Easy as Solving Stochastic Optimization
From MaRDI portal
Cited in
(15)- Stochastic multilevel composition optimization algorithms with level-independent convergence rates
- Numerical methods for distributed stochastic compositional optimization problems with aggregative structure
- Accelerating Stochastic Composition Optimization
- Optimal large-scale stochastic optimization of NDCG surrogates for deep learning
- Hybrid SGD algorithms to solve stochastic composite optimization problems with application in sparse portfolio selection problems
- Distributed stochastic compositional optimization problems over directed networks
- Learning with Limited Samples: Meta-Learning and Applications to Communication Systems
- Model-agnostic Hessian-free meta-policy optimization via zeroth-order estimation: a linear quadratic regulator perspective
- Stochastic nested primal-dual method for nonconvex constrained composition optimization
- A Two-Time-Scale Stochastic Optimization Framework with Applications in Control and Reinforcement Learning
- Probability maximization via Minkowski functionals: convex representations and tractable resolution
- Riemannian gradient methods for stochastic composition problems
- An Improved Unconstrained Approach for Bilevel Optimization
- The million-variable ``march for stochastic combinatorial optimization
- Stochastic composition optimization of functions without Lipschitz continuous gradient
This page was built for publication: Solving Stochastic Compositional Optimization is Nearly as Easy as Solving Stochastic Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5868746)
