SORTD: Anytime Enumeration of Rashomon Sets of Sparse Decision Trees
Published:
SORTD computes the full Rashomon set of binary decision trees in anytime fashion.
Recommended citation: Arslan, E., van der Linden, J. G. M., Hoogendoorn, S. P., Rinaldi, M., & Demirović, E. (2025) "SORTeD Rashomon Sets of Sparse Decision Trees: Anytime Enumeration" Advances in NeurIPS-25, 44717-44755.
Download Paper | Source Repository
