dorsal/arxiv
View SchemaResolving Predictive Multiplicity for the Rashomon Set
| Authors | Parian Haghighat, Hadis Anahideh, Cynthia Rudin |
|---|---|
| Categories | |
| ArXiv ID | 2601.09071vv1 |
| URL | https://arxiv.org/abs/2601.09071 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
The existence of multiple, equally accurate models for a given predictive task leads to predictive multiplicity, where a ``Rashomon set'' of models achieve similar accuracy but diverges in their individual predictions. This inconsistency undermines trust in high-stakes applications where we want consistent predictions. We propose three approaches to reduce inconsistency among predictions for the members of the Rashomon set. The first approach is \textbf{outlier correction}. An outlier has a label that none of the good models are capable of predicting correctly. Outliers can cause the Rashomon set to have high variance predictions in a local area, so fixing them can lower variance. Our second approach is local patching. In a local region around a test point, models may disagree with each other because some of them are biased. We can detect and fix such biases using a validation set, which also reduces multiplicity. Our third approach is pairwise reconciliation, where we find pairs of models that disagree on a region around the test point. We modify predictions that disagree, making them less biased. These three approaches can be used together or separately, and they each have distinct advantages. The reconciled predictions can then be distilled into a single interpretable model for real-world deployment. In experiments across multiple datasets, our methods reduce disagreement metrics while maintaining competitive accuracy.
{
"annotation_id": "af159f71-59d5-4cf3-ba04-6836ddbf8e19",
"date_created": "2026-02-17T05:53:20.511000Z",
"date_modified": "2026-02-17T05:53:20.511000Z",
"file_hash": "dbe584217eb833649d32c2f1d281ffe152078ff644de245fa85563281c75685f",
"private": false,
"record": {
"abstract": "The existence of multiple, equally accurate models for a given predictive task leads to predictive multiplicity, where a ``Rashomon set\u0027\u0027 of models achieve similar accuracy but diverges in their individual predictions. This inconsistency undermines trust in high-stakes applications where we want consistent predictions. We propose three approaches to reduce inconsistency among predictions for the members of the Rashomon set. The first approach is \\textbf{outlier correction}. An outlier has a label that none of the good models are capable of predicting correctly. Outliers can cause the Rashomon set to have high variance predictions in a local area, so fixing them can lower variance. Our second approach is local patching. In a local region around a test point, models may disagree with each other because some of them are biased. We can detect and fix such biases using a validation set, which also reduces multiplicity. Our third approach is pairwise reconciliation, where we find pairs of models that disagree on a region around the test point. We modify predictions that disagree, making them less biased. These three approaches can be used together or separately, and they each have distinct advantages. The reconciled predictions can then be distilled into a single interpretable model for real-world deployment. In experiments across multiple datasets, our methods reduce disagreement metrics while maintaining competitive accuracy.",
"arxiv_id": "2601.09071",
"authors": [
"Parian Haghighat",
"Hadis Anahideh",
"Cynthia Rudin"
],
"categories": [
"cs.LG"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Resolving Predictive Multiplicity for the Rashomon Set",
"url": "https://arxiv.org/abs/2601.09071",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "3ce4fcdd-b295-4ec5-bc96-8aae3f35cb67",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}