A decentralised strongly adaptive subgradient online learning algorithm over time-varying networks
From MaRDI portal
Cites work
- A fast row-stochastic decentralized method for distributed optimization over directed graphs
- Adaptive subgradient methods for online learning and stochastic optimization
- An Online Convex Optimization Approach to Proactive Network Resource Allocation
- DAdam: a consensus-based distributed adaptive gradient method for online optimization
- Distributed Optimization Over Time-Varying Directed Graphs
- Distributed Personalized Gradient Tracking With Convex Parametric Models
- Distributed stochastic subgradient projection algorithms for convex optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- Fast Distributed Gradient Methods
- Harnessing Smoothness to Accelerate Distributed Optimization
- Logarithmic regret algorithms for online convex optimization
- Optimized gradient tracking for decentralized online learning
This page was built for publication: A decentralised strongly adaptive subgradient online learning algorithm over time-varying networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6836380)