From Rashomon Theory to PRAXIS: Efficient Decision Tree Rashomon Sets

• URL: http://arxiv.org/abs/2606.00202v1
• Date: Fri, 29 May 2026 17:26:14 GMT
• Title: From Rashomon Theory to PRAXIS: Efficient Decision Tree Rashomon Sets
• Abstract summary: "Rashomon sets" pose a range of challenges and opportunities for uncertainty-aware, robust decision making.<n>We present PRAXIS, an algorithm to approximate a Rashomon set with orders of magnitude improvement in runtime and memory usage.
• Score: 21.237849022123545
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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

Related papers

• CASHomon Sets: Efficient Rashomon Sets Across Multiple Model Classes and their Hyperparameters [14.441777442115708]
  Rashomon sets are model sets within one model class that perform nearly as well as a reference model from the same model class.<n>We propose TruVaRImp, a model-based active learning algorithm for level set estimation with an implicit threshold.
  arXiv  Detail & Related papers  (2026-03-16T14:12:05Z)
• SORTeD Rashomon Sets of Sparse Decision Trees: Anytime Enumeration [4.567122178196833]
  SORTD is a novel framework that improves scalability and enumerates trees in the Rashomon set in order of the objective value.<n>Our experiments show that SORTD reduces runtime by up to two orders of magnitude compared with the state of the art.
  arXiv  Detail & Related papers  (2025-11-05T10:25:08Z)
• Intention-Conditioned Flow Occupancy Models [80.42634994902858]
  Large-scale pre-training has fundamentally changed how machine learning research is done today.<n>Applying this same framework to reinforcement learning is appealing because it offers compelling avenues for addressing core challenges in RL.<n>Recent advances in generative AI have provided new tools for modeling highly complex distributions.
  arXiv  Detail & Related papers  (2025-06-10T15:27:46Z)
• MINIMA: Modality Invariant Image Matching [52.505282811925454]
  We present MINIMA, a unified image matching framework for multiple cross-modal cases.<n>We scale up the modalities from cheap but rich RGB-only matching data, by means of generative models.<n>With MD-syn, we can directly train any advanced matching pipeline on randomly selected modality pairs to obtain cross-modal ability.
  arXiv  Detail & Related papers  (2024-12-27T02:39:50Z)
• Online Intrinsic Rewards for Decision Making Agents from Large Language Model Feedback [52.763620660061115]
  ONI is a distributed architecture that simultaneously learns an RL policy and an intrinsic reward function.<n>We explore a range of algorithmic choices for reward modeling with varying complexity.<n>Our approach achieves state-of-the-art performance across a range of challenging tasks from the NetHack Learning Environment.
  arXiv  Detail & Related papers  (2024-10-30T13:52:43Z)
• Learning Defect Prediction from Unrealistic Data [57.53586547895278]
  Pretrained models of code have become popular choices for code understanding and generation tasks. Such models tend to be large and require commensurate volumes of training data. It has become popular to train models with far larger but less realistic datasets, such as functions with artificially injected bugs. Models trained on such data tend to only perform well on similar data, while underperforming on real world programs.
  arXiv  Detail & Related papers  (2023-11-02T01:51:43Z)
• A Path to Simpler Models Starts With Noise [17.36067410506525]
  The Rashomon set is the set of models that perform approximately equally well on a given dataset. An open question is why Rashomon ratios often tend to be large. We show that noisier datasets lead to larger Rashomon ratios through the way that practitioners train models.
  arXiv  Detail & Related papers  (2023-10-30T16:52:57Z)
• Exploring and Interacting with the Set of Good Sparse Generalized Additive Models [26.64299550434767]
  We present algorithms to approximate the Rashomon set of sparse, generalized additive models with ellipsoids for fixed support sets. The approximated Rashomon set serves as a cornerstone to solve practical challenges such as (1) studying the variable importance for the model class; (2) finding models under user-specified constraints (monotonicity, direct editing); and (3) investigating sudden changes in the shape functions.
  arXiv  Detail & Related papers  (2023-03-28T15:25:46Z)
• Exploring the Whole Rashomon Set of Sparse Decision Trees [23.136590456299007]
  We show that the Rashomon set is the set of all almost-optimal models. We provide the first technique for completely enumerating the Rashomon set for sparse decision trees. This allows the user an unprecedented level of control over model choice.
  arXiv  Detail & Related papers  (2022-09-16T16:37:26Z)
• Partial Order in Chaos: Consensus on Feature Attributions in the Rashomon Set [50.67431815647126]
  Post-hoc global/local feature attribution methods are being progressively employed to understand machine learning models. We show that partial orders of local/global feature importance arise from this methodology. We show that every relation among features present in these partial orders also holds in the rankings provided by existing approaches.
  arXiv  Detail & Related papers  (2021-10-26T02:53:14Z)
• SSSE: Efficiently Erasing Samples from Trained Machine Learning Models [103.43466657962242]
  We propose an efficient and effective algorithm, SSSE, for samples erasure. In certain cases SSSE can erase samples almost as well as the optimal, yet impractical, gold standard of training a new model from scratch with only the permitted data.
  arXiv  Detail & Related papers  (2021-07-08T14:17:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.