mlsanityData to 14 Oct 2026

Bootstrap Sampling Rate Greater than 1.0 May Improve Random Forest Performance

arXiv 2410.04297 ↗First posted 5 Oct 2024cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Random forests (RFs) utilize bootstrap sampling to generate individual training sets for each component tree by sampling with replacement, with the sample size typically equal to that of the original training set (N). Previous research indicates that drawing fewer than N observations can also yield satisfactory results. The ratio of the number of observations in each bootstrap sample to the total number of training instances is referred to as the bootstrap rate (BR). Sampling more than N observations (BR > 1.0) has been explored only to a limited extent and has generally been considered ineffective. In this paper, we revisit this setup using 36 diverse datasets, evaluating BR values ranging from 1.2 to 5.0. Contrary to previous findings, we show that higher BR values can lead to statistically significant improvements in classification accuracy compared to standard settings (BR ≤ 1.0). Furthermore, we analyze how BR affects the leaf structure of decision trees within the RF and investigate factors influencing the optimal BR. Our results indicate that the optimal BR is primarily determined by the characteristics of the data set rather than the RF hyperparameters.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 17 of its 51 references that are in the map. First posted on arXiv 5 Oct 2024.

Builds on

17 of 51 references.

References · 17

  1. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
  2. 2016Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimizationcited by 699
  3. 2018BOHB: Robust and Efficient Hyperparameter Optimization at Scalecited by 470
  4. 2021SMAC3: A Versatile Bayesian Optimization Package for Hyperparameter Optimizationcited by 230
  5. 2020Auto-Sklearn 2.0: Hands-free AutoML via Meta-Learningcited by 174
  6. 2021Hyperparameter Optimization: Foundations, Algorithms, Best Practices and Open Challengescited by 145
  7. 2018Hyperparameters and Tuning Strategies for Random Forestcited by 84
  8. 2021YAHPO Gym -- An Efficient Multi-Objective Multi-Fidelity Benchmark for Hyperparameter Optimizationcited by 62
  9. 2023Hyperparameters in Reinforcement Learning and How To Tune Themcited by 59
  10. 2017To tune or not to tune the number of trees in random forest?cited by 33
  11. 2023PriorBand: Practical Hyperparameter Optimization in the Age of Deep Learningcited by 31
  12. 2022Hyper-Tune: Towards Efficient Hyper-parameter Tuning at Scalecited by 13
5 more
  1. 2013Consistency of Online Random Forestscited by 4
  2. 2019A meta-learning recommender system for hyperparameter tuning: predicting when tuning improves SVM classifierscited by 3
  3. 2023SigOpt Mulch: An Intelligent System for AutoML of Gradient Boosted Treescited by 2
  4. 2020Generalized Self-Adapting Particle Swarm Optimization algorithm with archive of samplescited by 1
  5. 2023HyperTuner: A Cross-Layer Multi-Objective Hyperparameter Auto-Tuning Framework for Data Analytic Servicescited by 1

Built on by

Not cited yet.