방법 비교

	로버스트 서포트 벡터 머신	Robust Gradient Boosting
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2006–2009	2001
창시자	Xu, H., Caramanis, C., & Mannor, S.	Friedman, J. H. (with Huber loss from Huber, P. J.)
유형	Robust supervised classifier / regressor	Ensemble (boosted trees with robust loss)
원전	Xu, H., Caramanis, C., & Mannor, S. (2009). Robustness and regularization of support vector machines. Journal of Machine Learning Research, 10, 1485–1510.	Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29(5), 1189–1232.
별칭	Robust SVM, RSVM, noise-tolerant SVM, outlier-robust SVM	gradient boosting with Huber loss, robust GBM, outlier-robust boosting, robust gradient-boosted trees
관련	5	6
요약	Robust SVM extends the standard support vector machine to resist the influence of outliers and mislabeled points. By replacing the hinge loss with a bounded or non-convex loss function — or by incorporating robust optimization constraints — it learns a decision boundary that is far less distorted by corrupted training examples, making it suitable for noisy real-world datasets where standard SVM would degrade significantly.	Robust Gradient Boosting is gradient boosting trained with outlier-resistant loss functions — most commonly the Huber loss or quantile (pinball) loss — instead of squared-error loss. Proposed in Friedman's seminal 2001 paper, this variant produces predictions far less distorted by extreme values or contaminated labels, while retaining the full predictive power of gradient-boosted trees.