From Rashomon Theory to PRAXIS: Efficient Decision Tree Rashomon Sets
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916068380901376 |
|---|---|
| author | Heile, Zakk McTavish, Hayden Babbar, Varun Seltzer, Margo Rudin, Cynthia |
| author_facet | Heile, Zakk McTavish, Hayden Babbar, Varun Seltzer, Margo Rudin, Cynthia |
| contents | Standard machine learning pipelines often admit many near-optimal models. These "Rashomon sets" pose a range of challenges and opportunities for uncertainty-aware, robust decision making. They allow users to incorporate domain knowledge and preferences that would otherwise be difficult to specify directly in an objective, and they quantify diversity among valid models for a given training dataset and objective function. However, computation of Rashomon sets, even for simple, interpretable model classes such as sparse decision trees, continues to require immense memory and runtime resources. We present PRAXIS, an algorithm to approximate this Rashomon set with orders of magnitude improvement in runtime and memory usage. We validate that PRAXIS regularly recovers almost all of the full Rashomon set. PRAXIS allows researchers and practitioners to scalably model the Rashomon set for real-world datasets. Code for PRAXIS is available at https://github.com/zakk-h/PRAXIS |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2606_00202 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | From Rashomon Theory to PRAXIS: Efficient Decision Tree Rashomon Sets Heile, Zakk McTavish, Hayden Babbar, Varun Seltzer, Margo Rudin, Cynthia Machine Learning Artificial Intelligence Standard machine learning pipelines often admit many near-optimal models. These "Rashomon sets" pose a range of challenges and opportunities for uncertainty-aware, robust decision making. They allow users to incorporate domain knowledge and preferences that would otherwise be difficult to specify directly in an objective, and they quantify diversity among valid models for a given training dataset and objective function. However, computation of Rashomon sets, even for simple, interpretable model classes such as sparse decision trees, continues to require immense memory and runtime resources. We present PRAXIS, an algorithm to approximate this Rashomon set with orders of magnitude improvement in runtime and memory usage. We validate that PRAXIS regularly recovers almost all of the full Rashomon set. PRAXIS allows researchers and practitioners to scalably model the Rashomon set for real-world datasets. Code for PRAXIS is available at https://github.com/zakk-h/PRAXIS |
| title | From Rashomon Theory to PRAXIS: Efficient Decision Tree Rashomon Sets |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2606.00202 |