[2603.27270] Quantification of Credal Uncertainty: A Distance-Based Approach
About this article
Abstract page for arXiv paper 2603.27270: Quantification of Credal Uncertainty: A Distance-Based Approach
Computer Science > Artificial Intelligence arXiv:2603.27270 (cs) [Submitted on 28 Mar 2026] Title:Quantification of Credal Uncertainty: A Distance-Based Approach Authors:Xabier Gonzalez-Garcia, Siu Lun Chau, Julian Rodemann, Michele Caprio, Krikamol Muandet, Humberto Bustince, Sébastien Destercke, Eyke Hüllermeier, Yusuf Sale View a PDF of the paper titled Quantification of Credal Uncertainty: A Distance-Based Approach, by Xabier Gonzalez-Garcia and 8 other authors View PDF Abstract:Credal sets, i.e., closed convex sets of probability measures, provide a natural framework to represent aleatoric and epistemic uncertainty in machine learning. Yet how to quantify these two types of uncertainty for a given credal set, particularly in multiclass classification, remains underexplored. In this paper, we propose a distance-based approach to quantify total, aleatoric, and epistemic uncertainty for credal sets. Concretely, we introduce a family of such measures within the framework of Integral Probability Metrics (IPMs). The resulting quantities admit clear semantic interpretations, satisfy natural theoretical desiderata, and remain computationally tractable for common choices of IPMs. We instantiate the framework with the total variation distance and obtain simple, efficient uncertainty measures for multiclass classification. In the binary case, this choice recovers established uncertainty measures, for which a principled multiclass generalization has so far been missing. Empirical...