mlsanityData to 14 Oct 2026

Are Ensembles Getting Better all the Time?

arXiv 2311.17885 ↗First posted 29 Nov 2023stat.ML cs.LG math.STcited by 6

Not on the map. Why?

Abstract (arXiv)

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).

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 25 of its 107 references that are in the map. First posted on arXiv 29 Nov 2023.

Builds on

25 of 107 references.

References · 25

  1. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
  2. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
  3. 2021MedMNIST v2 -- A large-scale lightweight benchmark for 2D and 3D biomedical image classificationcited by 690
  4. 2015Importance Weighted Autoencoderscited by 456
  5. 2020Normalized Loss Functions for Deep Learning with Noisy Labelscited by 257
  6. 2017A General and Adaptive Robust Loss Functioncited by 236
  7. 2014Consistency of random forestscited by 85
  8. 2021The Shape of Learning Curves: a Reviewcited by 70
  9. 2017Regularizing Deep Neural Networks by Noise: Its Interpretation and Optimizationcited by 56
  10. 2015Risk Bounds for the Majority Vote: From a PAC-Bayesian Analysis to a Learning Algorithmcited by 50
  11. 2022Packed-Ensembles for Efficient Uncertainty Estimationcited by 49
  12. 2022Bagging is an Optimal PAC Learnercited by 34
13 more
  1. 2017To tune or not to tune the number of trees in random forest?cited by 33
  2. 2021Diversity and Generalization in Neural Network Ensemblescited by 32
  3. 2023A Rigorous Link between Deep Ensembles and (Variational) Bayesian Methodscited by 32
  4. 2015Random-projection ensemble classificationcited by 29
  5. 2018Variational Bayesian dropout: pitfalls and fixescited by 22
  6. 2023When are ensembles really effective?cited by 21
  7. 2019Estimating the Algorithmic Variance of Randomized Ensembles via the Bootstrapcited by 10
  8. 2019Random projections: data perturbation for classification problemscited by 7
  9. 2022On Margins and Generalisation for Voting Classifierscited by 7
  10. 2022Bounding Evidence and Estimating Log-Likelihood in VAEcited by 6
  11. 2022Towards efficient feature sharing in MIMO architecturescited by 4
  12. 2020Majority Voting and the Condorcet's Jury Theoremcited by 3
  13. 2022Uphill Roads to Variational Tightness: Monotonicity and Monte Carlo Objectivescited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 4.

6 papers.