arXiv:2608. 02845v1 Announce Type: new Abstract: Tabular model performance degrades when feature distributions change over time or the relationship between features and outcome variables change over time, known as data drift and concept drift, respectively.
By Swapn Shah, Keith Burghardt
The paper introduces PAI-KNN, a k‑nearest neighbor classifier designed for data stream classification with concept drift and class imbalance. Unlike traditional methods that modify memory through instance removal or resampling, PAI‑KNN keeps a simple sliding‑window buffer and adapts its decision rule at inference time by adjusting class priors based on recent observations. Experiments on synthetic streams with varying imbalance and drift show that PAI‑KNN performs competitively with state‑of‑the‑art techniques, especially when dynamic class imbalance and concept drift are present.
By Tobias Callies (University of the Bundeswehr Munich), Eirini Ntoutsi (University of the Bundeswehr Munich), Arthur Zimek (University of Southern Denmark)
arXiv:2608. 19488v1 Announce Type: new Abstract: Production machine learning systems degrade under concept drift, yet practitioners have little principled guidance on when to retrain.
By Sawan Dasari
arXiv:2606. 07789v1 Announce Type: new Abstract: Data stream mining is fundamentally challenged by concept drift, where distributional changes can degrade model performance.
By Vitor Cerqueira, Heitor Murilo Gomes, Marco Heyden, Bernhard Pfahringer, Albert Bifet
arXiv:2608. 16659v1 Announce Type: cross Abstract: Ensembles of decision trees are well-established methods for data stream classification.
By Daniel Nowak Assis, Jean Paul Barddal, Fabr\'icio Enembreck
arXiv:2606. 27095v1 Announce Type: cross Abstract: Cold-start exemplar-free class-incremental learning requires learning a growing set of classes without replay, external pretraining, or a large initial task.
By Augustinas Ju\v{c}as, Yangchen Pan
arXiv:2606. 09430v1 Announce Type: cross Abstract: Online task-free continual learning (TFCL) requires intelligent agents to sequentially accumulate knowledge from an unbounded, non-stationary data stream under strict single-pass constraints and without any explicit task identifiers.
By Mingqi Yuan, Xiaoquan Sun, Shihao Luo, Jiayu Chen
arXiv:2606. 20216v1 Announce Type: cross Abstract: Machine learning algorithms deployed for evolving streaming environments must handle the non-stationary data distributions, commonly referred to as concept drift.
By Md Moman Ul Haque Khan, Samira Sadaoui
arXiv:2602. 06932v5 Announce Type: replace Abstract: Speculative decoding can significantly accelerate LLM serving, yet most deployments today disentangle speculator training from serving, treating speculator training as a standalone offline modeling problem.
By Junxiong Wang, Fengxiang Bie, Jisen Li, Zhongzhu Zhou, Zelei Shao, Yubo Wang, Yinghui Liu, Qingyang Wu, Avner May, Sri Yanamandra, Ce Zhang, Tri Dao, Percy Liang, Ben Athiwaratkun, Shuaiwen Leon Song, Chenfeng Xu, Xiaoxia Wu
arXiv:2608.28237v1 Announce Type: new
Abstract: Predictive Process Monitoring (PPM) models are increasingly deployed in dynamic environments where concept drift causes the underlying process distribu...
By Sjoerd van Straten, Marwan Hassani
AdaptLSTM is an adaptive online learning framework designed for cloud workload forecasting under distribution drift. It detects drift using validation‑calibrated thresholds and performs selective, targeted updates, achieving a large portion of the accuracy gains of naive online learning while reducing per‑step compute cost. Experiments on Alibaba and Container traces show significant efficiency improvements and error reductions compared to static models and classical drift detectors.
By Xinhua Miao, Bowei Yang, Zhengong Cai
The paper introduces TALON, a Task‑Adaptive LoRA‑Teacher framework for Few‑Shot Class‑Incremental Learning. TALON assigns a dedicated LoRA‑Teacher to each incremental task, then distills the frozen teachers into a single LoRA‑Student via Ensemble Knowledge Transfer, using a semantic‑guided weighting scheme to reduce forgetting and overfitting. Experiments on four FSCIL benchmarks show that TALON matches or surpasses state‑of‑the‑art accuracy while using up to 33× fewer deployment parameters and cutting inference time by 41.7%.
By Hongwei Zhao (School of Computer Science,Engineering, Beihang University), Rui Liu (School of Computer Science,Engineering, Beihang University), Yansong Liu (School of Computer Science,Engineering, Beihang University), Zhiyuan Zou (School of Computer Science,Engineering, Beihang University), Yong Chen (School of Computer Science, Beijing University of Posts,Telecommunications)