Derives the stationary distribution and asymptotic scaling O(ε^{-2}) for ensemble size in a Markov chain model of triplet-based plateau tuning for random forests.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LG 2years
2026 2representative citing papers
A triplet-based plateau search algorithm is proposed to adaptively determine a near-minimal number of trees for random forests by monitoring relative OOB score changes across forest size triplets, removing n_trees from the TPE search space.
citing papers explorer
-
How Many Trees in a Random Forest? A Revisited Approach with Plateau Search and Optuna Integration
A triplet-based plateau search algorithm is proposed to adaptively determine a near-minimal number of trees for random forests by monitoring relative OOB score changes across forest size triplets, removing n_trees from the TPE search space.