Online Learning
Online Learning (Sequential / Incremental Machine Learning) · Also known as: incremental learning, sequential learning, streaming learning, online machine learning
Online learning is a machine learning paradigm in which a model is updated incrementally as each new data point arrives, rather than being trained once on a fixed dataset. It is essential when data streams continuously, storage is limited, or the underlying distribution shifts over time. Theoretical performance is measured by cumulative regret relative to the best fixed predictor in hindsight.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
+30 more
When to use it
Use online learning when data arrives as a continuous stream and retraining from scratch is impractical; when the data distribution shifts over time (concept drift) and the model must adapt without full retraining; or when storage and memory constraints prevent keeping the full dataset. It suits recommendation systems, fraud detection, natural language processing pipelines, and sensor data applications. Do NOT use it when data volume is small and static (batch learning is simpler and equally effective), when the full dataset must be seen multiple times for convergence (e.g., deep neural networks on small sets), or when reproducibility and offline evaluation pipelines are critical and streaming infrastructure is unavailable.
Strengths & limitations
- Handles unbounded data streams with constant memory, making it scalable to massive or infinite datasets.
- Adapts automatically to concept drift and distributional shift without explicit retraining triggers.
- Provides strong theoretical guarantees via regret bounds, quantifying worst-case performance against any fixed competitor.
- Low latency updates make it suitable for real-time and time-sensitive applications.
- Many algorithms (SGD, AdaGrad, FTRL) have well-understood convergence and regret properties.
- Sensitive to learning rate and hyperparameter choice; poor rates cause slow convergence or instability.
- Performance at any given step depends on the ordering of examples, making results order-sensitive.
- Batch evaluation metrics (cross-validation, hold-out test sets) do not directly apply; prequential evaluation is needed instead.
- Deep neural network training typically requires multiple passes over data (epochs), conflicting with strict single-pass online settings.
Frequently asked
Is online learning the same as stochastic gradient descent?
SGD is the most common optimization algorithm used in online learning, but they are not identical. Online learning is a paradigm (process one example, update, move on); SGD is an update rule. Online learning may use other update rules such as Perceptron, AdaGrad, or FTRL.
How do I evaluate a model trained with online learning?
Use prequential evaluation (also called test-then-train): for each arriving example, first predict, record the error, then update. The running average of errors gives an unbiased estimate of real-time performance without requiring a separate hold-out set.
How does online learning handle concept drift?
Because parameters are updated after every example, the model naturally tracks slow distributional shifts. For abrupt drift, explicitly detected by monitoring error rates or statistical tests (e.g., DDM, ADWIN), a higher learning rate or model reset may be needed.
What is regret and why does it matter?
Regret is the cumulative extra loss incurred by the online algorithm compared to the best fixed predictor chosen with full hindsight. Sub-linear regret (growing slower than T) guarantees that the average per-round loss converges to the optimum, providing a rigorous worst-case performance certificate.
Can deep neural networks be trained in an online fashion?
Yes, but with caveats. DNNs typically need multiple epochs over data for stable convergence, conflicting with strict single-pass online constraints. In practice, mini-batch streaming SGD is used as a compromise — processing recent batches of a few examples before updating weights.
Sources
- Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. DOI: 10.1561/2200000018 ↗
- Cesa-Bianchi, N. & Lugosi, G. (2006). Prediction, Learning, and Games. Cambridge University Press. ISBN: 978-0-521-84108-5
How to cite this page
ScholarGate. (2026, June 3). Online Learning (Sequential / Incremental Machine Learning). ScholarGate. https://scholargate.app/en/machine-learning/online-learning
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Active LearningMachine learning↔ compare
- Federated LearningPrivacy↔ compare
- Few-shot LearningMachine learning↔ compare
- Self-supervised LearningMachine learning↔ compare
- Semi-supervised LearningMachine learning↔ compare
- Transfer LearningMachine learning↔ compare