The Double-Edged Nature of the Rashomon Set for Trustworthy Machine Learning

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Hsu, Ethan, Chen, Harry, Zhong, Chudi, Semenova, Lesia
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866914172351021056
author Hsu, Ethan
Chen, Harry
Zhong, Chudi
Semenova, Lesia
author_facet Hsu, Ethan
Chen, Harry
Zhong, Chudi
Semenova, Lesia
contents 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 breaks one model, others often remain accurate. Rashomon sets are also stable under small distribution shifts. However, this same diversity increases information leakage, as disclosing more near-optimal models provides an attacker with progressively richer views of the training data. Through theoretical analysis and empirical studies of sparse decision trees and linear models, we characterize this robustness-privacy trade-off and highlight the dual role of Rashomon sets as both a resource and a risk for trustworthy ML.
format Preprint
id arxiv_https___arxiv_org_abs_2511_21799
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle The Double-Edged Nature of the Rashomon Set for Trustworthy Machine Learning
Hsu, Ethan
Chen, Harry
Zhong, Chudi
Semenova, Lesia
Machine Learning
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 breaks one model, others often remain accurate. Rashomon sets are also stable under small distribution shifts. However, this same diversity increases information leakage, as disclosing more near-optimal models provides an attacker with progressively richer views of the training data. Through theoretical analysis and empirical studies of sparse decision trees and linear models, we characterize this robustness-privacy trade-off and highlight the dual role of Rashomon sets as both a resource and a risk for trustworthy ML.
title The Double-Edged Nature of the Rashomon Set for Trustworthy Machine Learning
topic Machine Learning
url https://arxiv.org/abs/2511.21799