mlsanityData to 7 Oct 2026

OLR-WA: Online Weighted Average Linear Regression in Multivariate Data Streams

arXiv 2512.14892 ↗First posted 16 Dec 2025cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Online learning updates models incrementally with new data, avoiding large storage requirements and costly model recalculations. In this paper, we introduce "OLR-WA; OnLine Regression with Weighted Average", a novel and versatile multivariate online linear regression model. We also investigate scenarios involving drift, where the underlying patterns in the data evolve over time, conduct convergence analysis, and compare our approach with existing online regression models. The results of OLR-WA demonstrate its ability to achieve performance comparable to the batch regression, while also showcasing comparable or superior performance when compared with other state-of-the-art online models, thus establishing its effectiveness. Moreover, OLR-WA exhibits exceptional performance in terms of rapid convergence, surpassing other online models with consistently achieving high r2 values as a performance measure from the first iteration to the last iteration, even when initialized with minimal amount of data points, as little as 1% to 10% of the total data points. In addition to its ability to handle time-based (temporal drift) scenarios, remarkably, OLR-WA stands out as the only model capable of effectively managing confidence-based challenging scenarios. It achieves this by adopting a conservative approach in its updates, giving priority to older data points with higher confidence levels. In summary, OLR-WA's performance further solidifies its versatility and utility across different contexts, making it a valuable solution for online linear regression tasks.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 9 of its 39 references that are in the map. First posted on arXiv 16 Dec 2025.

Builds on

9 of 39 references.

References · 9

  1. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  2. 2016An overview of gradient descent optimization algorithmscited by 1,021
  3. 2016Transferability in Machine Learning: from Phenomena to Black-Box Attacks using Adversarial Samplescited by 439
  4. 2019Online Stochastic Gradient Descent with Arbitrary Initialization Solves Non-smooth, Non-convex Phase Retrievalcited by 34
  5. 2020An Efficient Algorithm For Generalized Linear Bandit: Online Stochastic Gradient Descent and Thompson Samplingcited by 30
  6. 2020Choosing the Sample with Lowest Loss makes SGD Robustcited by 26
  7. 2017Reinforcement Learning for Learning Rate Controlcited by 16
  8. 2021Can we globally optimize cross-validation loss? Quasiconvexity in ridge regressioncited by 8
  9. 2023OLR-WA Online Regression with Weighted Averagecited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.