Generalized Geometric Programming for Rate Allocation in Consensus
Ryan Pilgrim, Junan Zhu, Dror Baron, Waheed U. Bajwa

TL;DR
This paper introduces a generalized geometric programming approach to optimize rate allocation for distributed averaging in networks, balancing communication costs and accuracy under bandwidth constraints.
Contribution
It develops a novel optimization framework for rate allocation in distributed consensus using generalized geometric programming, considering lossy compression and Gaussian data.
Findings
Optimized rate allocation reduces total coding rate for target accuracy.
Incorporating side information can further improve rate-distortion performance.
Numerical simulations validate the effectiveness of the proposed method.
Abstract
Distributed averaging, or distributed average consensus, is a common method for computing the sample mean of the data dispersed among the nodes of a network in a decentralized manner. By iteratively exchanging messages with neighbors, the nodes of the network can converge to an agreement on the sample mean of their initial states. In real-world scenarios, these messages are subject to bandwidth and power constraints, which motivates the design of a lossy compression strategy. Few prior works consider the rate allocation problem from the perspective of constrained optimization, which provides a principled method for the design of lossy compression schemes, allows for the relaxation of certain assumptions, and offers performance guarantees. We show for Gaussian-distributed initial states with entropy-coded scalar quantization and vector quantization that the coding rates for distributed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
