Jämför metoder

	Robust Stacking Ensemble	Boosting	Gradient Boosting
Ämnesområde	Maskininlärning	Maskininlärning	Maskininlärning
Familj	Machine learning	Machine learning	Machine learning
Ursprungsår	1992 (stacking); robust variants 2000s–present	1990–1997	2001
Upphovsperson	Wolpert, D. H. (stacking); robust extensions by multiple authors	Schapire, R. E.; Freund, Y.	Friedman, J. H.
Typ	Ensemble (stacking with robust meta-learner)	Sequential ensemble (iterative reweighting)	Ensemble (sequential boosting of decision trees)
Ursprungskälla	Wolpert, D. H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259.	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.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.
Alias	robust stacking, robust stacked generalization, outlier-resistant stacking, stacking with robust meta-learner	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
Närliggande	5	6	5
Sammanfattning	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.	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.	Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.