CASHomon Sets: Efficient Rashomon Sets Across Multiple Model Classes and their Hyperparameters

Fiona Katharina Ewald, Martin Binder, Matthias Feurer, Bernd Bischl, Giuseppe Casalicchio
3/16/2026
cs.LG

No confident code implementation found for this paper.

Abstract

Rashomon sets are model sets within one model class that perform nearly as well as a reference model from the same model class. They reveal the existence of alternative well-performing models, which may support different interpretations. This enables selecting models that match domain knowledge, hidden constraints, or user preferences. However, efficient construction methods currently exist for only a few model classes. Applied machine learning usually searches many model classes, and the best class is unknown beforehand. We therefore study Rashomon sets in the combined algorithm selection and hyperparameter optimization (CASH) setting and call them CASHomon sets. We propose TruVaRImp, a model-based active learning algorithm for level set estimation with an implicit threshold, and provide convergence guarantees. On synthetic and real-world datasets, TruVaRImp reliably identifies CASHomon sets members and matches or outperforms naive sampling, Bayesian optimization, classical and implicit level set estimation methods, and other baselines. Our analyses of predictive multiplicity and feature-importance variability across model classes question the common practice of interpreting data through a single model class.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{ewald2026cashomon,
  title  = {CASHomon Sets: Efficient Rashomon Sets Across Multiple Model Classes and their Hyperparameters},
  author = {Fiona Katharina Ewald and Martin Binder and Matthias Feurer and Bernd Bischl and Giuseppe Casalicchio},
  year   = {2026},
  eprint = {2603.15321},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2603.15321v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2603.15321.svg)](https://codeofpaper.com/paper/2603.15321)

Discussion