.png){kind=icon}
返回
Communication-Efficient Regret-Optimal Distributed Online Convex Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2024.3403883.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Online convex optimization in distributed systems has shown great promise in collaboratively learning on data streams with massive learners, such as in collaborative coordination inrobot and IoT networks. When implemented in communication-constrained networks like robot and IoT networks, two critical yet distinct objectives in distributed online convex optimization(DOCO) are minimizing the overall regret and the communication cost. Achieving both objectives simultaneously is challenging, especially when the number of learners n and learning time Tare prohibitively large. To address this challenge, we propose novel algorithms in typical adversarial and stochastic settings. Our algorithms significantly reduce the communication complex-ity of the algorithms with the state-of-the-art regret by a factor of O(n(2)) and O(root nT)in adversarial and stochastic settings, respectively. We are the first to achieve nearly optimal regret and communication complexity simultaneously up to polylogarith-mic factors. We validate our algorithms through experiments on real-world datasets in classification tasks. Our algorithms with appropriate parameters can achieve90%similar to 99%communicationsaving with close accuracy over existing methods in most cases. The code is available at https://github.com/GGBOND121382/Communication-Efficient_Regret-Optimal_DOCO.
Keyword:
Complexity theory
Stochastic processes
Robots
Robot kinematics
Costs
Convex functions
Loss measurement
Communication complexity
distributed online learning
convex optimization
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容