// ◇ Classical Machine Learning
Gradient Boosting (GBDT)
Adds small trees one by one, each fixing the previous ensemble's errors.
梯度提升树 2001 Foundational core
IN PLAIN WORDS
Gradient descent in function space: each round fits a small tree to the residuals (negative gradient) and adds it in. It underlies XGBoost and LightGBM.
Used in: Search ranking, risk scoring, Kaggle tabular competitions
TIMELINE · prerequisites → this → what builds on it
01Original paper
Greedy function approximation: A gradient boosting machine.
Friedman et al. · The Annals of Statistics · 2001
DOI ↗ ✓ Verified · Crossref API doi:10.1214/aos/1013203451
02Where it sits
Learn the left column first; the right column builds on this one.
Related:Random ForestAdaBoost
Left: prerequisites · right: builds on this · dashed: related. Full map →
03Learning resources
Official docs, explainers, courses and reference code. All links checked.
04Where the course teaches it
On learning paths:Zero to Deep Learning
For AI / data
- Verification: verified, checked 2026-10-21.
- JSON: /api/learn/algorithms.json (id:
gbdt)