手法を比較

	ロバストサポートベクターマシン	ロバスト・ランダム・フォレスト
分野	機械学習	機械学習
系統	Machine learning	Machine learning
提唱年	2006–2009	2000s–2010s
提唱者	Xu, H., Caramanis, C., & Mannor, S.	Various (extensions of Breiman 2001 Random Forest)
種類	Robust supervised classifier / regressor	Robust Ensemble (noise-tolerant bagging of decision trees)
原典	Xu, H., Caramanis, C., & Mannor, S. (2009). Robustness and regularization of support vector machines. Journal of Machine Learning Research, 10, 1485–1510.	Chen, S., & Guestrin, C. (2019). Robust Random Forest. In Proceedings of the 36th International Conference on Machine Learning (ICML). Also see: Gao, W., & Zhou, Z.-H. (2013). On the Doubt about Margin Explanation of Boosting. Artificial Intelligence, 203, 1–18.
別名	Robust SVM, RSVM, noise-tolerant SVM, outlier-robust SVM	RRF, noise-robust random forest, outlier-resistant random forest, robust ensemble forest
関連	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 Random Forest extends the standard Random Forest ensemble by incorporating mechanisms that reduce the influence of outliers, label noise, and corrupted observations. Rather than treating all training instances equally, it applies weighting or filtering strategies so that noisy or anomalous samples contribute less to individual tree splits, yielding predictions that remain reliable even when data quality is imperfect.