Σύγκριση μεθόδων

	Ενισχυμένη Ανθεκτικότητα (Robust Boosting)	Ενίσχυση Κλίσης (Gradient Boosting)	Ενισχυμένη Ενίσχυση (Regularized Boosting)
Πεδίο	Μηχανική Μάθηση	Μηχανική Μάθηση	Μηχανική Μάθηση
Οικογένεια	Machine learning	Machine learning	Machine learning
Έτος προέλευσης	1999–2001	2001	2001–2016
Δημιουργός	Freund, Y.; Mason, L. et al.	Friedman, J. H.	Friedman, J. H.; extended by Chen & Guestrin
Τύπος	Ensemble (robust sequential boosting)	Ensemble (sequential boosting of decision trees)	Regularized ensemble (boosting with shrinkage/penalty)
Θεμελιώδης πηγή	Freund, Y. (2001). An adaptive version of the boost by majority algorithm. Machine Learning, 43(3), 293–318.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.	Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29(5), 1189–1232.
Εναλλακτικές ονομασίες	noise-tolerant boosting, robust AdaBoost, boosting with robust losses, outlier-resistant boosting	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine	shrinkage boosting, penalized boosting, regularized gradient boosting, L1/L2 boosting
Συναφείς	6	5	5
Σύνοψη	Robust Boosting modifies standard boosting algorithms — such as AdaBoost or gradient boosting — by replacing the default exponential or squared loss with robust loss functions (e.g., Huber, logistic, or truncated losses) or by incorporating noise-tolerance mechanisms, so that the ensemble remains accurate even when training data contain outliers, label noise, or heavy-tailed errors.	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.	Regularized boosting extends gradient boosting by adding explicit controls — shrinkage (learning rate), L1/L2 weight penalties, subsampling, and tree-complexity limits — to the objective function and the update rule. These constraints reduce overfitting, stabilise the model on noisy or small datasets, and are the core reason why systems such as XGBoost and LightGBM consistently outperform vanilla boosting on real-world tabular benchmarks.