Distributed adaptive online learning for convex optimization with weight decay
From MaRDI portal
Recommendations
- Adaptive online distributed optimization in dynamic environments
- An accelerated distributed online gradient push-sum algorithm on time-varying directed networks
- A distributed conjugate gradient online learning method over networks
- An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs
Cites work
- Adaptive subgradient methods for online learning and stochastic optimization
- Centralized and decentralized distributed control of longitudinal vehicular platoons with non-uniform communication topology
- Collective dynamics of `small-world' networks
- Decentralized Online Learning With Kernels
- Distributed Average Tracking of Multiple Time-Varying Reference Signals With Bounded Derivatives
- Distributed multi-task classification: a decentralized online learning approach
- Distributed Online Convex Optimization on Time-Varying Directed Graphs
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Distributed Subgradient Methods for Multi-Agent Optimization
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Fast Distributed Gradient Methods
- Fastest Mixing Markov Chain on a Graph
- Finite-Time Connectivity-Preserving Consensus of Networked Nonlinear Agents With Unknown Lipschitz Terms
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- On convergence rate of distributed stochastic gradient algorithm for convex optimization with inequality constraints
- Online learning and online convex optimization
- SGDLibrary: a MATLAB library for stochastic optimization algorithms
Cited in
(4)- An accelerated distributed online gradient push-sum algorithm on time-varying directed networks
- Online distributed nonconvex optimization with stochastic objective functions: high probability bound analysis of dynamic regrets
- Distributed online adaptive subgradient optimization with dynamic bound of learning rate over time-varying networks
- Linear convergence of event-triggered distributed optimization with metric subregularity condition
This page was built for publication: Distributed adaptive online learning for convex optimization with weight decay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6578717)
