مقایسهٔ روشها
روشهای انتخابی خود را کنار هم مرور کنید؛ ردیفهای متفاوت برجسته شدهاند.
| افزایش گرادیان آنلاین× | یادگیری آنلاین× | |
|---|---|---|
| حوزه | یادگیری ماشین | یادگیری ماشین |
| خانواده | Machine learning | Machine learning |
| سال پیدایش≠ | 2011–2015 | 1958–2000s |
| پدیدآور≠ | Grubb, A. & Bagnell, J. A.; Beygelzimer, A. et al. | Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors) |
| نوع≠ | Online ensemble (sequential boosting on streaming data) | Learning paradigm (sequential model update) |
| منبع بنیادین≠ | 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 ↗ |
| نامهای دیگر | OGB, streaming gradient boosting, incremental gradient boosting, online boosting with gradient descent | incremental learning, sequential learning, streaming learning, online machine learning |
| مرتبط | 6 | 6 |
| خلاصه≠ | 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مجموعهداده ↗ |
|
|