Online distributed optimization with stochastic gradients: high probability bound of regrets
From MaRDI portal
Cites work
- Convergence in high probability of distributed stochastic gradient descent algorithms
- Distributed Continuous-Time Convex Optimization With Time-Varying Cost Functions
- Distributed Mirror Descent for Online Composite Optimization
- Distributed Online Convex Optimization on Time-Varying Directed Graphs
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Distributed online optimization in time-varying unbalanced networks without explicit subgradients
- Distributed Optimization Over Time-Varying Directed Graphs
- Distributed optimization-based control of multi-agent networks in complex environments
- Distributed Subgradient Methods for Multi-Agent Optimization
- Gradient-Tracking-Based Distributed Optimization With Guaranteed Optimality Under Noisy Information Sharing
- Matrix Analysis
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Online Distributed Convex Optimization on Dynamic Networks
- Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
- Online Learning Over Dynamic Graphs via Distributed Proximal Gradient Algorithm
- Randomized Gradient-Free Distributed Online Optimization via a Dynamic Regret Analysis
- Stochastic Dual Averaging for Decentralized Online Optimization on Time-Varying Communication Graphs
Cited in
(2)
This page was built for publication: Online distributed optimization with stochastic gradients: high probability bound of regrets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636942)
