We propose a new decentralized average consensus algorithm with compressed communication that scales linearly with the network size n. We prove that the proposed method converges to the average of the initial values held locally by the agents of a network when agents are allowed to communicate with compressed messages. The proposed algorithm works for a broad class of compression operators (possibly biased), where agents interact over arbitrary static, undirected, and connected networks. We further present numerical experiments that confirm our theoretical results and illustrate the scalability and communication efficiency of our algorithm.
翻译:我们提出一个新的分散式平均共识算法,其压缩通信与网络规模成线。 我们证明,在允许代理商与压缩信息通信时,拟议方法与网络代理商在当地持有的初始值的平均值相吻合。 拟议的算法适用于一大批压缩操作商(可能存在偏向性),其中代理商与任意静态、无方向和连接的网络发生互动。 我们还提出了数字实验,以证实我们的理论结果,并说明了我们的算法的可缩和通信效率。