OLR-WAA: Adaptive and Drift-Resilient Online Regression with Dynamic Weighted Averaging
Not on the map. Why?
Abstract (arXiv)
Real-world datasets frequently exhibit evolving data distributions, reflecting temporal variations and underlying shifts. Overlooking this phenomenon, known as concept drift, can substantially degrade the predictive performance of the model. Furthermore, the presence of hyperparameters in online models exacerbates this issue, as these parameters are typically fixed and lack the flexibility to dynamically adjust to evolving data. This paper introduces "OLR-WAA: An Adaptive and Drift-Resilient Online Regression with Dynamic Weighted Average", a hyperparameter-free model designed to tackle the challenges of non-stationary data streams and enable effective, continuous adaptation. The objective is to strike a balance between model stability and adaptability. OLR-WAA incrementally updates its base model by integrating incoming data streams, utilizing an exponentially weighted moving average. It further introduces a unique optimization mechanism that dynamically detects concept drift, quantifies its magnitude, and adjusts the model based on real-time data characteristics. Rigorous evaluations show that it matches batch regression performance in static settings and consistently outperforms or rivals state-of-the-art online models, confirming its effectiveness. Concept drift datasets reveal a performance gap that OLR-WAA effectively bridges, setting it apart from other online models. In addition, the model effectively handles confidence-based scenarios through a conservative update strategy that prioritizes stable, high-confidence data points. Notably, OLR-WAA converges rapidly, consistently yielding higher R2 values compared to other online models.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 99 references that are in the map. First posted on arXiv 14 Dec 2025.
Builds on
20 of 99 references.
References · 20
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2021Convex optimizationcited by 2,479
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
- 2016An overview of gradient descent optimization algorithmscited by 1,021
- 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 547
- 2020Learning under Concept Drift: A Reviewcited by 470
- 2014SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectivescited by 401
- 2017Train longer, generalize better: closing the generalization gap in large batch training of neural networkscited by 278
- 2018Online Learning: A Comprehensive Surveycited by 203
- 2020An Improved Analysis of Stochastic Gradient Descent with Momentumcited by 117
- 2015Characterizing Concept Driftcited by 93
8 more
- 2020An Efficient Algorithm For Generalized Linear Bandit: Online Stochastic Gradient Descent and Thompson Samplingcited by 30
- 2020Choosing the Sample with Lowest Loss makes SGD Robustcited by 26
- 2022Online AutoML: An adaptive AutoML framework for online learningcited by 11
- 2021Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridgecited by 10
- 2021Can we globally optimize cross-validation loss? Quasiconvexity in ridge regressioncited by 8
- 2024Stabilizing Linear Passive-Aggressive Online Learning with Weighted Reservoir Samplingcited by 4
- 2022Online Linearized LASSOcited by 3
- 2018A Unified Dynamic Approach to Sparse Model Selectioncited by 2
Built on by
Not cited yet.