Decentralized non-convex online optimization with adaptive momentum estimation and quantized communication
Abstract In this work, we consider the decentralized non-convex online optimization problem over an undirected network. To solve the problem over a communication-efficient manner, we propose a novel quantized decentralized adaptive momentum gradient descent algorithm based on the adaptive momentum e...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2025-03-01
|
| Series: | Complex & Intelligent Systems |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/s40747-025-01818-8 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Abstract In this work, we consider the decentralized non-convex online optimization problem over an undirected network. To solve the problem over a communication-efficient manner, we propose a novel quantized decentralized adaptive momentum gradient descent algorithm based on the adaptive momentum estimation methods, where quantified information is exchanged between agents. The proposed algorithm not only can effectively reduce the data transmission volume but also contribute to improved convergence. Theoretical analysis proves that the proposed algorithm can achieve sublinear dynamic regret under appropriate step-size and quantization level, which matches the convergence of the decentralized online algorithm with exact-communication. Extensive simulations are given to demonstrate the efficacy of the algorithm. |
|---|---|
| ISSN: | 2199-4536 2198-6053 |