The Double-Edged Nature of the Rashomon Set for Trustworthy Machine Learning
Not on the map. Why?
Abstract (arXiv)
Real-world machine learning (ML) pipelines rarely produce a single model; instead, they produce a Rashomon set of many near-optimal ones. We show that this multiplicity reshapes key aspects of trustworthiness. At the individual-model level, sparse interpretable models tend to preserve privacy but are fragile to adversarial attacks. In contrast, the diversity within a large Rashomon set enables reactive robustness: even when an attack compromises one model, a practitioner can switch to a different near-optimal model that remains accurate, without retraining. However, the same diversity increases information leakage, as disclosing more near-optimal models provides an attacker with progressively richer views of the training data. This produces a robustness-privacy trade-off governed by diversity, which we analyze theoretically and empirically. Beyond this trade-off, Rashomon sets are stable under small distribution shifts, so a set computed once remains valid under such shifts without re-computation. Our results highlight the dual role of Rashomon sets as both a resource and a risk for trustworthy ML.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 63 of its 105 references that are in the map. First posted on arXiv 26 Nov 2025.
Builds on
63 of 105 references.
References · 63
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2013Intriguing properties of neural networkscited by 5,114
- 2016Membership Inference Attacks against Machine Learning Modelscited by 2,221
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
- 2018Robustness May Be at Odds with Accuracycited by 873
- 2014Deep Neural Networks are Easily Fooled: High Confidence Predictions for Unrecognizable Imagescited by 774
- 2017Countering Adversarial Images using Input Transformationscited by 517
- 2018Certified Robustness to Adversarial Examples with Differential Privacycited by 462
- 2018All Models are Wrong, but Many are Useful: Learning a Variable's Importance by Studying an Entire Class of Prediction Models Simultaneouslycited by 364
- 2017Defense against Adversarial Attacks Using High-Level Representation Guided Denoisercited by 329
- 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 299
- 2020Systematic Evaluation of Privacy Risks of Machine Learning Modelscited by 273
38 more
- 2017On Detecting Adversarial Perturbationscited by 232
- 2018Certified Adversarial Robustness with Additive Noisecited by 178
- 2019Predictive Multiplicity in Classificationcited by 162
- 2019Privacy Risks of Securing Machine Learning Models against Adversarial Examplescited by 136
- 2018Differentially Private Empirical Risk Minimization Revisited: Faster and More Generalcited by 127
- 2022Machine Learning Operations (MLOps): Overview, Definition, and Architecturecited by 126
- 2018Parametric Noise Injection: Trainable Randomness to Improve Deep Neural Network Robustness against Adversarial Attackcited by 123
- 2018Are adversarial examples inevitable?cited by 113
- 2019On the Existence of Simpler Machine Learning Modelscited by 87
- 2022Exploring the Whole Rashomon Set of Sparse Decision Treescited by 80
- 2020Do Wider Neural Networks Really Help Adversarial Robustness?cited by 79
- 2020ML Privacy Meter: Aiding Regulatory Compliance by Quantifying the Privacy Risks of Machine Learningcited by 66
- 2021Characterizing Fairness Over the Set of Good Models Under Selective Labelscited by 65
- 2018Generalization Bounds for Uniformly Stable Algorithmscited by 56
- 2024Amazing Things Come From Having Many Good Modelscited by 52
- 2020Improving Robustness to Model Inversion Attacks via Mutual Information Regularizationcited by 49
- 2022Rashomon Capacity: A Metric for Predictive Multiplicity in Classificationcited by 46
- 2015Evasion and Hardening of Tree Ensemble Classifierscited by 44
- 2021Fast Sparse Decision Tree Optimization via Reference Ensemblescited by 37
- 2019Theoretical evidence for adversarial robustness through randomizationcited by 33
- 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
- 2025Membership Inference Attacks Against Vision-Language Modelscited by 26
- 2023An Empirical Evaluation of the Rashomon Effect in Explainable Machine Learningcited by 25
- 2023On the Privacy-Robustness-Utility Trilemma in Distributed Learningcited by 24
- 2019On the Hardness of Robust Classificationcited by 23
- 2022FasterRisk: Fast and Accurate Interpretable Risk Scorescited by 21
- 2017Blocking Transferability of Adversarial Examples in Black-Box Learning Systemscited by 19
- 2023Arbitrary Decisions are a Hidden Cost of Differentially Private Trainingcited by 19
- 2024Dropout-Based Rashomon Set Exploration for Efficient Predictive Multiplicity Estimationcited by 18
- 2025Systemizing Multiplicity: The Curious Case of Arbitrariness in Machine Learningcited by 17
- 2020Robustness Threats of Differential Privacycited by 15
- 2021Gradient Masking and the Underestimated Robustness Threats of Differential Privacy in Deep Learningcited by 13
- 2025Rashomon Sets for Prototypical-Part Networks: Editing Interpretable Models in Real-Timecited by 13
- 2024Adversarial Training Can Provably Improve Robustness: Theoretical Analysis of Feature Learning Process Under Structured Datacited by 12
- 2024Trained Random Forests Completely Reveal your Datasetcited by 11
- 2025Be Intentional About Fairness!: Fairness, Size, and Multiplicity in the Rashomon Setcited by 10
50 most cited of 63 All 63 (JSON)
Built on by
Not cited yet.