AIToday
Qiita 機械学習Published: Nov 9, 2026, 01:00 JST

XGBoost and Gradient Boosting tie at 0.880 ROC-AUC in tutorial test

Send on LINE
XGBoost and Gradient Boosting tie at 0.880 ROC-AUC in tutorial test

3 Key Points

  1. What happened

    A tutorial ran four models on 2,000 synthetic samples with 12 features. Gradient Boosting scored 0.8802 ROC-AUC and XGBoost 0.8801, versus 0.7153 for a single decision tree and 0.7431 for AdaBoost.

  2. Why it matters

    Under these fixed conditions, XGBoost's added complexity bought no measurable edge over plain Gradient Boosting, suggesting the gap depends on data and settings, not the algorithm name.

Not sure about something? Ask the AI

Questions and answers are published on this page.

Summaries like this, every morning.

Context & Analysis

The tutorial builds its comparison in two stages. First, it tracks a regression example by hand: starting from the mean prediction, it adds small depth-2 decision trees fitted to the residuals, one at a time with a learning rate of 0.45. Training MSE falls from 0.18915 with no trees to 0.01294 after four, illustrating how each tree corrects what the previous ensemble got wrong rather than rebuilding it.

The second exercise moves to binary classification and fixes the same core settings (100 estimators, learning rate 0.1, depth 3) across four models. The near-tie between Gradient Boosting and XGBoost is presented as a lesson in experiment discipline: the tutorial stresses that equal n_estimators does not mean equal model complexity, and that test data was never used for tuning.

The material deliberately stops short of XGBoost's distinctive machinery. Regularization and second-order derivatives are deferred to the next lesson, along with early stopping, which the author notes is not yet automated here. The framing suggests the series treats XGBoost as an extension of ideas the reader has already built by hand, not as a black box.

FAQ
Did XGBoost clearly beat the simpler models?
No. XGBoost and Gradient Boosting finished nearly level at 0.8801 and 0.8802 ROC-AUC. Both were well ahead of the single decision tree (0.7153) and AdaBoost (0.7431).
What data was used for the comparison?
The classification exercise used 2,000 synthetic samples with 12 features, split into train, validation and test sets. It was synthetic data, not real business records.
Does this mean Gradient Boosting is always as good as XGBoost?
The tutorial warns against that reading. It says results shift with the data's nature, tree depth, number of trees and learning rate, so one fixed run does not settle a general ranking.
Qiita 機械学習Read Original Article
Send on LINE

AI news that matters for your work, delivered every morning.

Pick your industry and the AI tools you use, and get news related to your work every day.

Free · 30 seconds with Google · unsubscribe anytimeWhat is AIToday? →

Ask AI

Ask AI anything about this article. The AI reads this article, earlier AIToday articles, and Wikipedia, and cites its sources. Q&As are published on this page for other readers too.

Questions and answers are published on this page.

Next articlePalantir Technologies lands AmeriLife enterprise AI deal