Paper presents a Rashomon Quartet to show different model explanations.
problem Models with similar performance can explain data differently.
method Synthetic dataset with four equally effective models.
result Models with similar performance can explain data differently.
Discovering the latent structure from many observed variables is an important yet challenging learning task. Existing approaches for discovering latent structures often require the unknown number of hidden states as an input. In this paper, we propose a quartet based approach which is \emph{agnostic} to this number. Th…
Noise increases the Rashomon ratio, leading simpler models to perform similarly to complex ones.
problem Why simpler models perform similarly to complex models on noisy datasets.
method Analyzed the data generation process and model training choices, introduced pattern diversity.
result Noisier datasets lead to larger Rashomon ratios, explaining simpler models' performance.
The paper analyzes the Rashomon ratio for infinite classifier families and shows its importance for choosing good classifiers.
problem Analyzing the Rashomon ratio for infinite classifier families.
method Quantifying the Rashomon ratio in two examples and providing guarantees for estimating it.
result A large Rashomon ratio guarantees choosing a classifier with good empirical accuracy will not significantly increase empirical loss.
Introduces Rashomon Capacity to measure predictive multiplicity in probabilistic classifiers.
problem Predictive multiplicity in classification models leading to unjustified decisions.
method Introduces Rashomon Capacity, a metric for probabilistic classifiers, and provides a rigorous derivation.
result Rashomon Capacity captures nuanced score variations and provides strategies for disclosing conflicting models.
New algorithms approximate Rashomon set for sparse models, aiding expert interaction.
problem Lack of interaction between models and domain experts in classical machine learning.
method Approximate Rashomon set of sparse, generalized additive models using ellipsoids.
result Efficiently approximated Rashomon set facilitates model selection and exploration.
Framework uses dropout to efficiently explore Rashomon set for multiplicity estimation.
problem Efficiently measuring and mitigating conflicting model outputs in classification tasks.
method Dropout-based exploration of Rashomon set for multiplicity estimation.
result Framework outperforms baselines in multiplicity metric estimation with significant runtime speedup.
New method uses Rashomon sets to improve Bayesian inference in factorial designs.
problem Combustion of model uncertainty in factorial designs leads to multimodal posterior and convergence issues.
method Rashomon-seeded annealing, integrating high-performing models as warm start for AIS.
result Restores full posterior inference without exhaustive enumeration of model space.
AXE evaluates explanations to avoid misleading Rashomon set model selection.
problem Evaluating explanations for Rashomon set models to avoid false selection.
method Proposed AXE method to evaluate explanation quality.
result AXE detects adversarial fairwashing with 100% success rate.
The Rashomon effect shows many models can perform similarly, explored in this paper.
problem Why do many models perform similarly in machine learning?
method Categorized causes into statistical, structural, and procedural sources.
result Structural multiplicity persists and cannot be resolved without additional assumptions.
REALITrees uses a Rashomon ensemble approach for active learning in sparse decision trees.
problem Active learning reduces labeling costs by selecting informative samples, but current methods often sacrifice model diversity and direct characterization of the hypothesis space.
method REALITrees constructs a committee of all near-optimal sparse decision tree models using a Rashomon Set and a Gibbs posterior to weight them by empirical risk.
result REALITrees outperforms randomized ensembles, especially in noisy environments, by leveraging expanded model multiplicity.
Commentary on Rashomon Effect complicating model selection.
problem Many models equally predict data; hard to draw conclusions.
method Connections to recent ML literature exploring implications.
result Grasping Rashomon Effect can foster collaboration.
Paper explores Rashomon set models for more trustworthy medical conclusions.
problem Lack of comprehensive analysis of models in Rashomon set leads to misleading conclusions.
method Introduces Rashomon_DETECT algorithm and Profile Disparity Index (PDI).
result Combining differently behaving models in Rashomon set provides more trustworthy conclusions.
It is almost always easier to find an accurate-but-complex model than an accurate-yet-simple model. Finding optimal, sparse, accurate models of various forms (linear models with integer coefficients, decision sets, rule lists, decision trees) is generally NP-hard. We often do not know whether the search for a simpler m…
Study shows more data improves model explanations, aiding reliable knowledge extraction.
problem Challenges in deriving reliable knowledge from machine learning models due to the Rashōmon effect.
method Examined the influence of sample size on explanations from models in a Rashōmon set using SHAP.
result Explanations from <128 samples are highly variable, but agreement improves with more data.
UNREAL selectively ensembles distinct models to improve active learning performance.
problem Difficulty in distinguishing genuine uncertainty from noise in limited labeled data.
method Selective ensembling of distinct models from the Rashomon set.
result UNREAL achieves faster convergence and up to 20% predictive accuracy improvement.
Leo Breiman's Rashomon Effect and Occam Dilemma are re-evaluated in the context of modern machine learning.
problem The tradeoff between model complexity and accuracy in machine learning.
method Modern perspective on Breiman's arguments using current computational capabilities.
result Algorithmic models can be accurate without being complex, nullifying the Occam Dilemma.
This work considers the problem of learning the structure of multivariate linear tree models, which include a variety of directed tree graphical models with continuous, discrete, and mixed latent variables such as linear-Gaussian models, hidden Markov models, Gaussian mixture models, and Markov evolutionary trees. The …
This paper explores how balancing and filtering techniques affect predictive multiplicity in machine learning models.
problem Predictive multiplicity due to Rashomon effect in high-stakes environments.
method Investigates the impact of balancing and filtering techniques on predictive multiplicity using 21 real-world datasets.
result Data-centric AI strategies can mitigate predictive multiplicity, but preprocessing methods may introduce it.
Bayesian framework for model uncertainty identifies complex heterogeneity without strong assumptions.
problem Identifying complex heterogeneity in factorial data with varying covariates.
method Rashomon Partition Sets (RPS) using l0 prior for robust model uncertainty.
result RPS provides a robust set of models capturing complex heterogeneity without strong assumptions.
Framework for assessing fairness across similar predictive models.
problem Fairness in predictive models across different groups.
method Develops a framework for characterizing fairness over the set of good models under selective labels.
result Framework can replace or audit models for better fairness properties.
New framework quantifies variable importance across all good models and is stable across data distribution.
problem Conflicting variable importance conclusions from different models trained on the same data.
method Proposes a new variable importance framework that considers all good models and is stable across data distribution.
result Framework accurately estimates true variable importance and recovers rankings for complex setups.
We present a framework based on neural networks to extract music scores directly from polyphonic audio in an end-to-end fashion. Most previous Automatic Music Transcription (AMT) methods seek a piano-roll representation of the pitches, that can be further transformed into a score by incorporating tempo estimation, beat…
The international community was caught by surprise on 5 June 2017 when Saudi Arabia, the United Arab Emirates (UAE), Bahrain and Egypt severed diplomatic ties with Qatar, accusing it of destabilizing the region. More than one year after this diplomatic rift, several questions remain unaddressed. This study focuses on t…
Breiman's data analysis dichotomy is outdated, offering a third approach: mechanistic models.
problem Data analysis dichotomy between data modelers and algorithmic modelers.
method Interpolating between simple interpretable models and flexible function approximations using mechanistic models.
result Flexible, interpretable, and scientifically-informed hybrids can provide accurate and robust predictions.
A GPU framework speeds up BnB for discrete optimization problems.
problem Optimizing large-scale discrete problems with GPU limitations.
method Parallel BnB nodes in GPU batches, using padding and custom kernels.
result One to two orders of magnitude speedup and zero optimality gap.
Survey on principles and challenges of interpretable machine learning.
problem Improving machine learning models' interpretability for high-stakes decisions.
method Identification and analysis of 10 technical challenges in interpretable machine learning.
result Identification of 10 technical challenges in interpretable machine learning.
Random projections improve classifier generalization without needing to choose the best threshold.
problem Improving classifier generalization without choosing the best threshold.
method Thresholding a random one-dimensional feature after random projection of data.
result Generalization gap is significantly smaller than linear classifiers.
Interactive EMA combines multiple explainability methods to improve model understanding.
problem Isolated explanations of machine learning models lead to misunderstandings and wrong reasoning.
method Interactive EMA (IEMA) combines multiple explainability methods sequentially.
result Interactive EMA increases the performance and confidence of human decision making.
This work introduces robust counterfactuals for neural networks that remain valid after minor model changes.
problem Generating counterfactual explanations that are robust to slight model changes.
method Introduces a measure called Stability to quantify robustness of counterfactuals to potential model changes, and proposes practical relaxations.
result Counterfactuals with high Stability remain valid after potential model changes with high probability.