摘要
This paper considers the problem of solving distributed online optimization over a network that consists of multiple interacting nodes. Each node in the network is endowed with a sequence of loss functions, each of which is revealed to the node after a decision has been committed. The goal of the network is to minimize the cumulative loss functions of nodes in a distributed fashion, while subject to two types of information constraints, namely, message quantization and bandit feedback. To this end, a quantized distributed online bandit optimization algorithm is proposed by adopting random quantization operation and one-point gradient estimator. We show the convergence of the algorithm by establishing an O(dT(3/4)) regret bound, where d is the dimension of states and T is the total number of rounds. Finally, an online distributed quadratic programming problem is investigated to validate the theoretical findings of the paper.
学科与关键词
- Distributed online bandit linear regressions with differential privacyDai, Mingcheng; Ho, Daniel W. C.; Zhang, Baoyong; Yuan, Deming*; Xu, ShengyuanJOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 2023, 360(16): 11736-11759.
- Distributed Constrained Optimization With Delayed Subgradient Information Over Time-Varying Network Under Adaptive QuantizationLiu, Jie*; Yu, Zhan; Ho, Daniel W. C.IEEE Transactions on Neural Networks and Learning Systems, 2024, 35(1): 143-156.被引 3
- Distributed constrained optimization with periodic dynamic quantizationLiu, Jie*; Li, Lulu; Ho, Daniel W. C.Automatica, 2024, 159: 111364.
