An online mixture-of-experts model trained with a multi-hot correctness mask matches or approaches state-of-the-art adaptive ensembles on several concept drift benchmarks.
An Online Boosting Algorithm with Theoretical Justifications
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We study the task of online boosting--combining online weak learners into an online strong learner. While batch boosting has a sound theoretical foundation, online boosting deserves more study from the theoretical perspective. In this paper, we carefully compare the differences between online and batch boosting, and propose a novel and reasonable assumption for the online weak learner. Based on the assumption, we design an online boosting algorithm with a strong theoretical guarantee by adapting from the offline SmoothBoost algorithm that matches the assumption closely. We further tackle the task of deciding the number of weak learners using established theoretical results for online convex programming and predicting with expert advice. Experiments on real-world data sets demonstrate that the proposed algorithm compares favorably with existing online boosting algorithms.
citation-role summary
background 1
citation-polarity summary
fields
stat.ML 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
DriftMoE: A Mixture of Experts Approach to Handle Concept Drifts
An online mixture-of-experts model trained with a multi-hot correctness mask matches or approaches state-of-the-art adaptive ensembles on several concept drift benchmarks.