Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Регуляризований LightGBM× | CatBoost× | |
|---|---|---|
| Галузь | Машинне навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 2017 | 2018 |
| Автор методу≠ | Ke, G. et al. (Microsoft Research) | Prokhorenkova, L. et al. (Yandex) |
| Тип≠ | Regularized gradient boosting ensemble | Gradient boosting on decision trees |
| Основоположне джерело≠ | 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 ↗ | Prokhorenkova, L., Gusev, G., Vorobev, A., Dorogush, A.V. & Gulin, A. (2018). CatBoost: Unbiased Boosting with Categorical Features. In NeurIPS 2018. DOI ↗ |
| Інші назви | LightGBM with L1/L2 regularization, penalized LightGBM, LightGBM ridge/lasso, regularized LGBM | CatBoost (Categorical Boosting), categorical boosting, ordered boosting, kategorik gradyan artırma |
| Пов'язані | 5 | 5 |
| Підсумок≠ | 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. | CatBoost is a gradient boosting algorithm, introduced by Prokhorenkova and colleagues at Yandex in 2018, that handles categorical variables natively and uses ordered target encoding to avoid label leakage. By building an additive ensemble of trees while permuting the data order at each iteration, it is often superior to XGBoost and LightGBM on category-heavy data. |
| ScholarGateНабір даних ↗ |
|
|