mlsanityData to 7 Oct 2026

A Stationary-Distribution Theory for Triplet-Based Plateau Search in Random Forest Ensemble-Size Selection

arXiv 2606.30837 ↗First posted 29 Jun 2026cs.LG cs.AI math.PRcited by 0

Not on the map. Why?

Abstract (arXiv)

The number of trees is a central computational parameter in Random Forests: increasing it reduces finite-ensemble variability but increases training and prediction cost. Plateau-based tuning adapts this parameter through local comparisons of out-of-bag scores at a geometric triplet of tree counts. After the remaining hyperparameters have stabilized, however, the central triplet point need not converge to a deterministic value; instead, it fluctuates around a stationary regime. This paper develops a stationary-distribution theory for this process. The central ensemble size Bt is modeled as a birth-death Markov chain on a geometric grid, and its stationary distribution is derived through local balance. Under a leading centered folded-normal approximation, equilibrium equations are obtained for the original update rule and a symmetric modified variant, implying that the stationary center B_*=O(varepsilon-2) as varepsilondownarrow 0. The stationary spread is also characterized. A local Gaussian approximation and a Fokker-Planck interpretation give grid-level variance constants. After conversion to the ensemble-size scale, σB,*=O(varepsilon-2), while the variance is O(varepsilon-4). The leading relative spread is independent of varepsilon and controlled by the scale factor and update rule. These results interpret plateau-based Random Forest tuning as a stochastic process rather than a deterministic stopping rule.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 32 references that are in the map. First posted on arXiv 29 Jun 2026.

Builds on

10 of 32 references.

References · 10

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  2. 2016Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimizationcited by 688
  3. 2021Tabular Data: Deep Learning is Not All You Needcited by 530
  4. 2021Deep Neural Networks and Tabular Data: A Surveycited by 489
  5. 2015A Random Forest Guided Tourcited by 168
  6. 2017Constrained Bayesian Optimization with Noisy Experimentscited by 103
  7. 2018Tunability: Importance of Hyperparameters of Machine Learning Algorithmscited by 98
  8. 2024A Guide to Feature Importance Methods for Scientific Inferencecited by 11
  9. 2019Estimating the Algorithmic Variance of Randomized Ensembles via the Bootstrapcited by 10
  10. 2026How Many Trees in a Random Forest? A Revisited Approach with Plateau Search and Optuna Integrationcited by 1

Built on by

Not cited yet.