On Computing Optimal Tree Ensembles

Random forests and, more generally, (decisionnobreakdash-)tree ensembles are widely used methods for classification and regression. Recent algorithmic advances allow to compute decision trees that are optimal for various measures such as their size or depth. We are not aware of such research for tree ensembles and aim to contribute to this area. Mainly, we provide two novel algorithms and corresponding lower bounds. First, we are able to carry over and substantially improve on tractability results for decision trees: We obtain an algorithm that, given a training-data set and an size bound S ∈ ℝ, computes a tree ensemble of size at most S that classifies the data correctly. The algorithm runs in (4δ D S)S · poly-time, where D the largest domain size, δ is the largest number of features in which two examples differ, n the number of input examples, and poly a polynomial of the input size. For decision trees, that is, ensembles of size 1, we obtain a running time of (δ D s)s · poly, where s is the size of the tree. To obtain these algorithms, we introduce the witness-tree technique, which seems promising for practical implementations. Secondly, we show that dynamic programming, which has been applied successfully to computing decision trees, may also be viable for tree ensembles, providing an ℓn · poly-time algorithm, where ℓ is the number of trees. Finally, we compare the number of cuts necessary to classify training data sets for decision trees and tree ensembles, showing that ensembles may need exponentially fewer cuts for increasing number of trees.