2013-07-22 23:31:15 +08:00
|
|
|
"""
|
2013-07-23 20:25:00 +08:00
|
|
|
======================================
|
|
|
|
|
Gradient Boosting Out-of-Bag estimates
|
|
|
|
|
======================================
|
2013-07-22 23:31:15 +08:00
|
|
|
|
2013-07-23 20:25:00 +08:00
|
|
|
Out-of-bag (OOB) estimates can be a useful heuristic to estimate
|
|
|
|
|
the "optimal" number of boosting iterations.
|
2013-07-23 23:14:38 +08:00
|
|
|
OOB estimates are almost identical to cross-validation estimates but
|
|
|
|
|
they can be computed on-the-fly without the need for repeated model
|
|
|
|
|
fitting.
|
|
|
|
|
OOB estimates are only available for Stochastic Gradient Boosting
|
|
|
|
|
(i.e. ``subsample < 1.0``), the estimates are derived from the improvement
|
2015-01-16 04:09:35 +08:00
|
|
|
in loss based on the examples not included in the bootstrap sample
|
2013-07-24 17:14:40 +08:00
|
|
|
(the so-called out-of-bag examples).
|
2013-07-23 20:25:00 +08:00
|
|
|
The OOB estimator is a pessimistic estimator of the true
|
2013-07-23 16:45:44 +08:00
|
|
|
test loss, but remains a fairly good approximation for a small number of trees.
|
|
|
|
|
|
|
|
|
|
The figure shows the cumulative sum of the negative OOB improvements
|
|
|
|
|
as a function of the boosting iteration. As you can see, it tracks the test
|
|
|
|
|
loss for the first hundred iterations but then diverges in a
|
|
|
|
|
pessimistic way.
|
|
|
|
|
The figure also shows the performance of 3-fold cross validation which
|
2013-07-24 17:14:40 +08:00
|
|
|
usually gives a better estimate of the test loss
|
|
|
|
|
but is computationally more demanding.
|
2013-07-22 23:31:15 +08:00
|
|
|
"""
|
|
|
|
|
print(__doc__)
|
|
|
|
|
|
|
|
|
|
# Author: Peter Prettenhofer <peter.prettenhofer@gmail.com>
|
|
|
|
|
#
|
|
|
|
|
# License: BSD 3 clause
|
|
|
|
|
|
|
|
|
|
import numpy as np
|
2014-02-27 17:22:21 +08:00
|
|
|
import matplotlib.pyplot as plt
|
2013-07-22 23:31:15 +08:00
|
|
|
|
|
|
|
|
from sklearn import ensemble
|
2015-09-11 02:26:39 +08:00
|
|
|
from sklearn.model_selection import KFold
|
|
|
|
|
from sklearn.model_selection import train_test_split
|
2013-07-22 23:31:15 +08:00
|
|
|
|
|
|
|
|
|
2013-07-23 20:25:00 +08:00
|
|
|
# Generate data (adapted from G. Ridgeway's gbm example)
|
2013-07-23 20:26:56 +08:00
|
|
|
n_samples = 1000
|
2013-07-23 20:28:25 +08:00
|
|
|
random_state = np.random.RandomState(13)
|
|
|
|
|
x1 = random_state.uniform(size=n_samples)
|
|
|
|
|
x2 = random_state.uniform(size=n_samples)
|
|
|
|
|
x3 = random_state.randint(0, 4, size=n_samples)
|
2013-07-22 23:31:15 +08:00
|
|
|
|
|
|
|
|
p = 1 / (1.0 + np.exp(-(np.sin(3 * x1) - 4 * x2 + x3)))
|
2013-07-23 20:28:25 +08:00
|
|
|
y = random_state.binomial(1, p, size=n_samples)
|
2013-07-23 00:29:50 +08:00
|
|
|
|
2013-07-22 23:31:15 +08:00
|
|
|
X = np.c_[x1, x2, x3]
|
|
|
|
|
|
|
|
|
|
X = X.astype(np.float32)
|
2013-07-23 16:45:44 +08:00
|
|
|
X_train, X_test, y_train, y_test = train_test_split(X, y, test_size=0.5,
|
|
|
|
|
random_state=9)
|
2013-07-22 23:31:15 +08:00
|
|
|
|
2013-07-23 20:25:00 +08:00
|
|
|
# Fit classifier with out-of-bag estimates
|
2013-07-23 16:45:44 +08:00
|
|
|
params = {'n_estimators': 1200, 'max_depth': 3, 'subsample': 0.5,
|
2013-07-22 23:31:15 +08:00
|
|
|
'learning_rate': 0.01, 'min_samples_leaf': 1, 'random_state': 3}
|
|
|
|
|
clf = ensemble.GradientBoostingClassifier(**params)
|
|
|
|
|
|
|
|
|
|
clf.fit(X_train, y_train)
|
|
|
|
|
acc = clf.score(X_test, y_test)
|
2013-07-24 00:35:29 +08:00
|
|
|
print("Accuracy: {:.4f}".format(acc))
|
2013-07-22 23:31:15 +08:00
|
|
|
|
|
|
|
|
n_estimators = params['n_estimators']
|
|
|
|
|
x = np.arange(n_estimators) + 1
|
|
|
|
|
|
|
|
|
|
|
2013-07-23 00:29:50 +08:00
|
|
|
def heldout_score(clf, X_test, y_test):
|
2013-07-23 20:25:00 +08:00
|
|
|
"""compute deviance scores on ``X_test`` and ``y_test``. """
|
2013-07-23 00:29:50 +08:00
|
|
|
score = np.zeros((n_estimators,), dtype=np.float64)
|
|
|
|
|
for i, y_pred in enumerate(clf.staged_decision_function(X_test)):
|
|
|
|
|
score[i] = clf.loss_(y_test, y_pred)
|
|
|
|
|
return score
|
2013-07-22 23:31:15 +08:00
|
|
|
|
|
|
|
|
|
2016-08-17 04:56:55 +08:00
|
|
|
def cv_estimate(n_splits=3):
|
|
|
|
|
cv = KFold(n_splits=n_splits)
|
2013-07-23 00:29:50 +08:00
|
|
|
cv_clf = ensemble.GradientBoostingClassifier(**params)
|
|
|
|
|
val_scores = np.zeros((n_estimators,), dtype=np.float64)
|
2015-09-11 02:26:39 +08:00
|
|
|
for train, test in cv.split(X_train, y_train):
|
2013-07-23 00:29:50 +08:00
|
|
|
cv_clf.fit(X_train[train], y_train[train])
|
|
|
|
|
val_scores += heldout_score(cv_clf, X_train[test], y_train[test])
|
2016-08-17 04:56:55 +08:00
|
|
|
val_scores /= n_splits
|
2013-07-23 00:29:50 +08:00
|
|
|
return val_scores
|
2013-07-22 23:31:15 +08:00
|
|
|
|
|
|
|
|
|
2013-07-23 20:25:00 +08:00
|
|
|
# Estimate best n_estimator using cross-validation
|
2013-07-23 00:29:50 +08:00
|
|
|
cv_score = cv_estimate(3)
|
|
|
|
|
|
2013-07-23 20:25:00 +08:00
|
|
|
# Compute best n_estimator for test data
|
|
|
|
|
test_score = heldout_score(clf, X_test, y_test)
|
|
|
|
|
|
|
|
|
|
# negative cumulative sum of oob improvements
|
2013-07-23 00:29:50 +08:00
|
|
|
cumsum = -np.cumsum(clf.oob_improvement_)
|
2013-07-23 20:25:00 +08:00
|
|
|
|
|
|
|
|
# min loss according to OOB
|
2013-07-23 00:29:50 +08:00
|
|
|
oob_best_iter = x[np.argmin(cumsum)]
|
2013-07-23 20:25:00 +08:00
|
|
|
|
|
|
|
|
# min loss according to test (normalize such that first loss is 0)
|
2013-07-23 00:29:50 +08:00
|
|
|
test_score -= test_score[0]
|
2013-07-23 16:45:44 +08:00
|
|
|
test_best_iter = x[np.argmin(test_score)]
|
2013-07-23 20:25:00 +08:00
|
|
|
|
|
|
|
|
# min loss according to cv (normalize such that first loss is 0)
|
2013-07-23 00:29:50 +08:00
|
|
|
cv_score -= cv_score[0]
|
2013-07-23 16:45:44 +08:00
|
|
|
cv_best_iter = x[np.argmin(cv_score)]
|
2013-07-23 00:29:50 +08:00
|
|
|
|
2013-07-23 20:25:00 +08:00
|
|
|
# color brew for the three curves
|
2014-02-02 19:52:31 +08:00
|
|
|
oob_color = list(map(lambda x: x / 256.0, (190, 174, 212)))
|
|
|
|
|
test_color = list(map(lambda x: x / 256.0, (127, 201, 127)))
|
|
|
|
|
cv_color = list(map(lambda x: x / 256.0, (253, 192, 134)))
|
2013-07-23 00:29:50 +08:00
|
|
|
|
2013-07-23 20:25:00 +08:00
|
|
|
# plot curves and vertical lines for best iterations
|
2013-07-24 01:44:15 +08:00
|
|
|
plt.plot(x, cumsum, label='OOB loss', color=oob_color)
|
|
|
|
|
plt.plot(x, test_score, label='Test loss', color=test_color)
|
|
|
|
|
plt.plot(x, cv_score, label='CV loss', color=cv_color)
|
|
|
|
|
plt.axvline(x=oob_best_iter, color=oob_color)
|
|
|
|
|
plt.axvline(x=test_best_iter, color=test_color)
|
|
|
|
|
plt.axvline(x=cv_best_iter, color=cv_color)
|
2013-07-22 23:31:15 +08:00
|
|
|
|
2013-07-23 20:25:00 +08:00
|
|
|
# add three vertical lines to xticks
|
2013-07-24 01:44:15 +08:00
|
|
|
xticks = plt.xticks()
|
2013-07-23 16:45:44 +08:00
|
|
|
xticks_pos = np.array(xticks[0].tolist() +
|
|
|
|
|
[oob_best_iter, cv_best_iter, test_best_iter])
|
2014-02-02 19:52:31 +08:00
|
|
|
xticks_label = np.array(list(map(lambda t: int(t), xticks[0])) +
|
2013-07-23 16:45:44 +08:00
|
|
|
['OOB', 'CV', 'Test'])
|
|
|
|
|
ind = np.argsort(xticks_pos)
|
|
|
|
|
xticks_pos = xticks_pos[ind]
|
|
|
|
|
xticks_label = xticks_label[ind]
|
2013-07-24 01:44:15 +08:00
|
|
|
plt.xticks(xticks_pos, xticks_label)
|
2013-07-23 16:45:44 +08:00
|
|
|
|
2013-07-24 01:44:15 +08:00
|
|
|
plt.legend(loc='upper right')
|
|
|
|
|
plt.ylabel('normalized loss')
|
|
|
|
|
plt.xlabel('number of iterations')
|
2013-07-22 23:31:15 +08:00
|
|
|
|
2013-07-24 01:44:15 +08:00
|
|
|
plt.show()
|