返回
Boosting for Distributed Online Convex Optimization
DOI:10.26599/TST.2022.9010041.png)
摘要
En 中文
Decentralized Online Learning (DOL) extends online learning to the domain of distributed networks. However, limitations of local data in decentralized settings lead to a decrease in the accuracy of decisions or models compared to centralized methods. Considering the increasing requirement to achieve a high-precision model or decision with distributed data resources in a network, applying ensemble methods is attempted to achieve a superior model or decision with only transferring gradients or models. A new boosting method, namely Boosting for Distributed Online Convex Optimization (BD-OCO), is designed to realize the application of boosting in distributed scenarios. BD-OCO achieves the regret upper bound O O(M + N /MN T) , where M measures the size of the distributed network and N is the number of Weak Learners (WLs) in each node. The core idea of BD-OCO is to apply the local model to train a strong global one. BD-OCO is evaluated on the basis of eight different real-world datasets. Numerical results show that BD-OCO achieves excellent performance in accuracy and convergence, and is robust to the size of the distributed network.
Keyword:
distributed Online Convex Optimization (OCO)
online boosting
Online Gradient Boosting (OGB)
期刊
T
IF:
3.5
论文数:
987
被引数:
2.5K
机构
引用论文
Distributed multi-task classification: a decentralized online learning approach分布式多任务分类: 一种分散式在线学习方法
MACHINE LEARNING
IF2.9
Boosting methods for multi-class imbalanced data classification: an experimental review
JOURNAL OF BIG DATA
IF6.4
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling用于分布式优化的双重平均: 收敛性分析和网络扩展

