Method evidence record
Robust Gradient Boosting
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.
Source record
Citations copied verbatim from the method’s source record. No claim-level verification is inferred from them.
Robust Gradient Boosting (Gradient Boosting with Robust Loss Functions)
Taxonomic method record · ml-model / machine-learning
- Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29(5), 1189–1232. · DOI 10.1214/aos/1013203451
- Huber, P. J. (1964). Robust Estimation of a Location Parameter. Annals of Mathematical Statistics, 35(1), 73–101. · DOI 10.1214/aoms/1177703732
Curated claims
Claims persisted in the evidence ledger, each with its own assessment.
No curated claims yet
This view does not invent a claim assessment when the ledger has none.
Related methods
Generated from the method graph and shown as machine-suggested relations — no evidence claim is inferred.