Quantized Consensus by the ADMM: Probabilistic Versus Deterministic Quantizers

DOI10.1109/TSP.2015.2504341MaRDI QIDQ4618283zbMATH OpenOpenAlexFDO

Authors Shengyu Zhu, Biao Chen

Publication date 7 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1502.01053

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: 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.

Recommendations

• Corrections to ``Quantized consensus by the ADMM: probabilistic versus deterministic quantizers
• Consensus-ADMM for General Quadratically Constrained Quadratic Programming
• On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
• Efficient quantization in the average consensus problem
• Linear Convergence of Consensus-Based Quantized Optimization for Smooth and Strongly Convex Cost Functions
• Convergence-Optimal Quantizer Design of Distributed Contraction-Based Iterative Algorithms With Quantized Message Passing
• Convergence Rates of Distributed Gradient Methods Under Random Quantization: A Stochastic Approximation Approach
• A novel bound on the convergence rate of ADMM for distributed optimization
• Fast Convergence Rates of Distributed Subgradient Methods With Adaptive Quantization
• On convergence of a stochastic quasigradient algorithm of quantile optimization

Cited in

(4)

• Synchronization of coupled harmonic oscillators using quantized sampled position data
• Distributed state and fault estimation over sensor networks with probabilistic quantizations: the dynamic event-triggered case
• Distributed constrained online convex optimization with adaptive quantization
• Distributed output consensus of heterogeneous linear multi-agent systems with dynamic quantization

This page was built for publication: Quantized Consensus by the ADMM: Probabilistic Versus Deterministic Quantizers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4618283)