Art of DS

Appearance

Palette
Theme
Unlock $20 one time
Sign in, or create an account

Sign in to Art of DSCreate your Art of DS account

We email you a link and a six-digit code. Either one signs you in; there is no password.Enter your email. We send a link and a six-digit code to confirm it — no password to remember. The account is free.

  • You come back to this page, right where you were.
  • Already have an account? The same email simply signs you in.

By continuing you accept the Terms and the Privacy policy.

Your account

Free accountLifetime access

difficulty 3/5

Bagging

Definition

Fitting the same unstable model to many bootstrap resamples of one dataset and averaging the results — variance falls, bias does not, and nothing about the model itself has to change.

Formula
f^bag(x)=1B∑b=1Bf^∗b(x)\hat{f}_{\text{bag}}(x) = \frac{1}{B}\sum_{b=1}^{B} \hat{f}^{*b}(x)

Intuition

A decision tree grown to depth is a nervous model. Move one point, and a split near the root can flip to a different feature entirely, and every split beneath it changes. Two trees grown on two samples from the same population can disagree everywhere while both being reasonable.

That instability is not a defect to be fixed — it is a resource. A model that varies a lot around the right answer is exactly the kind whose average is better than any of its members. Fit it many times on slightly different data, average the predictions, and the idiosyncrasies cancel while the signal, which is the same in every fit, does not.

The trick is where the "slightly different data" comes from, because you only have one dataset. Bootstrap resampling manufactures it: draw n rows with replacement, fit, repeat [2, §7.11].

Formal definition

How it works

Where it's used

Why & when

Worked example

Pitfalls

Check yourself

3 questions

The questions on this page come with access. They are graded on the server, so the answers stay there until you have given yours.

Unlock all quizzes

On the cheat sheet: Tree ensembles →

Sources

  1. scikit-learn User Guide — Ensembles: Gradient boosting, random forests, bagging, voting, stackingdocs · retrieved 2026-09-05https://scikit-learn.org/stable/modules/ensemble.html
  2. Goodfellow, Bengio, Courville. Deep Learning (2016)book · retrieved 2026-10-07https://www.deeplearningbook.org/contents/regularization.html

Have a promo code?

A code that takes 100% off unlocks everything at once. A smaller one takes its share off the price in the payment window: enter the same code there.

Write to support

A question, a problem with access, a refund? Write to us and we answer by email.

What is it about?

Your address is used only to answer you.

Message sent

Thank you. We will reply to the address you gave, by email.

Or write to us directly

support@artofds.com

Message sent Thank you. We will reply to the address you gave, by email.

Check the email address: we need it to reply.

That is our own address. Enter yours, so the reply reaches you.

This address cannot receive email. Check it for a typo.

Write a little more: at least 10 characters.

Too many messages in a short time. Try again in a few minutes.

The message could not be sent. Please write to us directly: support@artofds.com