arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.01053eess.SYcs.SY
收藏

基于ADMM的量化共识:概率性与确定性量化器

Quantized Consensus by the ADMM: Probabilistic versus Deterministic Quantizers

Department of Electrical Engineering and Computer Science, Syracuse University(雪城大学电气与计算机工程系)

Shengyu Zhu, Biao Chen

AI总结:

本文提出高效的分布式平均共识算法,研究概率和确定性量化对ADMM算法的影响,分析其收敛性并提出两阶段算法,实现更小的共识误差。

摘要:

本文提出高效的分布式平均共识算法,研究概率和确定性量化对ADMM算法的影响,分析其收敛性并提出两阶段算法,实现更小的共识误差。

英文摘要:

This paper develops efficient algorithms for distributed average consensus with quantized communication using the alternating direction method of multipliers (ADMM). We first study the effects of probabilistic and deterministic quantizations on a distributed ADMM algorithm. With probabilistic quantization, this algorithm yields linear convergence to the desired average in the mean sense with a bounded variance. When deterministic quantization is employed, the distributed ADMM either converges to a consensus or cycles with a finite period after a finite-time iteration. In the cyclic case, local quantized variables have the same mean over one period and hence each node can also reach a consensus. We then obtain an upper bound on the consensus error which depends only on the quantization resolution and the average degree of the network. Finally, we propose a two-stage algorithm which combines both probabilistic and deterministic quantizations. Simulations show that the two-stage algorithm, without picking small algorithm parameter, has consensus errors that are typically less than one quantization resolution for all connected networks where agents' data can be of arbitrary magnitudes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑