Machine learningMachine learning

Ensemble Gradient Boosting

Gradient Boosting is an ensemble method introduced by Jerome Friedman in 2001 that builds a strong predictive model by sequentially adding shallow decision trees, each correcting the errors of the previous ensemble. By framing the problem as gradient descent in function space, it achieves state-of-the-art accuracy on classification, regression, and ranking tasks across tabular data.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  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. Friedman, J. H. (2002). Stochastic gradient boosting. Computational Statistics and Data Analysis, 38(4), 367–378. DOI: 10.1016/S0167-9473(01)00065-2

Related methods

ScholarGateEnsemble Gradient Boosting (Gradient Boosting Machine (Ensemble of Additive Decision Trees)). Retrieved 2026-06-04 from https://scholargate.app/en/machine-learning/ensemble-gradient-boosting