Honest decision trees and random forests achieve weak, almost sure, and uniform consistency for regression under mild conditions via elementary proofs.
Bagging Predictors.Machine Learning24123-140
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ME 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Consistency of Honest Decision Trees and Random Forests
Honest decision trees and random forests achieve weak, almost sure, and uniform consistency for regression under mild conditions via elementary proofs.