ScholarGate
Assistent
Machine learningMachine learning

Regularisert Boosting

Regularisert boosting utvider gradient boosting ved å legge til eksplisitte kontroller — krymping (læringsrate), L1/L2 vektstraffer, sub-sampling og grenser for trekompleksitet — til objektivfunksjonen og oppdateringsregelen. Disse begrensningene reduserer overtilpasning, stabiliserer modellen på støyende eller små datasett, og er hovedgrunnen til at systemer som XGBoost og LightGBM konsekvent overgår ren boosting på virkelige tabulære benchmarks.

Åpne i MethodMindSnartVideoSnartDownload slides

Les hele metoden

Kun for medlemmer

Logg inn med en gratis konto for å lese denne delen.

Logg inn

Method map

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

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. Chen, T., & Guestrin, C. (2016). XGBoost: A scalable tree boosting system. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 785–794. DOI: 10.1145/2939672.2939785

Slik siterer du denne siden

ScholarGate. (2026, June 3). Regularized Gradient Boosting (Shrinkage and Penalized Objective Boosting). ScholarGate. https://scholargate.app/no/machine-learning/regularized-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

Referert av

ScholarGateRegularized Boosting (Regularized Gradient Boosting (Shrinkage and Penalized Objective Boosting)). Hentet 2026-06-15 fra https://scholargate.app/no/machine-learning/regularized-boosting · Datasett: https://doi.org/10.5281/zenodo.20539026