In one sentence, what is Gradient Boosting?
mediumAnswer
- Fit a sequence of weak learners (typically shallow trees), where each new learner is trained to predict the negative gradient of the loss w.r.t. the current ensemble's prediction — additive stagewise optimization in function space.
- Final prediction is the sum of the learners' outputs (each scaled by a learning rate).
- Works for any differentiable loss: squared error for regression, log-loss for classification, quantile loss, ranking losses, etc.
Check yourself — multiple choice
- Boosting averages independent trees
- Sequentially fit weak learners to the negative gradient of the loss — additive function-space optimization
- It's the same as bagging with a different name
- It only works for classification
Additive stagewise fitting to the negative gradient of the loss (function-space gradient descent).
#gradient-boosting#boosting#ensembles
Practise Supervised Learning
215 interview questions in this topic.
Related questions
- What is the role of the learning rate (shrinkage) in GBM?
- What did XGBoost bring on top of vanilla GBM?
- What are LightGBM's key innovations vs XGBoost?
- What makes CatBoost different from XGBoost / LightGBM?
- How does early stopping work in gradient boosting and why is it important?
- Random forest vs gradient boosting — which do you pick and why?