mlsanityData to 7 Oct 2026

Subsampled Ensemble Can Improve Generalization Tail Exponentially

arXiv 2405.14741 ↗First posted 23 May 2024math.OC cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Ensemble learning is a popular technique to improve the accuracy of machine learning models. It traditionally hinges on the rationale that aggregating multiple weak models can lead to better models with lower variance and hence higher stability, especially for discontinuous base learners. In this paper, we provide a new perspective on ensembling. By selecting the most frequently generated model from the base learner when repeatedly applied to subsamples, we can attain exponentially decaying tails for the excess risk, even if the base learner suffers from slow (i.e., polynomial) decay rates. This tail enhancement power of ensembling applies to base learners that have reasonable predictive power to begin with and is stronger than variance reduction in the sense of exhibiting rate improvement. We demonstrate how our ensemble methods can substantially improve out-of-sample performances in a range of numerical examples involving heavy-tailed data or intrinsically slow rates.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 33 of its 100 references that are in the map. First posted on arXiv 23 May 2024.

Builds on

33 of 100 references.

References · 33

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2023GPT-4 Technical Reportcited by 18,132
  3. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  4. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
  5. 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 600
  6. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 285
  7. 2021Learning to Optimize: A Primer and A Benchmarkcited by 206
  8. 2019Mean estimation and regression under heavy-tailed distributions--a surveycited by 133
  9. 2019Reinforcement Learning for Integer Programming: Learning to Cutcited by 108
  10. 2020Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clippingcited by 104
  11. 2021High-probability Bounds for Non-Convex Stochastic Optimization with Heavy Tailscited by 80
  12. 2013Loss minimization and parameter estimation with heavy tailscited by 50
21 more
  1. 2014Learning without Concentrationcited by 50
  2. 2017Sub-Gaussian estimators of the mean of a random vectorcited by 47
  3. 2022Learning to branch with Tree MDPscited by 45
  4. 2022A Survey for Solving Mixed Integer Programming via Machine Learningcited by 44
  5. 2014Empirical risk minimization for heavy-tailed lossescited by 37
  6. 2023Breaking the Heavy-Tailed Noise Barrier in Stochastic Optimization Problemscited by 21
  7. 2020Heavy-tailed Representations, Text Polarity Classification & Data Augmentationcited by 20
  8. 2023Machine Learning for Cutting Planes in Integer Programming: A Surveycited by 19
  9. 2021On Empirical Risk Minimization with Dependent and Heavy-Tailed Datacited by 16
  10. 2021Learning Primal Heuristics for Mixed Integer Programscited by 14
  11. 2014Learning without Concentration for General Loss Functionscited by 13
  12. 2023Online Bootstrap Inference with Nonconvex Stochastic Gradient Descent Estimatorcited by 12
  13. 2018Boosting Random Forests to Reduce Bias; One-Step Boosted Forest and its Variance Estimatecited by 8
  14. 2018Error Estimation for Randomized Least-Squares Algorithms via the Bootstrapcited by 6
  15. 2019Minimal Variance Sampling in Stochastic Gradient Boostingcited by 5
  16. 2017Sample average approximation with heavier tails I: non-asymptotic bounds with weak assumptions and stochastic constraintscited by 4
  17. 2019When can we improve on sample average approximation for stochastic optimization?cited by 3
  18. 2016Fast learning rates with heavy-tailed lossescited by 2
  19. 2018Bounding Optimality Gap in Stochastic Optimization via Bagging: Statistical Efficiency and Stabilitycited by 2
  20. 2023Uses of Sub-sample Estimates to Reduce Errors in Stochastic Optimization Modelscited by 2
  21. 2021Optimizing over an ensemble of neural networkscited by 1

Built on by

Not cited yet.