Decentralized online convex optimization with compressed communications
From MaRDI portal
Publication:6136129
Recommendations
- Decentralized online convex optimization based on signs of relative states
- Communication-efficient algorithms for decentralized and stochastic optimization
- On arbitrary compression for decentralized consensus and stochastic optimization over directed networks
- Online learning over a decentralized network through ADMM
- Adaptive online distributed optimization in dynamic environments
Cites work
- A Saddle Point Algorithm for Networked Online Convex Optimization
- An Exact Quantized Decentralized Gradient Descent Algorithm
- An Online Convex Optimization Approach to Proactive Network Resource Allocation
- Decentralized Multi-Agent Stochastic Optimization With Pairwise Constraints and Quantized Communications
- Decentralized Online Convex Optimization With Event-Triggered Communications
- Decentralized online convex optimization based on signs of relative states
- Distributed Discrete-Time Optimization in Multiagent Networks Using Only Sign of Relative State
- Distributed Event-Triggered Gradient Method for Constrained Convex Minimization
- Distributed Online Convex Optimization on Time-Varying Directed Graphs
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- Fast Convergence Rates of Distributed Subgradient Methods With Adaptive Quantization
- Non-stationary stochastic optimization
- Online Convex Optimization With Time-Varying Constraints and Bandit Feedback
- Online Learning of Feasible Strategies in Unknown Environments
- Online convex optimization in the bandit setting: gradient descent without a gradient
- Quantization Design for Distributed Optimization
- Trading regret for efficiency: online convex optimization with long term constraints
Cited in
(9)- Real acceleration of communication process in distributed algorithms with compression
- On arbitrary compression for decentralized consensus and stochastic optimization over directed networks
- Communication-efficient algorithms for decentralized and stochastic optimization
- Decentralized Multi-Task Stochastic Optimization With Compressed Communications
- Decentralized online convex optimization based on signs of relative states
- Distributed constrained online convex optimization with adaptive quantization
- Decentralized ADMM with compressed and event-triggered communication
- Stochastic distributed learning with gradient quantization and double-variance reduction
- Online learning over a decentralized network through ADMM
This page was built for publication: Decentralized online convex optimization with compressed communications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136129)
