השוואת שיטות

	אנסמבל ערימה חסון	XGBoost
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1992 (stacking); robust variants 2000s–present	2016
הוגה השיטה	Wolpert, D. H. (stacking); robust extensions by multiple authors	Chen, T. & Guestrin, C.
סוג	Ensemble (stacking with robust meta-learner)	Ensemble (gradient-boosted decision trees)
מקור מכונן	Wolpert, D. H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259.	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794.
כינויים	robust stacking, robust stacked generalization, outlier-resistant stacking, stacking with robust meta-learner	XGBoost, extreme gradient boosting, scalable tree boosting
קשורות	5	5
תקציר	Robust Stacking Ensemble extends classical stacked generalization by replacing the ordinary meta-learner with a robust estimator — such as a Huber-loss regressor, quantile regression, or a model trained on trimmed residuals — so that the ensemble's combination layer is resistant to outliers and noisy base-learner predictions. It improves predictive accuracy and reliability on real-world datasets with contaminated labels or heavy-tailed error distributions.	XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions.