Multi-armed bandit based online model selection for concept-drift adaptation

被引:0
|
作者
Wilson, Jobin [1 ,2 ]
Chaudhury, Santanu [2 ,3 ]
Lall, Brejesh [2 ]
机构
[1] Flytxt, R&D Dept, Trivandrum, Kerala, India
[2] Indian Inst Technol Delhi, Dept Elect Engn, New Delhi, India
[3] Indian Inst Technol Jodhpur, Dept Comp Sci & Engn, Jodhpur, India
关键词
concept-drift; ensemble methods; model selection; multi-armed bandits; CLASSIFICATION; FRAMEWORK;
D O I
10.1111/exsy.13626
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Ensemble methods are among the most effective concept-drift adaptation techniques due to their high learning performance and flexibility. However, they are computationally expensive and pose a challenge in applications involving high-speed data streams. In this paper, we present a computationally efficient heterogeneous classifier ensemble entitled OMS-MAB which uses online model selection for concept-drift adaptation by posing it as a non-stationary multi-armed bandit (MAB) problem. We use a MAB to select a single adaptive learner within the ensemble for learning and prediction while systematically exploring promising alternatives. Each ensemble member is made drift resistant using explicit drift detection and is represented as an arm of the MAB. An exploration factor & varepsilon;$$ \upvarepsilon $$ controls the trade-off between predictive performance and computational resource requirements, eliminating the need to continuously train and evaluate all the ensemble members. A rigorous evaluation on 20 benchmark datasets and 9 algorithms indicates that the accuracy of OMS-MAB is statistically at par with state-of-the-art (SOTA) ensembles. Moreover, it offers a significant reduction in execution time and model size in comparison to several SOTA ensemble methods, making it a promising ensemble for resource constrained stream-mining problems.
引用
收藏
页数:25
相关论文
共 50 条
  • [1] A Multi-Armed Bandit Model Selection for Cold-Start User Recommendation
    Felicio, Cricia Z.
    Paixao, Klerisson V. R.
    Barcelos, Celia A. Z.
    Preux, Philippe
    PROCEEDINGS OF THE 25TH CONFERENCE ON USER MODELING, ADAPTATION AND PERSONALIZATION (UMAP'17), 2017, : 32 - 40
  • [2] Non Stationary Multi-Armed Bandit: Empirical Evaluation of a New Concept Drift-Aware Algorithm
    Cavenaghi, Emanuele
    Sottocornola, Gabriele
    Stella, Fabio
    Zanker, Markus
    ENTROPY, 2021, 23 (03)
  • [3] Homogeneous-Heterogeneous Hybrid Ensemble for concept-drift adaptation
    Wilson, Jobin
    Chaudhury, Santanu
    Lall, Brejesh
    NEUROCOMPUTING, 2023, 557
  • [4] Automating model management: a survey on metaheuristics for concept-drift adaptation
    Mike Riess
    Journal of Data, Information and Management, 2022, 4 (3-4): : 211 - 229
  • [5] SOM-based Algorithm for Multi-armed Bandit Problem
    Manome, Nobuhito
    Shinohara, Shuji
    Suzuki, Kouta
    Tomonaga, Kosuke
    Mitsuyoshi, Shunji
    2019 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2019,
  • [6] Characterizing Truthful Multi-Armed Bandit Mechanisms
    Babaioff, Moshe
    Sharma, Yogeshwer
    Slivkins, Aleksandrs
    10TH ACM CONFERENCE ON ELECTRONIC COMMERCE - EC 2009, 2009, : 79 - 88
  • [7] Multi-Armed Recommender System Bandit Ensembles
    Canamares, Rocio
    Redondo, Marcos
    Castells, Pablo
    RECSYS 2019: 13TH ACM CONFERENCE ON RECOMMENDER SYSTEMS, 2019, : 432 - 436
  • [8] CHARACTERIZING TRUTHFUL MULTI-ARMED BANDIT MECHANISMS
    Babaioff, Moshe
    Sharma, Yogeshwer
    Slivkins, Aleksandrs
    SIAM JOURNAL ON COMPUTING, 2014, 43 (01) : 194 - 230
  • [9] Multi-Armed Bandit Algorithms for Crowdsourcing Systems with Online Estimation of Workers' Ability
    Rangi, Anshuka
    Franceschetti, Massimo
    PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS (AAMAS' 18), 2018, : 1345 - 1352
  • [10] Achieving Fairness in the Stochastic Multi-Armed Bandit Problem
    Patil, Vishakha
    Ghalme, Ganesh
    Nair, Vineet
    Narahari, Y.
    JOURNAL OF MACHINE LEARNING RESEARCH, 2021, 22