Decentralized online convex optimization with compressed communications

DOI10.1016/J.AUTOMATICA.2023.111186MaRDI QIDQ6136129zbMATH OpenOpenAlexFDO

Authors Xuanyu Cao, Tamer Başar

Publication date 28 August 2023

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.automatica.2023.111186

zbMATH Keywords

communication efficiencycompressed communicationsdecentralized optimizationerror compensationonline convex optimization

Mathematics Subject Classification ID

Convex programming (90C25) Decentralized systems (93A14) Multi-agent systems (93A16)

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 based on signs of relative states
• Decentralized Online Convex Optimization With Event-Triggered Communications
• 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 in the bandit setting: gradient descent without a gradient
• Online Convex Optimization With Time-Varying Constraints and Bandit Feedback
• Online Learning of Feasible Strategies in Unknown Environments
• Quantization Design for Distributed Optimization
• Trading regret for efficiency: online convex optimization with long term constraints

Cited in

(11)

• On arbitrary compression for decentralized consensus and stochastic optimization over directed networks
• Communication-efficient algorithms for decentralized and stochastic optimization
• Online learning over a decentralized network through ADMM
• Decentralized online convex optimization based on signs of relative states
• DESTRESS: Computation-Optimal and Communication-Efficient Decentralized Nonconvex Finite-Sum Optimization
• Stochastic distributed learning with gradient quantization and double-variance reduction
• Decentralized ADMM with compressed and event-triggered communication
• Decentralized Multi-Task Stochastic Optimization With Compressed Communications
• Real acceleration of communication process in distributed algorithms with compression
• Distributed constrained online convex optimization with adaptive quantization
• Remote state estimation over hidden Markov channels: handling measurement compression and channel-state-dependent packet loss

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)