Salīdzināt metodes
Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.
| Robustā pastiprināšana× | Regularizēta pastiprināšana× | |
|---|---|---|
| Nozare | Mašīnmācīšanās | Mašīnmācīšanās |
| Saime | Machine learning | Machine learning |
| Izcelsmes gads≠ | 1999–2001 | 2001–2016 |
| Autors≠ | Freund, Y.; Mason, L. et al. | Friedman, J. H.; extended by Chen & Guestrin |
| Tips≠ | Ensemble (robust sequential boosting) | Regularized ensemble (boosting with shrinkage/penalty) |
| Pirmavots≠ | Freund, Y. (2001). An adaptive version of the boost by majority algorithm. Machine Learning, 43(3), 293–318. DOI ↗ | Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ |
| Citi nosaukumi | noise-tolerant boosting, robust AdaBoost, boosting with robust losses, outlier-resistant boosting | shrinkage boosting, penalized boosting, regularized gradient boosting, L1/L2 boosting |
| Saistītās≠ | 6 | 5 |
| Kopsavilkums≠ | Robust Boosting modifies standard boosting algorithms — such as AdaBoost or gradient boosting — by replacing the default exponential or squared loss with robust loss functions (e.g., Huber, logistic, or truncated losses) or by incorporating noise-tolerance mechanisms, so that the ensemble remains accurate even when training data contain outliers, label noise, or heavy-tailed errors. | Regularized boosting extends gradient boosting by adding explicit controls — shrinkage (learning rate), L1/L2 weight penalties, subsampling, and tree-complexity limits — to the objective function and the update rule. These constraints reduce overfitting, stabilise the model on noisy or small datasets, and are the core reason why systems such as XGBoost and LightGBM consistently outperform vanilla boosting on real-world tabular benchmarks. |
| ScholarGateDatu kopa ↗ |
|
|