Concept
Gradient-boosted trees
Gradient-boosted trees (GBTs) are an ensemble method that builds many shallow decision trees in sequence, where each new tree fits the residual errors left by the trees before it. Think of a single decision tree, except instead of one deep tree that overfits, you get…
The rest of “Gradient-boosted trees” is a premium feature: every concept in the library gets a precise, practitioner-focused write-up like this one, cross-linked straight from the paper summaries that use it.
Log in to unlock→