Nesterov Accelerated Distributed Optimization with Efficient Quantized Communication

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Wu, Ruochen, Du, Xu, Johansson, Karl H., Rikos, Apostolos I.
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866913042438029312
author Wu, Ruochen
Du, Xu
Johansson, Karl H.
Rikos, Apostolos I.
author_facet Wu, Ruochen
Du, Xu
Johansson, Karl H.
Rikos, Apostolos I.
contents In modern large-scale networked systems, rapidly solving optimization problems while utilizing communication resources efficiently is critical for addressing complex tasks. In this paper, we consider an unconstrained distributed optimization problem in which information exchange among nodes is governed by a directed communication graph. In our setup we focus on two key challenges. The first is the zigzag phenomenon caused by the objective functions of individual nodes having significantly different curvature along different directions. The second is that the communication channels among nodes are subject to limited bandwidth, which motivates the use of compressed (quantized) messages. To address both challenges simultaneously, we propose QANM, a distributed optimization algorithm that combines Nesterov-accelerated gradient descent with a distributed finite-time quantized consensus protocol, enabling accelerated convergence. Under strong convexity and smoothness assumptions, we show that our proposed algorithm converges linearly to a neighborhood of the optimal solution. Finally, we validate our algorithm on a distributed sensor fusion application for multi-dimensional target parameter estimation, where simulations across two distinct scenarios confirm the convergence guarantees and demonstrate clear acceleration benefits over non-momentum baselines.
format Preprint
id arxiv_https___arxiv_org_abs_2604_16906
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Nesterov Accelerated Distributed Optimization with Efficient Quantized Communication
Wu, Ruochen
Du, Xu
Johansson, Karl H.
Rikos, Apostolos I.
Systems and Control
Optimization and Control
In modern large-scale networked systems, rapidly solving optimization problems while utilizing communication resources efficiently is critical for addressing complex tasks. In this paper, we consider an unconstrained distributed optimization problem in which information exchange among nodes is governed by a directed communication graph. In our setup we focus on two key challenges. The first is the zigzag phenomenon caused by the objective functions of individual nodes having significantly different curvature along different directions. The second is that the communication channels among nodes are subject to limited bandwidth, which motivates the use of compressed (quantized) messages. To address both challenges simultaneously, we propose QANM, a distributed optimization algorithm that combines Nesterov-accelerated gradient descent with a distributed finite-time quantized consensus protocol, enabling accelerated convergence. Under strong convexity and smoothness assumptions, we show that our proposed algorithm converges linearly to a neighborhood of the optimal solution. Finally, we validate our algorithm on a distributed sensor fusion application for multi-dimensional target parameter estimation, where simulations across two distinct scenarios confirm the convergence guarantees and demonstrate clear acceleration benefits over non-momentum baselines.
title Nesterov Accelerated Distributed Optimization with Efficient Quantized Communication
topic Systems and Control
Optimization and Control
url https://arxiv.org/abs/2604.16906