Adaptive XGBoost for Evolving Data Streams
Not on the map. Why?
Abstract (arXiv)
Boosting is an ensemble method that combines base models in a sequential manner to achieve high predictive accuracy. A popular learning algorithm based on this ensemble method is eXtreme Gradient Boosting (XGB). We present an adaptation of XGB for classification of evolving data streams. In this setting, new data arrives over time and the relationship between the class and the features may change in the process, thus exhibiting concept drift. The proposed method creates new members of the ensemble from mini-batches of data as new data becomes available. The maximum ensemble size is fixed, but learning does not stop when this size is reached because the ensemble is updated on new data to ensure consistency with the current concept. We also explore the use of concept drift detection to trigger a mechanism to update the ensemble. We test our method on real and synthetic data with concept drift and compare it against batch-incremental and instance-incremental classification methods for data streams.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 May 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 3; 2023: 1; 2024: 0; 2025: 2; 2026: 2.
8 papers.
- 2022Are Concept Drift Detectors Reliable Alarming Systems? -- A Comparative Studycited by 7
- 2022Dynamic Model Tree for Interpretable Data Stream Learningcited by 6
- 2023Tackling Concept Shift in Text Classification using Entailment-style Modelingcited by 4
- 2022Confident Sinkhorn Allocation for Pseudo-Labelingcited by 3
- 2025An Attention-based Feature Memory Design for Energy-Efficient Continual Learningcited by 2
- 2025Online learning to accelerate nonlinear PDE solvers: applied to multiphase porous media flowcited by 0
- 2026An Optimised Greedy-Weighted Ensemble Framework for Financial Loan Default Predictioncited by 0
- 2026Correcting Split Selection in Online Decision Trees via Anytime-Valid Inferencecited by 0
- 2026Correcting Split Selection in Online Decision Trees via Anytime-Valid Inference29 May 2026
- 2026An Optimised Greedy-Weighted Ensemble Framework for Financial Loan Default Prediction19 Mar 2026
- 2025An Attention-based Feature Memory Design for Energy-Efficient Continual Learning6 Oct 2025
- 2025Online learning to accelerate nonlinear PDE solvers: applied to multiphase porous media flow25 Apr 2025
- 2023Tackling Concept Shift in Text Classification using Entailment-style Modeling6 Nov 2023
- 2022Are Concept Drift Detectors Reliable Alarming Systems? -- A Comparative Study23 Nov 2022
- 2022Confident Sinkhorn Allocation for Pseudo-Labeling13 Jun 2022
- 2022Dynamic Model Tree for Interpretable Data Stream Learning30 Mar 2022