Võrdle meetodeid
Vaata valitud meetodeid kõrvuti; erinevad read on esile tõstetud.
| Reguleeritud gradienttugevdus× | Regularized LightGBM× | |
|---|---|---|
| Valdkond | Masinõpe | Masinõpe |
| Perekond | Machine learning | Machine learning |
| Tekkeaasta≠ | 2001 (gradient boosting); 2016 (explicit L1/L2 regularization in XGBoost) | 2017 |
| Looja≠ | Chen, T. & Guestrin, C. (building on Friedman, J. H.) | Ke, G. et al. (Microsoft Research) |
| Tüüp≠ | Regularized ensemble (additive tree model) | Regularized gradient boosting ensemble |
| Algallikas≠ | 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. 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, 30, 3146–3154. link ↗ |
| Rööpnimetused | penalized gradient boosting, shrinkage-regularized boosting, XGBoost-style regularization, L1/L2 gradient boosting | LightGBM with L1/L2 regularization, penalized LightGBM, LightGBM ridge/lasso, regularized LGBM |
| Seotud≠ | 6 | 5 |
| Kokkuvõte≠ | Regularized gradient boosting extends the classic additive tree ensemble (Friedman 2001) by embedding L1 and L2 penalty terms directly into the training objective, along with a complexity penalty on tree size. Popularized by XGBoost (Chen & Guestrin 2016), this framework reduces overfitting and improves generalization compared to unpenalized boosting, while retaining the method's characteristic accuracy on tabular data. | Regularized LightGBM applies L1 (lasso) and L2 (ridge) penalty terms to the leaf weight objective of LightGBM — Microsoft's highly efficient gradient boosting framework — to control model complexity, reduce overfitting, and improve generalization on tabular classification and regression tasks with high-dimensional or noisy feature sets. |
| ScholarGateAndmestik ↗ |
|
|