Distributed stochastic compositional optimization problems over directed networks
From MaRDI portal
Publication:6179879
DOI10.1007/s10589-023-00512-0arXiv2203.11074OpenAlexW4385516224MaRDI QIDQ6179879
Publication date: 18 January 2024
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.11074
asymptotic normalitygradient trackingdirected communication networksdistributed stochastic compositional optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
- Fully asynchronous policy evaluation in distributed reinforcement learning over networks
- Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization
- Statistical estimation of composite risk functionals and risk optimization problems
- Non-negative matrices and Markov chains.
- Acceleration of Stochastic Approximation by Averaging
- Asymptotic Properties of Primal-Dual Algorithm for Distributed Stochastic Optimization over Random Networks with Imperfect Communications
- Multilevel Stochastic Gradient Methods for Nested Composition Optimization
- Harnessing Smoothness to Accelerate Distributed Optimization
- Accelerating Stochastic Composition Optimization
- MultiLevel Composite Stochastic Optimization via Nested Variance Reduction
- A Stochastic Subgradient Method for Nonsmooth Nonconvex Multilevel Composition Optimization
- Stochastic Multilevel Composition Optimization Algorithms with Level-Independent Convergence Rates
- Sample Complexity of Sample Average Approximation for Conditional Stochastic Optimization
- A Single Timescale Stochastic Approximation Method for Nested Stochastic Optimization
- Performance of a Distributed Stochastic Approximation Algorithm
- Sample Average Approximation Method for Compound Stochastic Optimization Problems
- On Asymptotic Normality in Stochastic Approximation
- On a Stochastic Approximation Method
- Push–Pull Gradient Methods for Distributed Optimization in Networks
- Solving Stochastic Compositional Optimization is Nearly as Easy as Solving Stochastic Optimization
- A Two-Timescale Stochastic Algorithm Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Critic
This page was built for publication: Distributed stochastic compositional optimization problems over directed networks