关键超参数：学习率、n_estimators 与 max_depth
您将通过系统实验跟踪收缩率（学习率）、集成规模和深度对偏差—方差权衡的影响
关键超参数：学习率、n_estimators 与 max_depth 是 CoddyKit 上的免费 Machine Learning Academy 课时。 这是第 4 节课，共 4 节。 你可以在下方免费阅读本课时的完整内容 — 然后在浏览器中使用内置代码编辑器和全天候 AI 导师进行实践。 这是 Machine Learning Academy 学习路径的一部分，你的进度在网页和 CoddyKit 应用中同步。 Machine Learning Academy 课程共包含 4 节课。
本课时的部分内容尚未翻译，以英文显示。
The Holy Trinity of Gradient Boosting
Gradient boosting has three hyperparameters that interact most strongly and have the biggest impact on model performance: learning_rate (how large each tree's contribution is), n_estimators (how many trees to build), and max_depth (how complex each individual tree can be). Understanding how these three interact is the key to effectively tuning any gradient boosting model — whether scikit-learn's GradientBoostingClassifier, XGBoost, or LightGBM.
Learning Rate (Shrinkage) in Depth
The learning rate η (eta) scales each tree's contribution: F_m(x) = F_{m-1}(x) + η × h_m(x). A smaller η means each tree corrects only a fraction of the residual, requiring more trees to converge but producing a smoother, more regularised prediction surface. Typical values: 0.01-0.3. The inverse relationship between learning_rate and n_estimators is crucial: halving the learning rate requires roughly doubling n_estimators to reach the same training loss. Always use early stopping to find the right n_estimators for your chosen learning rate.
from sklearn.ensemble import GradientBoostingClassifier
from sklearn.datasets import load_breast_cancer
from sklearn.model_selection import cross_val_score
X, y = load_breast_cancer(return_X_y=True)
# Inverse relationship between lr and n_estimators
configs = [(0.3, 50), (0.1, 150), (0.05, 300), (0.01, 1000)]
for lr, n in configs:
model = GradientBoostingClassifier(learning_rate=lr, n_estimators=n, max_depth=3, random_state=42)
score = cross_val_score(model, X, y, cv=5).mean()
print(f'lr={lr:.2f}, n={n:4d}: CV={score:.4f}')n_estimators: More Trees, Not Always Better
n_estimators sets the total number of sequential trees in the ensemble. Unlike random forests (where more is always better), boosting models can overfit with too many trees, especially at high learning rates. The sweet spot is found by monitoring validation loss across rounds. With early stopping, you can safely set n_estimators=2000 — training will stop when validation stops improving. Without early stopping, use cross-validation on a range of values and pick the n_estimators at the elbow of the validation error curve.
from sklearn.ensemble import GradientBoostingClassifier
from sklearn.datasets import load_breast_cancer
from sklearn.model_selection import cross_val_score
X, y = load_breast_cancer(return_X_y=True)
for n in [10, 50, 100, 200, 500]:
model = GradientBoostingClassifier(n_estimators=n, learning_rate=0.1, max_depth=3, random_state=42)
score = cross_val_score(model, X, y, cv=5).mean()
print(f'n_estimators={n:4d}: CV accuracy={score:.4f}')max_depth: Weak Learners Win in Boosting
Gradient boosting works best with weak learners — shallow trees (max_depth 2-6). A depth-1 tree (decision stump) captures only one feature interaction per round; a depth-3 tree captures three-way interactions. Deeper trees are more powerful individually, requiring fewer rounds but risking overfitting. Shallower trees need more rounds but generalise better. In practice: start with max_depth=3 for classification, max_depth=4-6 for complex tabular regression. Very deep trees (>8) are almost never optimal in boosting.
from sklearn.ensemble import GradientBoostingClassifier
from sklearn.datasets import load_breast_cancer
from sklearn.model_selection import cross_val_score
X, y = load_breast_cancer(return_X_y=True)
for depth in [1, 2, 3, 5, 8, 15]:
model = GradientBoostingClassifier(n_estimators=200, learning_rate=0.1, max_depth=depth, random_state=42)
train_score = model.fit(X, y).train_score_[-1]
cv_score = cross_val_score(GradientBoostingClassifier(n_estimators=200, learning_rate=0.1, max_depth=depth, random_state=42), X, y, cv=5).mean()
print(f'max_depth={depth:2d}: train={train_score:.4f}, CV={cv_score:.4f}')The Learning Rate - n_estimators Trade-Off
The interaction between learning_rate and n_estimators is the most important trade-off to understand. Consider these scenarios:
- High lr (0.3) + few trees (50): fast training, but risks missing the optimal fit
- Medium lr (0.1) + medium trees (200): the standard starting point
- Low lr (0.01) + many trees (2000): most regularised, best generalisation but slow to train
Training vs Validation Loss Curves
One of the most informative diagnostics in gradient boosting is plotting training and validation loss across boosting rounds. Training loss always decreases monotonically. Validation loss decreases initially but starts to rise when the model overfits. The point where validation loss is minimised is the optimal n_estimators. This plot reveals whether you need more regularisation (validation loss rises quickly), less regularisation (validation loss still decreasing at the end), or whether you have found the sweet spot.
from sklearn.ensemble import GradientBoostingClassifier
from sklearn.datasets import load_breast_cancer
from sklearn.model_selection import train_test_split
import numpy as np
X, y = load_breast_cancer(return_X_y=True)
X_train, X_val, y_train, y_val = train_test_split(X, y, test_size=0.2, random_state=42)
model = GradientBoostingClassifier(n_estimators=300, learning_rate=0.1, max_depth=3, random_state=42)
model.fit(X_train, y_train)
val_scores = [model.estimators_[:i+1] and model.loss_(y_val, model.staged_predict_proba(X_val).__next__()) for i in range(5)]
# Simplified: use staged_predict to check improvement
val_staged = list(model.staged_predict(X_val))
val_acc = [np.mean(p == y_val) for p in val_staged]
print('Val acc at round 50:', round(val_acc[49], 4))
print('Val acc at round 300:', round(val_acc[299], 4))
print('Best round:', np.argmax(val_acc) + 1)Regularisation Beyond the Three Parameters
Beyond learning_rate, n_estimators, and max_depth, gradient boosting offers additional regularisation: min_samples_leaf (minimum examples per leaf, prevents overfitting on tiny leaf groups), subsample (stochastic training, reduces variance), max_features (feature subsampling per split, reduces correlation), min_impurity_decrease (only split if the gain exceeds a threshold). These secondary parameters typically matter less than the primary three but can make a meaningful difference on noisy datasets.
Systematic Hyperparameter Search Strategy
A practical 3-step strategy for gradient boosting tuning: (1) Fix learning_rate=0.1, set n_estimators=1000 with early stopping — find optimal number of rounds; (2) Grid search max_depth (try 3, 4, 5, 6) and min_samples_leaf (try 1, 5, 10) with the tree count from step 1; (3) Lower the learning rate to 0.05 or 0.01 and scale n_estimators accordingly to potentially squeeze out more performance. This avoids the curse of dimensionality from searching all parameters simultaneously.
subsample as a Stochastic Regulariser
Setting subsample < 1.0 (e.g., 0.8) in gradient boosting means each tree is trained on a random 80% of the training data (without replacement). This is called stochastic gradient boosting. The stochastic element introduces diversity among trees (similar to dropout in neural networks) and often improves validation performance by 0.5-2%. A typical value is 0.8. If you reduce it further (0.5), you may need more trees to compensate for the higher variance per tree.
from sklearn.ensemble import GradientBoostingClassifier
from sklearn.datasets import load_breast_cancer
from sklearn.model_selection import cross_val_score
X, y = load_breast_cancer(return_X_y=True)
for ss in [1.0, 0.8, 0.6, 0.5]:
model = GradientBoostingClassifier(n_estimators=200, learning_rate=0.1, max_depth=3,
subsample=ss, random_state=42)
score = cross_val_score(model, X, y, cv=5).mean()
print(f'subsample={ss}: CV accuracy={score:.4f}')Balancing Training Time and Performance
In production, training time is a real constraint. Larger n_estimators and more CV folds multiply linearly. Practical shortcuts: (1) use n_jobs=-1 for cross-validation parallelism; (2) use LightGBM or XGBoost instead of sklearn's GradientBoosting for 5-10x speed gains; (3) use RandomizedSearchCV with 30-50 iterations instead of full grid search; (4) use early stopping within cross-validation folds to automatically set n_estimators. The combination of early stopping + LightGBM + RandomizedSearchCV dramatically reduces tuning time without sacrificing accuracy.
Gradient Boosting Default Hyperparameters
Good default starting points for gradient boosting hyperparameters: learning_rate=0.1, n_estimators=200 (with early stopping on hold-out), max_depth=3 for classification or 4-5 for regression, subsample=0.8 for stochastic regularisation, and min_samples_leaf=5-10 to prevent over-splitting on small groups. These defaults work surprisingly well across many datasets and should be your starting point before any tuning. Only tune if the baseline performance is insufficient for your use case.
from sklearn.ensemble import GradientBoostingClassifier
from sklearn.datasets import load_breast_cancer
from sklearn.model_selection import cross_val_score
X, y = load_breast_cancer(return_X_y=True)
# Good defaults — try these before tuning
default_gb = GradientBoostingClassifier(
learning_rate=0.1, n_estimators=200, max_depth=3,
subsample=0.8, min_samples_leaf=5, random_state=42
)
scores = cross_val_score(default_gb, X, y, cv=5)
print('Default GBM CV:', scores.mean().round(4), '+/-', scores.std().round(4))Quick Check
Test your understanding of gradient boosting hyperparameters from this lesson.
Lesson Recap
In this lesson you learned: learning rate and n_estimators have an inverse relationship — lower lr requires more trees, shallow trees (max_depth 2-5) are preferable in boosting because they act as weak learners, and subsample and min_samples_leaf provide additional regularisation beyond the primary three parameters. Next up we explore K-Fold Cross-Validation and how to evaluate models without leaking test data.
常见问题解答
「关键超参数：学习率、n_estimators 与 max_depth」课时是免费的吗？
是的 — 「关键超参数：学习率、n_estimators 与 max_depth」的完整文本可在网页上免费阅读。要进行交互式练习（内置代码编辑器和全天候 AI 导师）并解锁 Machine Learning Academy 课程的其余内容，请升级到 CoddyKit PRO。 Machine Learning Academy 课程共包含 4 节课。
「关键超参数：学习率、n_estimators 与 max_depth」这节课中我会学到什么？
您将通过系统实验跟踪收缩率（学习率）、集成规模和深度对偏差—方差权衡的影响 你通过在浏览器中直接运行的动手代码来练习 Machine Learning Academy，全天候 AI 导师会在你学习这节课的过程中回答你的问题。
学习 Machine Learning Academy 需要有经验吗？
无需任何先前经验。CoddyKit 上的 Machine Learning Academy 课程适合初学者到高级学习者，你可以从这里开始或从头开始，按照自己的节奏学习。 这是第 4 节课，共 4 节。
「关键超参数：学习率、n_estimators 与 max_depth」课时需要多长时间？
大多数 CoddyKit 课程大约需要 5–10 分钟。每节课都很精短且互动，所以你能稳步进步，并在网页和应用中从离开的地方继续。
我能在这节 Machine Learning Academy 课中编写并运行代码吗？
能。每节 Machine Learning Academy 课都包含内置代码编辑器，你可以在浏览器中直接编写并运行真实代码，并获得即时 AI 反馈 — 无需本地设置。
此课程中的所有课时
- 提升方法直觉：顺序误差修正
- XGBoost：正则化、提前停止与特征重要性
- LightGBM：按叶节点生长与速度优势
- 关键超参数：学习率、n_estimators 与 max_depth