ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

Povećanje gradijenta×Huberova regresija×LightGBM×
PodručjeStrojno učenjeStatistikaStrojno učenje
ObiteljMachine learningRegression modelMachine learning
Godina nastanka200119642017
TvoracFriedman, J. H.Peter J. HuberKe, G. et al. (Microsoft)
VrstaEnsemble (sequential boosting of decision trees)Robust linear regression (M-estimation)Gradient boosting decision tree ensemble
Temeljni izvorFriedman, 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 ↗Ke, 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 (NeurIPS) 30, 3146–3154. link ↗
Drugi naziviGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineHuber M-estimator, Huber loss regression, robust regression, Huber RegresyonuLightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting
Srodne555
SažetakGradient 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.LightGBM is Microsoft's gradient boosting decision tree implementation, introduced by Ke and colleagues in 2017, that grows trees leaf-wise and bins features into histograms for speed. On large datasets it is much faster than XGBoost while retaining strong predictive accuracy.
ScholarGateSkup podataka
  1. v1
  2. 1 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 1 Izvori
  3. PUBLISHED

Idi na pretraživanje Preuzmi prezentaciju

ScholarGateUsporedite metode: Gradient Boosting · Huber Regression · LightGBM. Preuzeto 2026-06-18 s https://scholargate.app/hr/compare