Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Gradient Boosting× | Regresia Huber× | LightGBM× | |
|---|---|---|---|
| Domeniu≠ | Învățare automată | Statistică | Învățare automată |
| Familie≠ | Machine learning | Regression model | Machine learning |
| Anul apariției≠ | 2001 | 1964 | 2017 |
| Autorul original≠ | Friedman, J. H. | Peter J. Huber | Ke, G. et al. (Microsoft) |
| Tip≠ | Ensemble (sequential boosting of decision trees) | Robust linear regression (M-estimation) | Gradient boosting decision tree ensemble |
| Sursa seminală≠ | 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 ↗ | 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 ↗ |
| Denumiri alternative | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine | Huber M-estimator, Huber loss regression, robust regression, Huber Regresyonu | LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting |
| Înrudite | 5 | 5 | 5 |
| Rezumat≠ | 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. | 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. |
| ScholarGateSet de date ↗ |
|
|
|