Leo Breiman, the Rashomon Effect, and the Occam Dilemma
Not on the map. Why?
Abstract (arXiv)
In the famous Two Cultures paper, Leo Breiman provided a visionary perspective on the cultures of ''data models'' (modeling with consideration of data generation) versus ''algorithmic models'' (vanilla machine learning models). I provide a modern perspective on these approaches. One of Breiman's key arguments against data models is the ''Rashomon Effect,'' which is the existence of many different-but-equally-good models. The Rashomon Effect implies that data modelers would not be able to determine which model generated the data. Conversely, one of his core advantages in favor of data models is simplicity, as he claimed there exists an ''Occam Dilemma,'' i.e., an accuracy-simplicity tradeoff. After 25 years of powerful computers, it has become clear that this claim is not generally true, in that algorithmic models do not need to be complex to be accurate; however, there are nuances that help explain Breiman's logic, specifically, that by ''simple,'' he appears to consider only linear models or unoptimized decision trees. Interestingly, the Rashomon Effect is a key tool in proving the nullification of the Occam Dilemma. To his credit though, Breiman did not have the benefit of modern computers, with which my observations are much easier to make. Breiman's goal for interpretability was somewhat intertwined with causality: simpler models can help reveal which variables have a causal relationship with the outcome. However, I argue that causality can be investigated without the use of single models, whether or not they are simple. Interpretability is useful in its own right, and I think Breiman knew that too. Technically, my modern perspective does not belong to either of Breiman's Two Cultures, but shares the goals of both of them - causality, simplicity, accuracy - and shows that these goals can be accomplished in other ways, without the limitations Breiman was concerned about.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 16 of its 21 references that are in the map. First posted on arXiv 5 Jul 2025.
Builds on
16 of 21 references.
References · 16
- 2021Interpretable Machine Learning: Fundamental Principles and 10 Grand Challengescited by 367
- 2020Generalized and Scalable Optimal Sparse Decision Treescited by 100
- 2019On the Existence of Simpler Machine Learning Modelscited by 89
- 2024Amazing Things Come From Having Many Good Modelscited by 55
- 2016Learning Optimized Risk Scorescited by 47
- 2015Interpretable Classification Models for Recidivism Predictioncited by 44
- 2020In Pursuit of Interpretable, Fair and Accurate Machine Learning for Criminal Recidivism Predictioncited by 42
- 2021Fast Sparse Decision Tree Optimization via Reference Ensemblescited by 38
- 2023A Path to Simpler Models Starts With Noisecited by 33
- 2023Exploring and Interacting with the Set of Good Sparse Generalized Additive Modelscited by 30
- 2023The Rashomon Importance Distribution: Getting RID of Unstable, Single Model-based Variable Importancecited by 29
- 2022FasterRisk: Fast and Accurate Interpretable Risk Scorescited by 21
4 more
- 2022Fast Sparse Classification for Generalized Linear and Additive Modelscited by 19
- 2021A Holistic Approach to Interpretability in Financial Lending: Models, Visualizations, and Summary-Explanationscited by 16
- 2018MALTS: Matching After Learning to Stretchcited by 13
- 2023Variable Importance Matching for Causal Inferencecited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.