.png){kind=icon}
Return
Boosting for Distributed Online Convex Optimization
.png){kind=icon}
OA
AI
DOI：10.26599/TST.2022.9010041.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
distributed Online Convex Optimization (OCO)
online boosting
Online Gradient Boosting (OGB)
Journal
T
IF:
3.5
Papers:
987
Citations:
2.5K
Organization
Cited Papers
ShareSaveDistributed online gradient boosting on data stream over multi-agent networks.png)
SIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
ShareSaveShareSaveShareSaveDistributed multi-task classification: a decentralized online learning approachMACHINE LEARNING
OAAI
MACHINE LEARNINGIF2.9
OAAIShareSaveBoosting methods for multi-class imbalanced data classification: an experimental reviewJOURNAL OF BIG DATAOAAI
JOURNAL OF BIG DATAIF6.4
OAAIShareSaveShareSave
View more