Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Boosting Robust (Robust Boosting)× | Gradient Boosting Robust× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 1999–2001 | 2001 |
| Autorul original≠ | Freund, Y.; Mason, L. et al. | Friedman, J. H. (with Huber loss from Huber, P. J.) |
| Tip≠ | Ensemble (robust sequential boosting) | Ensemble (boosted trees with robust loss) |
| Sursa seminală≠ | 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 ↗ |
| Denumiri alternative | noise-tolerant boosting, robust AdaBoost, boosting with robust losses, outlier-resistant boosting | gradient boosting with Huber loss, robust GBM, outlier-robust boosting, robust gradient-boosted trees |
| Înrudite | 6 | 6 |
| Rezumat≠ | 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. | Robust Gradient Boosting is gradient boosting trained with outlier-resistant loss functions — most commonly the Huber loss or quantile (pinball) loss — instead of squared-error loss. Proposed in Friedman's seminal 2001 paper, this variant produces predictions far less distorted by extreme values or contaminated labels, while retaining the full predictive power of gradient-boosted trees. |
| ScholarGateSet de date ↗ |
|
|