ScholarGate
Асистент

Порівняння методів

Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.

Online LightGBM×Градiєнтний бустинг×LightGBM×Онлайнове градієнтне бустування×Онлайн-навчання×
ГалузьМашинне навчанняМашинне навчанняМашинне навчанняМашинне навчанняМашинне навчання
РодинаMachine learningMachine learningMachine learningMachine learningMachine learning
Рік появи2017 (LightGBM); 2000s (online boosting)200120172011–20151958–2000s
Автор методуKe et al. (LightGBM); Bifet, Gavalda (online boosting theory)Friedman, J. H.Ke, G. et al. (Microsoft)Grubb, A. & Bagnell, J. A.; Beygelzimer, A. et al.Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors)
ТипOnline ensemble (incremental gradient boosting)Ensemble (sequential boosting of decision trees)Gradient boosting decision tree ensembleOnline ensemble (sequential boosting on streaming data)Learning paradigm (sequential model update)
Основоположне джерело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. link ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗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. link ↗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. link ↗Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. DOI ↗
Інші назвиIncremental LightGBM, LightGBM incremental training, streaming LightGBM, continual LightGBMGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineLightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boostingOGB, streaming gradient boosting, incremental gradient boosting, online boosting with gradient descentincremental learning, sequential learning, streaming learning, online machine learning
Пов'язані55566
Підсумок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.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.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.
ScholarGateНабір даних
  1. v1
  2. 2 Джерела
  3. PUBLISHED
  1. v1
  2. 1 Джерела
  3. PUBLISHED
  1. v1
  2. 1 Джерела
  3. PUBLISHED
  1. v1
  2. 2 Джерела
  3. PUBLISHED
  1. v1
  2. 2 Джерела
  3. PUBLISHED

Перейти до пошуку Завантажити слайди

ScholarGateПорівняння методів: Online LightGBM · Gradient Boosting · LightGBM · Online Gradient Boosting · Online Learning. Отримано 2026-06-18 з https://scholargate.app/uk/compare