방법 비교

	로버스트 부스팅(Robust Boosting)	부스팅
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1999–2001	1990–1997
창시자	Freund, Y.; Mason, L. et al.	Schapire, R. E.; Freund, Y.
유형	Ensemble (robust sequential boosting)	Sequential ensemble (iterative reweighting)
원전	Freund, Y. (2001). An adaptive version of the boost by majority algorithm. Machine Learning, 43(3), 293–318.	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.
별칭	noise-tolerant boosting, robust AdaBoost, boosting with robust losses, outlier-resistant boosting	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
관련	6	6
요약	Robust Boosting modifies standard boosting algorithms — such as AdaBoost or gradient boosting — by replacing the default exponential or squared loss with robust loss functions (e.g., Huber, logistic, or truncated losses) or by incorporating noise-tolerance mechanisms, so that the ensemble remains accurate even when training data contain outliers, label noise, or heavy-tailed errors.	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.