Robust Evidential Learning Through Latent Consistency

arXiv:2610.01384v1 Announce Type: new Abstract: Reliable uncertainty quantification is essential for deploying deep learning models in high-stakes settings, where out-of-distribution and adversarial inputs can induce confident but unreliable predictions. Evidential Deep Learning provides efficient uncertainty estimates in a single forward pass, but can still assign high evidential strength to inputs that are poorly supported by the learned representation, such as adversarial inputs. We introduce CLEAR, a lightweight, task-agnostic post-hoc method that improves evidential robustness without retraining or altering the base prediction. Using held-out calibration data, CLEAR characterises the group-conditioned geometry of the model's latent space. At inference, it efficiently generates perturbation views directly in the latent space and measures their conflict relative to the calibrated geometry of the predicted group. High latent conflict indicates unsupported evidence, which CLEAR uses to selectively reduce evidential strength while retaining evidence for latent-consistent inputs. On ImageNetrightarrowCUB, CLEAR improves OOD and adversarial AUROC by +8.29 and +5.01 while running 17.4imes faster than competing post-hoc methods while preserving predictive performance across classification, regression, and object detection benchmarks.

Related

• Can we trust our models? Epistemic calibration in second-order classification
• Calibrated Sampling-Free Uncertainty Estimation in Bayesian Deep Learning
• Biased Dreams: Limitations to Epistemic Uncertainty Quantification in Latent Space Models
• Density-Informed Pseudo-Counts for Calibrated Evidential Deep Learning

Source: arXiv cs.LG | 2026-10-02