Порівняння методів

	Robust XGBoost	Надійна лінійна регресія
Галузь	Машинне навчання	Машинне навчання
Родина	Machine learning	Machine learning
Рік появи	2016 (XGBoost); robust loss concept from 1964	1964–1987
Автор методу	Chen, T. & Guestrin, C. (XGBoost); Huber, P. J. (robust loss)	Huber, P. J.; Rousseeuw, P. J.
Тип	Ensemble (gradient boosting with robust objective)	Outlier-resistant supervised regression
Основоположне джерело	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.	Huber, P. J. (1964). Robust Estimation of a Location Parameter. Annals of Mathematical Statistics, 35(1), 73–101.
Інші назви	XGBoost with Huber loss, outlier-robust gradient boosting, robust GBDT, XGBoost robust regression	robust regression, M-estimator regression, Huber regression, outlier-resistant regression
Пов'язані	6	5
Підсумок	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 linear regression fits a linear model between predictors and a continuous outcome while down-weighting or discarding influential outliers, preventing the few anomalous observations that OLS is famously sensitive to from distorting the entire estimated line. Major variants include Huber regression, iteratively reweighted least squares (IRLS), RANSAC, and Theil-Sen estimation.