विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| Robust Boosting× | नियमितीकृत बूस्टिंग (Regularized Boosting)× | Robust Gradient Boosting× | |
|---|---|---|---|
| क्षेत्र | मशीन अधिगम | मशीन अधिगम | मशीन अधिगम |
| परिवार | Machine learning | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 1999–2001 | 2001–2016 | 2001 |
| प्रवर्तक≠ | Freund, Y.; Mason, L. et al. | Friedman, J. H.; extended by Chen & Guestrin | Friedman, J. H. (with Huber loss from Huber, P. J.) |
| प्रकार≠ | Ensemble (robust sequential boosting) | Regularized ensemble (boosting with shrinkage/penalty) | Ensemble (boosted trees with robust loss) |
| मौलिक स्रोत≠ | 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 ↗ | Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ |
| उपनाम | noise-tolerant boosting, robust AdaBoost, boosting with robust losses, outlier-resistant boosting | shrinkage boosting, penalized boosting, regularized gradient boosting, L1/L2 boosting | gradient boosting with Huber loss, robust GBM, outlier-robust boosting, robust gradient-boosted trees |
| संबंधित≠ | 6 | 5 | 6 |
| सारांश≠ | 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. | 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. |
| ScholarGateडेटासेट ↗ |
|
|
|