.png){kind=icon}
返回
Distributed online gradient boosting on data stream over multi-agent networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2021.108253.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study gradient boosting with distributed data streams over multi-agent networks, and propose a distributed online gradient boosting algorithm. Considering limited communication resources and privacy, each node aims to track the minimum of a global, time-varying cost function based on its own data stream and some information of neighbors. We first formulate the global cost function as a sum of local ones, and then convert distributed online gradient boosting into a distributed online optimization problem. At each time step, the local model is updated by a gradient descent step based on the current data, followed by a consensus step with the neighbors. Then, we use a dynamic regret to measure the performance of the proposed algorithm, and prove that the regret has an O(T) bound. Simulations with some practical datasets illustrate the performance of the proposed algorithm. (c) 2021 Elsevier B.V. All rights reserved.
Keyword:
Data stream
Multi-agent networks
Online supervised learning
Online gradient boosting
Distributed online optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
Distributed Online Optimization for Multi-Agent Networks With Coupled Inequality Constraints耦合不等式约束的多智能体网络分布式在线优化
OAAI
OAAI分享收藏分享收藏
查看更多内容