Learning Credal Ensembles via Distributionally Robust Optimization

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Wang, Kaizheng, Faza, Ghifari Adam, Cuzzolin, Fabio, Chau, Siu Lun, Moens, David, Hallez, Hans
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908852889321472
author Wang, Kaizheng
Faza, Ghifari Adam
Cuzzolin, Fabio
Chau, Siu Lun
Moens, David
Hallez, Hans
author_facet Wang, Kaizheng
Faza, Ghifari Adam
Cuzzolin, Fabio
Chau, Siu Lun
Moens, David
Hallez, Hans
contents Credal predictors are models that are aware of epistemic uncertainty and produce a convex set of probabilistic predictions. They offer a principled way to quantify predictive epistemic uncertainty (EU) and have been shown to improve model robustness in various settings. However, most state-of-the-art methods mainly define EU as disagreement caused by random training initializations, which mostly reflects sensitivity to optimization randomness rather than uncertainty from deeper sources. To address this, we define EU as disagreement among models trained with varying relaxations of the i.i.d. assumption between training and test data. Based on this idea, we propose CreDRO, which learns an ensemble of plausible models through distributionally robust optimization. As a result, CreDRO captures EU not only from training randomness but also from meaningful disagreement due to potential distribution shifts between training and test data. Empirical results show that CreDRO consistently outperforms existing credal methods on tasks such as out-of-distribution detection across multiple benchmarks and selective classification in medical applications.
format Preprint
id arxiv_https___arxiv_org_abs_2602_08470
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Learning Credal Ensembles via Distributionally Robust Optimization
Wang, Kaizheng
Faza, Ghifari Adam
Cuzzolin, Fabio
Chau, Siu Lun
Moens, David
Hallez, Hans
Machine Learning
Credal predictors are models that are aware of epistemic uncertainty and produce a convex set of probabilistic predictions. They offer a principled way to quantify predictive epistemic uncertainty (EU) and have been shown to improve model robustness in various settings. However, most state-of-the-art methods mainly define EU as disagreement caused by random training initializations, which mostly reflects sensitivity to optimization randomness rather than uncertainty from deeper sources. To address this, we define EU as disagreement among models trained with varying relaxations of the i.i.d. assumption between training and test data. Based on this idea, we propose CreDRO, which learns an ensemble of plausible models through distributionally robust optimization. As a result, CreDRO captures EU not only from training randomness but also from meaningful disagreement due to potential distribution shifts between training and test data. Empirical results show that CreDRO consistently outperforms existing credal methods on tasks such as out-of-distribution detection across multiple benchmarks and selective classification in medical applications.
title Learning Credal Ensembles via Distributionally Robust Optimization
topic Machine Learning
url https://arxiv.org/abs/2602.08470