Skip to content

Rethinking Vacuity for OOD Detection in Evidential Deep Learning

May 2026 · arXiv.org · Vol abs/2605.06382 · 0 citations · 29 references
Computer Science

TL;DR

The primary contribution is an empirical and theoretical demonstration that vacuity-based OOD detection in EDL-fine-tuned LLMs is highly sensitive to uncontrolled differences in evaluated class cardinality.

Abstract

Vacuity, or Uncertainty Mass (UM), is commonly used as a metric to evaluate Out-of-Distribution (OOD) detection in Evidential Deep Learning (EDL). It generally involves dividing the number of classes ($K$) by the total strength of belief ($S$) of the model's predictions, where $S$ is derived from summing the Dirichlet parameters. As such, UM is sensitive to the cardinality of $K$. As a result, when comparing In Distribution (ID) and OOD results, it is important that $K_{\mathrm{ID}}$ and $K_{\mathrm{OOD}}$ are equal; something that is not always ensured in practice. We provide an empirical demonstration of how results for AUROC and AUPR can substantially differ when class cardinality between ID and OOD differs by 1, with AUROC differing by as much as 0.346 and AUPR by 0.634 for standard EDL, and AUROC by 0.427 and AUPR by 0.745 for IB-EDL (both from Implementation B, Llama3-8B, ARC-E). Our findings isolate an evaluation artefact: when $K$ differs between ID and OOD, AUROC/AUPR can be artificially inflated without any change in model predictions. We further discuss the evaluation of EDL over causal language models using Multiple-Choice Question-Answer (MCQA) datasets and argue for clearer definitions of ID and OOD in this context. Our primary contribution is an empirical and theoretical demonstration that vacuity-based OOD detection in EDL-fine-tuned LLMs is highly sensitive to uncontrolled differences in evaluated class cardinality.

View source

Similar papers

#machine learning Review Aug 2026

Adversarial Online Classification with a Preview

A random preview can replace worst-case sequential complexity by classical statistical dimensions without randomizing the online order by using an online analogue of chaining, implemented as a multiscale aggregation algorithm rather than only as an analytic argument.

Roi Livni, Sahil Singla · 0 citations
Preprint Aug 2026

H$^2$EDL: Hyper Evidential Deep Learning for Hierarchical Classification

The resulting model, H$^2$EDL, functions as a hierarchical classifier that preserves consistency across different levels of the label tree that defines a valid tree-structured hyper-opinion, where the mass assigned to each node represents the belief that reaches that node but does not provide sufficient confidence to f...

Yuanye Liu, Xia-Hai Zhuang · 0 citations
#machine learning Preprint Aug 2026

Two Dimensions Govern Agnostic Multiclass Transductive Learning

A new without-replacement multiplicative-weights lemma preserves the fast $d_{DS}/n$ term, and consequently, agnostic multiclass PAC and transductive learning obey the same two-dimension law up to logarithmic factors.

Pahan Dewasurendra · 0 citations
Preprint Aug 2026

Optimistic Rates for Multiclass PAC Learning

Worst-case multiclass bounds do not become smaller when the best classifier is already nearly correct: what is missing is an optimistic rate, a guarantee whose fluctuation scales with the oracle risk itself. For a class of Natarajan dimension $d_N$ and Daniely-Shalev-Shwartz dimension $d_{DS}$, the optimal excess risk...

Xiao-Yu Li, Andi Han, Jiao-Jiao Jiang et al. · 1 citation

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.