.png){kind=icon}
.png){kind=icon}
Return
Distributed Online Optimization Under Dynamic Adaptive Quantization
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2024.3362793.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
For distributed online optimization over networked nodes, we propose an algorithm based on one-step gradient descent and multi-step consensus under dynamic adaptive quantization. We propose a dynamic difference encoding-decoding strategy with variable center quantizers and online-generated quantization intervals, which adjust the quantization parameters adaptively according to the optimizers' states. We use the fixed gradient descent step size to ensure the ability of tracking the optimal solutions of the dynamically changing objective functions, and give the upper bound of the dynamic regret. The effectiveness of the proposed algorithm is demonstrated by numerical simulation.
Keywords:
Heuristic algorithms
Quantization (signal)
Optimization
Linear programming
Encoding
Decoding
Radio frequency
Distributed online optimization
dynamic adaptive quantization
finite dynamic difference coding
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W