It earns a place when
- Use gradient boosting for strong tabular performance, especially when careful validation and feature handling are available.
- You can evaluate it against a credible baseline.
- Its output fits the decision and data constraints.
Machine learning models · Phase 2 · Lesson 16
Understand boosting as sequential error correction and compare major gradient-boosted tree implementations.
Understand boosting as sequential error correction and compare major gradient-boosted tree implementations.
Each new small tree concentrates on what the current ensemble still gets wrong. The ensemble grows in a direction that reduces the loss.
At stage t, a weak learner approximates the negative gradient of the loss with respect to current predictions. A learning rate controls how much each learner contributes.
A boosted model for late payments starts with a simple prediction, then adds shallow trees that correct residual structure involving account age, payment history and usage.
When a result looks surprisingly good, inspect the split, target timing, error slices and data-generating process before celebrating.
Use this as a small experiment rather than a recipe to copy blindly. Change one thing, record the result and explain the change.
Answer from memory first. The buttons reveal feedback, but the durable step is explaining why.
1. What does each boosting learner mainly do?
2. What does a learning rate control?
3. Why can boosting overfit?
scikit-learn User Guide. Use the source for the deeper treatment after you can explain the lesson's core idea without looking.