ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

Povećanje gradijenta×Kvantilna regresija×
PodručjeStrojno učenjeEkonometrija
ObiteljMachine learningRegression model
Godina nastanka20011978
TvoracFriedman, J. H.Koenker & Bassett
VrstaEnsemble (sequential boosting of decision trees)Conditional quantile regression
Temeljni izvorFriedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗Koenker, R. & Bassett, G., Jr. (1978). Regression Quantiles. Econometrica, 46(1), 33-50. DOI ↗
Drugi naziviGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineconditional quantile regression, regression quantiles, Kantil Regresyon
Srodne55
SažetakGradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.Quantile regression models conditional quantiles of an outcome - the median, the 25th or 75th percentile, and so on - rather than the conditional mean that OLS targets. Introduced by Koenker and Bassett in 1978, it reveals how predictors act across the whole distribution, including its tails.
ScholarGateSkup podataka
  1. v1
  2. 1 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretraživanje Preuzmi prezentaciju

ScholarGateUsporedite metode: Gradient Boosting · Quantile Regression. Preuzeto 2026-06-19 s https://scholargate.app/hr/compare