Tag
This paper introduces ArborEnum, the first algorithm to exactly enumerate decision-tree Rashomon sets over continuous features without binarization, along with relaxed and anytime approximations that achieve orders-of-magnitude speedups while preserving near-perfect recall.