Research map / Learning theory and algorithms / Prediction and decision losses
Exploring the Whole Rashomon Set of Sparse Decision Trees
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Enumerate the Rashomon set using TreeFARMS rather than sampling trees with BART | Sparse decision trees · Monk2 | distinct trees found: 488 -> $10^8$ | Helped |
| Use TreeFARMS enumeration rather than the four sampling-based baseline approaches | Sparse decision trees · Monk2, COMPAS, and Bar | distinct trees in the Rashomon set | Helped |
| Sample from the Rashomon set instead of storing it in full | Model Class Reliance estimation · Rashomon set | samples sufficient for MCR: 25% | Helped |
Closest papers by meaning
- SORTeD Rashomon Sets of Sparse Decision Trees: Anytime Enumeration (NeurIPS 2025 · similarity 0.94)
- Near-Optimal Decision Trees in a SPLIT Second (ICML 2025 · similarity 0.89)
- Dropout-Based Rashomon Set Exploration for Efficient Predictive Multiplicity Estimation (ICLR 2024 · similarity 0.87)
- Position: Amazing Things Come From Having Many Good Models (ICML 2024 · similarity 0.86)
- RashomonGB: Analyzing the Rashomon Effect and Mitigating Predictive Multiplicity in Gradient Boosting (NeurIPS 2024 · similarity 0.86)
- Optimal Decision Tree Pruning Revisited: Algorithms and Complexity (ICML 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.