MLLGSTMENov 29, 2023

Are Ensembles Getting Better all the Time?

arXiv:2311.17885v36 citationsh-index: 14
Originality Incremental advance
AI Analysis

This provides theoretical insights for practitioners using ensemble methods like random forests or deep ensembles, though it is incremental as it builds on existing ensemble theory.

The paper investigates whether adding more models to an ensemble always improves performance, showing that this depends on the convexity of the loss function: with convex loss, performance improves with more models, while with nonconvex loss, good ensembles get better and bad ones get worse.

Ensemble methods combine the predictions of several base models. We study whether or not including more models always improves their average performance. This question depends on the kind of ensemble considered, as well as the predictive metric chosen. We focus on situations where all members of the ensemble are a priori expected to perform equally well, which is the case of several popular methods such as random forests or deep ensembles. In this setting, we show that ensembles are getting better all the time if, and only if, the considered loss function is convex. More precisely, in that case, the loss of the ensemble is a decreasing function of the number of models. When the loss function is nonconvex, we show a series of results that can be summarised as: ensembles of good models keep getting better, and ensembles of bad models keep getting worse. To this end, we prove a new result on the monotonicity of tail probabilities that may be of independent interest. We illustrate our results on a medical problem (diagnosing melanomas using neural nets) and a "wisdom of crowds" experiment (guessing the ratings of upcoming movies).

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes