방법 비교

	부스팅	온라인 학습
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1990–1997	1958–2000s
창시자	Schapire, R. E.; Freund, Y.	Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors)
유형	Sequential ensemble (iterative reweighting)	Learning paradigm (sequential model update)
원전	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.	Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194.
별칭	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	incremental learning, sequential learning, streaming learning, online machine learning
관련	6	6
요약	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.	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.