Bandingkan kaedah

	LightGBM	Peningkatkan Cerun Dalam Talian	Pembelajaran Dalam Talian
Bidang	Pembelajaran Mesin	Pembelajaran Mesin	Pembelajaran Mesin
Keluarga	Machine learning	Machine learning	Machine learning
Tahun asal	2017	2011–2015	1958–2000s
Pengasas	Ke, G. et al. (Microsoft)	Grubb, A. & Bagnell, J. A.; Beygelzimer, A. et al.	Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors)
Jenis	Gradient boosting decision tree ensemble	Online ensemble (sequential boosting on streaming data)	Learning paradigm (sequential model update)
Sumber perintis	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 (NeurIPS) 30, 3146–3154.	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	LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting	OGB, streaming gradient boosting, incremental gradient boosting, online boosting with gradient descent	incremental learning, sequential learning, streaming learning, online machine learning
Berkaitan	5	6	6
Ringkasan	LightGBM is Microsoft's gradient boosting decision tree implementation, introduced by Ke and colleagues in 2017, that grows trees leaf-wise and bins features into histograms for speed. On large datasets it is much faster than XGBoost while retaining strong predictive accuracy.	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.