Getting a CLUE: A Method for Explaining Uncertainty Estimates
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:DQZCCDVLrecord.jsonopen to challenge →
read the original abstract
Both uncertainty estimation and interpretability are important factors for trustworthy machine learning systems. However, there is little work at the intersection of these two areas. We address this gap by proposing a novel method for interpreting uncertainty estimates from differentiable probabilistic models, like Bayesian Neural Networks (BNNs). Our method, Counterfactual Latent Uncertainty Explanations (CLUE), indicates how to change an input, while keeping it on the data manifold, such that a BNN becomes more confident about the input's prediction. We validate CLUE through 1) a novel framework for evaluating counterfactual explanations of uncertainty, 2) a series of ablation experiments, and 3) a user study. Our experiments show that CLUE outperforms baselines and enables practitioners to better understand which input patterns are responsible for predictive uncertainty.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
A Framework for Variational Inference of Lightweight Bayesian Neural Networks with Heteroscedastic Uncertainties
Framework embeds aleatoric and epistemic uncertainties into BNN parameter variances and applies moment propagation for sampling-free variational inference in lightweight networks.
-
Target-confidence Recourse Using tSeTlin machines: TRUST
TRUST searches for minimal input changes that achieve a user-defined confidence target in PTM models, claiming perfect robustness and low cost on benchmarks versus standard boundary-crossing methods.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.