Comparer des méthodes

	Empilement robuste ensembliste	Bagging (Bootstrap Aggregating)	Boosting
Domaine	Apprentissage automatique	Apprentissage automatique	Apprentissage automatique
Famille	Machine learning	Machine learning	Machine learning
Année d'origine	1992 (stacking); robust variants 2000s–present	1996	1990–1997
Auteur d'origine	Wolpert, D. H. (stacking); robust extensions by multiple authors	Breiman, L.	Schapire, R. E.; Freund, Y.
Type	Ensemble (stacking with robust meta-learner)	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Sequential ensemble (iterative reweighting)
Source fondatrice	Wolpert, D. H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259.	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.	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.
Alias	robust stacking, robust stacked generalization, outlier-resistant stacking, stacking with robust meta-learner	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
Apparentées	5	5	6
Résumé	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.	Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.	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.