Distributed Optimization via Gradient Descent with Event-Triggered Zooming over Quantized Communication

TL;DR

This paper introduces a finite-time distributed optimization algorithm that adaptively refines quantization levels over digital channels, achieving near-optimal solutions efficiently despite limited communication capacity.

Contribution

It proposes a novel quantized distributed optimization method that converges in finite steps and dynamically adjusts quantization levels for improved communication efficiency.

Findings

Converges in finite steps with adaptive quantization.

Achieves solutions close to the optimal with limited communication.

Balances quantization precision and communication cost.

Abstract

In this paper, we study unconstrained distributed optimization strongly convex problems, in which the exchange of information in the network is captured by a directed graph topology over digital channels that have limited capacity (and hence information should be quantized). Distributed methods in which nodes use quantized communication yield a solution at the proximity of the optimal solution, hence reaching an error floor that depends on the quantization level used; the finer the quantization the lower the error floor. However, it is not possible to determine in advance the optimal quantization level that ensures specific performance guarantees (such as achieving an error floor below a predefined threshold). Choosing a very small quantization level that would guarantee the desired performance, requires {information} packets of very large size, which is not desirable (could increase the probability of packet losses, increase delays, etc) and often not feasible due to the limited capacity of the channels available. In order to obtain a communication-efficient distributed solution and a sufficiently close proximity to the optimal solution, we propose a quantized distributed optimization algorithm that converges in a finite number of steps and is able to adjust the quantization level accordingly. The proposed solution uses a finite-time distributed optimization protocol to find a solution to the problem for a given quantization level in a finite number of steps and keeps refining the quantization level until the difference in the solution between two successive solutions with different quantization levels is below a certain pre-specified threshold.