Credal and Interval Deep Evidential Classifications
Michele Caprio, Shireen K. Manchingal, Fabio Cuzzolin
TL;DR
The paper tackles uncertainty quantification in classification by introducing Credal and Interval Deep Evidential Classifications (CDEC and IDEC), which model epistemic and aleatoric uncertainty via credal sets and intervals, respectively. These methods enable abstention when total uncertainty is high and provide set-valued predictions with probabilistic guarantees. Built on Dirichlet-Categorical foundations and normalizing-flow posteriors, CDEC constructs predictive credal sets from multiple encoders/flows, while IDEC uses an interval inflation approach with a single posterior; both yield strong out-of-distribution detection and calibrated predictions across MNIST and CIFAR benchmarks. Extensive experiments reveal competitive predictive performance, sharp uncertainty decompositions, and robust IHDR behavior, with a small ensemble sufficing for stable uncertainty estimates in CDEC. The work advances practical, interpretable uncertainty quantification for deep classifiers under distribution shift.
Abstract
Uncertainty Quantification (UQ) presents a pivotal challenge in the field of Artificial Intelligence (AI), profoundly impacting decision-making, risk assessment and model reliability. In this paper, we introduce Credal and Interval Deep Evidential Classifications (CDEC and IDEC, respectively) as novel approaches to address UQ in classification tasks. CDEC and IDEC leverage a credal set (closed and convex set of probabilities) and an interval of evidential predictive distributions, respectively, allowing us to avoid overfitting to the training data and to systematically assess both epistemic (reducible) and aleatoric (irreducible) uncertainties. When those surpass acceptable thresholds, CDEC and IDEC have the capability to abstain from classification and flag an excess of epistemic or aleatoric uncertainty, as relevant. Conversely, within acceptable uncertainty bounds, CDEC and IDEC provide a collection of labels with robust probabilistic guarantees. CDEC and IDEC are trained using standard backpropagation and a loss function that draws from the theory of evidence. They overcome the shortcomings of previous efforts, and extend the current evidential deep learning literature. Through extensive experiments on MNIST, CIFAR-10 and CIFAR-100, together with their natural OoD shifts (F-MNIST/K-MNIST, SVHN/Intel, TinyImageNet), we show that CDEC and IDEC achieve competitive predictive accuracy, state-of-the-art OoD detection under epistemic and total uncertainty, and tight, well-calibrated prediction regions that expand reliably under distribution shift. An ablation over ensemble size further demonstrates that CDEC attains stable uncertainty estimates with only a small ensemble.
