ScholarGate
Assistent
Machine learningMachine learning

Robust Gradient Boosting

Robust Gradient Boosting er gradient boosting trænet med outlier-resistente tabsfunktioner — oftest Huber-tabet eller kvantil- (pinball) tabet — i stedet for fejlkvadrattab. Denne variant, foreslået i Friedmans banebrydende artikel fra 2001, producerer forudsigelser, der er langt mindre forvrængede af ekstreme værdier eller kontaminerede etiketter, samtidig med at den fulde forudsigelseskraft af gradient-boostede træer bevares.

Åbn i MethodMindSnartVideoSnartDownload slides

Læs hele metoden

Kun for medlemmer

Log ind med en gratis konto for at læse dette afsnit.

Log ind

Method map

The neighbourhood of related methods — select a node to explore.

+2 more

Kilder

  1. Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29(5), 1189–1232. DOI: 10.1214/aos/1013203451
  2. Huber, P. J. (1964). Robust Estimation of a Location Parameter. Annals of Mathematical Statistics, 35(1), 73–101. DOI: 10.1214/aoms/1177703732

Sådan citerer du denne side

ScholarGate. (2026, June 3). Robust Gradient Boosting (Gradient Boosting with Robust Loss Functions). ScholarGate. https://scholargate.app/da/machine-learning/robust-gradient-boosting

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side

Refereret af

ScholarGateRobust Gradient Boosting (Robust Gradient Boosting (Gradient Boosting with Robust Loss Functions)). Hentet 2026-06-15 fra https://scholargate.app/da/machine-learning/robust-gradient-boosting · Datasæt: https://doi.org/10.5281/zenodo.20539026