Optimal Decision Tree Pruning Revisited: Algorithms and Complexity

Abstract

We present a comprehensive classical and parameterized complexity analysis of decision tree pruning operations, extending recent research on the complexity of learning small decision trees. Thereby, we offer new insights into the computational challenges of decision tree simplification, a crucial aspect of developing interpretable and efficient machine learning models. We focus on fundamental pruning operations of subtree replacement and raising, which are used in heuristics. Surprisingly, while optimal pruning can be performed in polynomial time for subtree replacement, the problem is NP-complete for subtree raising. Therefore, we identify parameters and combinations thereof that lead to fixed-parameter tractability or hardness, establishing a precise borderline between these complexity classes. For example, while subtree raising is hard for small domain size 𝐷 or number 𝑑 of features, it can be solved in 𝐷²d ∙ |𝐼|⁰⁽1⁾ time, where |𝐼| is the input size. We complement our theoretical findings with preliminary experimental results, demonstrating the practical implications of our analysis.