ScholarGate
Asistente

Comparar métodos

Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.

LightGBM Robusto×Gradient Boosting×Regresión de Huber×
CampoAprendizaje automáticoAprendizaje automáticoEstadística
FamiliaMachine learningMachine learningRegression model
Año de origen2017 (LightGBM); robust variants widely adopted 2018–present20011964
Autor originalKe, G. et al. (LightGBM); robust objectives adapted from Friedman, J. H.Friedman, J. H.Peter J. Huber
TipoEnsemble (gradient boosted decision trees with robust loss)Ensemble (sequential boosting of decision trees)Robust linear regression (M-estimation)
Fuente seminalKe, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q., & Liu, T.-Y. (2017). LightGBM: A Highly Efficient Gradient Boosting Decision Tree. Advances in Neural Information Processing Systems, 30, 3146–3154. link ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗Huber, P. J. (1964). Robust Estimation of a Location Parameter. Annals of Mathematical Statistics, 35(1), 73-101. DOI ↗
AliasRobust LGBM, LightGBM with Huber loss, outlier-resistant gradient boosting, robust gradient boosted treesGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineHuber M-estimator, Huber loss regression, robust regression, Huber Regresyonu
Relacionados655
ResumenRobust LightGBM is a gradient boosting framework that pairs Microsoft's highly efficient LightGBM engine with outlier-resistant loss functions — most commonly Huber, quantile, or mean absolute error — so that predictions are not unduly distorted by extreme or erroneous observations. It retains LightGBM's speed and leaf-wise tree growth while providing resistance to heavy-tailed noise in the target variable.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.Huber regression is a robust linear regression method, introduced by Peter J. Huber in 1964, that resists the influence of outliers by treating small and large residuals differently. It applies a squared (OLS-like) loss to small residuals and a milder absolute-value loss to large ones, so extreme observations cannot dominate the fit.
ScholarGateConjunto de datos
  1. v1
  2. 2 Fuentes
  3. PUBLISHED
  1. v1
  2. 1 Fuentes
  3. PUBLISHED
  1. v1
  2. 2 Fuentes
  3. PUBLISHED

Ir a la búsqueda Descargar diapositivas

ScholarGateComparar métodos: Robust LightGBM · Gradient Boosting · Huber Regression. Recuperado el 2026-06-18 de https://scholargate.app/es/compare