Grafting: Making Random Forests Consistent

arXiv:2403.06015v1 Announce Type: cross
Abstract: Despite their performance and widespread use, little is known about the theory of Random Forests. A major unanswered question is whether, or when, the Random Forest algorithm is consistent. The literature explores various variants of the classic Random Forest algorithm to address this question and known short-comings of the method. This paper is a contribution to this literature. Specifically, the suitability of grafting consistent estimators onto a shallow CART is explored. It is shown that …

abstract algorithm arxiv consistent cs.lg forests literature major making performance question random random forests stat.ml theory type variants