Compara mètodes

	XGBoost robust	Gradient Boosting Robust
Camp	Aprenentatge automàtic	Aprenentatge automàtic
Família	Machine learning	Machine learning
Any d'origen	2016 (XGBoost); robust loss concept from 1964	2001
Autor original	Chen, T. & Guestrin, C. (XGBoost); Huber, P. J. (robust loss)	Friedman, J. H. (with Huber loss from Huber, P. J.)
Tipus	Ensemble (gradient boosting with robust objective)	Ensemble (boosted trees with robust loss)
Font seminal	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 785–794.	Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29(5), 1189–1232.
Àlies	XGBoost with Huber loss, outlier-robust gradient boosting, robust GBDT, XGBoost robust regression	gradient boosting with Huber loss, robust GBM, outlier-robust boosting, robust gradient-boosted trees
Relacionats	6	6
Resum	Robust XGBoost combines the scalable gradient boosting framework of XGBoost with robust loss functions — primarily the Huber loss or its variants — to produce a gradient boosted tree ensemble that resists the distorting influence of outliers. By replacing the squared-error objective with a loss that down-weights large residuals, the model delivers reliable predictions on continuous targets even when training data contain extreme values or label noise.	Robust Gradient Boosting is gradient boosting trained with outlier-resistant loss functions — most commonly the Huber loss or quantile (pinball) loss — instead of squared-error loss. Proposed in Friedman's seminal 2001 paper, this variant produces predictions far less distorted by extreme values or contaminated labels, while retaining the full predictive power of gradient-boosted trees.