Sammenlign metoder

	Online LightGBM	Online Gradient Boosting	Online læring
Fagfelt	Maskinlæring	Maskinlæring	Maskinlæring
Familie	Machine learning	Machine learning	Machine learning
Opprinnelsesår	2017 (LightGBM); 2000s (online boosting)	2011–2015	1958–2000s
Opphavsperson	Ke et al. (LightGBM); Bifet, Gavalda (online boosting theory)	Grubb, A. & Bagnell, J. A.; Beygelzimer, A. et al.	Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors)
Type	Online ensemble (incremental gradient boosting)	Online ensemble (sequential boosting on streaming data)	Learning paradigm (sequential model update)
Opprinnelig kilde	Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q., & Liu, T.-Y. (2017). LightGBM: A Highly Efficient Gradient Boosting Decision Tree. Advances in Neural Information Processing Systems, 30.	Grubb, A. & Bagnell, J. A. (2011). Generalized Boosting Algorithms for Convex Optimization. Proceedings of the 28th International Conference on Machine Learning (ICML 2011), 1209–1216.	Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194.
Alias	Incremental LightGBM, LightGBM incremental training, streaming LightGBM, continual LightGBM	OGB, streaming gradient boosting, incremental gradient boosting, online boosting with gradient descent	incremental learning, sequential learning, streaming learning, online machine learning
Relaterte	5	6	6
Sammendrag	Online LightGBM applies the Light Gradient-Boosting Machine framework incrementally: instead of requiring all training data at once, the model is updated in mini-batches or data chunks as they arrive. This allows LightGBM's efficient histogram-based boosting to be deployed in streaming, continual-learning, and data-expansion scenarios without retraining from scratch.	Online Gradient Boosting adapts the gradient boosting framework for streaming settings where data arrives one sample at a time rather than as a fixed batch. At each step the model computes a pseudo-residual for the incoming observation and updates a weak learner in place, growing an additive ensemble without storing or revisiting past data. This makes it suitable for real-time prediction and large-scale streaming pipelines where retraining from scratch is infeasible.	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.