Distributed Online Optimization With Communication And Feedback Delays
This paper studies the application of distributed online convex optimization in multi-agent systems under communication and feedback delays. Comprising a network topology, multiple sub-agents engage in the estimation of the global optimal strategy through the exchange of their individual information. We augment the communication network with virtual delay nodes. Feedback delays are also incorporated into the network. In the analysis of the algorithm's feasibility, consideration is given to the regret. We show that the regret has a sublinear bound when the communication delay is bounded and the delayed feedback can be received.
Authors
- Haodong Wang (ORCID: https://orcid.org/0000-0002-6571-7358)
- Shuai Mao (ORCID: https://orcid.org/0000-0002-1960-3456)
- Yiming Xu (ORCID: https://orcid.org/0009-0003-1022-7524)
Institutions
- Nantong University (CN)
Publication Details
- Published
- 2025-05-23
- DOI
- https://doi.org/10.1109/icaisisas64483.2025.11051547
- Primary Topic
- Advanced Bandit Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00