Innovation compression for communication-efficient distributed optimization with linear convergence

Innovation compression for communication-efficient distributed optimization with linear convergence

Information compression is essential to reduce communication cost in distributed optimization over peer-to-peer networks. This paper proposes a communication-efficient linearly convergent distributed (COLD) algorithm to solve strongly convex optimization problems. By compressing innovation vectors,...

Full description

Saved in:
Bibliographic Details
Main Authors: Zhang, Jiaqi, You, Keyou, Xie, Lihua
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2023
Subjects:
Engineering::Electrical and electronic engineering
Distributed Optimization
Linear Convergence
Online Access:https://hdl.handle.net/10356/170700
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary:Information compression is essential to reduce communication cost in distributed optimization over peer-to-peer networks. This paper proposes a communication-efficient linearly convergent distributed (COLD) algorithm to solve strongly convex optimization problems. By compressing innovation vectors, which are the differences between decision vectors and their estimates, COLD achieves linear convergence for a class of δ-contracted compressors, and we explicitly quantify how the compression affects the convergence rate. Interestingly, our results strictly improve existing results for the quantized consensus problem. Numerical experiments demonstrate the advantages of COLD under different compressors.

Similar Items