手法を比較

	オンライン勾配ブースティング	ブースティング	勾配ブースティング
分野	機械学習	機械学習	機械学習
系統	Machine learning	Machine learning	Machine learning
提唱年	2011–2015	1990–1997	2001
提唱者	Grubb, A. & Bagnell, J. A.; Beygelzimer, A. et al.	Schapire, R. E.; Freund, Y.	Friedman, J. H.
種類	Online ensemble (sequential boosting on streaming data)	Sequential ensemble (iterative reweighting)	Ensemble (sequential boosting of decision trees)
原典	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.	Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.
別名	OGB, streaming gradient boosting, incremental gradient boosting, online boosting with gradient descent	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
関連	6	6	5
概要	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.	Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.	Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.