Bagging trains many strong learners in parallel and averages away their disagreements. What if you trained many weak learners instead — one at a time, each one aimed squarely at whatever the last one got wrong?
This pattern has two separate bumps of one class — a single split can only ever capture one boundary well. Dot size is each point's current weight: watch it grow on whatever the last round got wrong, and shrink on whatever it already handles. Each new round's split is chosen to serve exactly the biggest dots on the board.
This is boosting (specifically AdaBoost — short for Adaptive Boosting). Each round trains one weak learner — here, the exact single-split "stump" from Chapter 1 of this part, but scored by weighted error instead of information gain — then reweights the data before the next round:
- — round 's vote weight in the final combined prediction; a more accurate stump gets a bigger .
- — round 's weighted error rate.
- — point 's current weight, updated after every round.
- — point 's true label.
- — round 's stump prediction on point .
- Vote weight scales with accuracy
is round 's weighted error; a more accurate stump gets a bigger (more say in the final vote).
- Reweighting re-tilts the data
The weight update shrinks correctly-classified points and grows misclassified ones — each new stump is trained on data that's been re-tilted toward exactly what's still wrong.
Watch and the combined accuracy together. A single round is stuck at 60% — genuinely weak. The final vote weights every round's opinion by its own , not just a plain majority, so a more confident round can outvote several less confident ones.
- Find round 1's best stump and its weighted error
Splitting at (predict A left, B right), it's wrong on 8 of 20 points — weighted error , since every point starts at weight .
- Compute the stump's vote weight
- Reweight the points
For a point this stump got right, its new weight shrinks by ; for one it got wrong, its weight grows by .
- Read the renormalized result
Weights must sum to 1 again, so divide every point by the new total. With 12 correct points at each and 8 wrong points at each, that total is .
Dividing each point's weight by that total gives the renormalized weight, which we compare against the average (uniform) weight of :
- Correct points: , which is that average
- Wrong points: , which is that average
— exactly the size difference the next round's stump sees before it even starts.
Chain enough rounds to reach the ensemble’s best combined accuracy — 95%. One round alone is a weak learner for a reason.
Bagging cancels noise by averaging independent overfit learners; boosting builds accuracy by chaining weak learners that each specialize in whatever's still unsolved. Neither pass alone reaches this pattern's answer — one round here is stuck at 60%, but five chained rounds reach 95%, each one narrowing in on a smaller and smaller residue of mistakes.