Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Online LightGBM× | Онлайн-навчання× | |
|---|---|---|
| Галузь | Машинне навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 2017 (LightGBM); 2000s (online boosting) | 1958–2000s |
| Автор методу≠ | Ke et al. (LightGBM); Bifet, Gavalda (online boosting theory) | Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors) |
| Тип≠ | Online ensemble (incremental gradient boosting) | 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 ↗ | 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 LightGBM | incremental learning, sequential learning, streaming learning, online machine learning |
| Пов'язані≠ | 5 | 6 |
| Підсумок≠ | 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 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Набір даних ↗ |
|
|