Uncertainty-Aware Explanations Through Probabilistic Self-Explainable Neural Networks
Not on the map. Why?
Abstract (arXiv)
The lack of transparency of Deep Neural Networks continues to be a limitation that severely undermines their reliability and usage in high-stakes applications. Promising approaches to overcome such limitations are Prototype-Based Self-Explainable Neural Networks (PSENNs), whose predictions rely on the similarity between the input at hand and a set of prototypical representations of the output classes, offering therefore a deep, yet transparent-by-design, architecture. In this paper, we introduce a probabilistic reformulation of PSENNs, called Prob-PSENN, which replaces point estimates for the prototypes with probability distributions over their values. This provides not only a more flexible framework for an end-to-end learning of prototypes, but can also capture the explanatory uncertainty of the model, which is a missing feature in previous approaches. In addition, since the prototypes determine both the explanation and the prediction, Prob-PSENNs allow us to detect when the model is making uninformed or uncertain predictions, and to obtain valid explanations for them. Our experiments demonstrate that Prob-PSENNs provide more meaningful and robust explanations than their non-probabilistic counterparts, while remaining competitive in terms of predictive performance, thus enhancing the explainability and reliability of the models.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 29 of its 52 references that are in the map. First posted on arXiv 20 Mar 2024.
Builds on
29 of 52 references.
References · 29
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,733
- 2013Intriguing properties of neural networkscited by 5,155
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2017Axiomatic Attribution for Deep Networkscited by 3,384
- 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,371
- 2017What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?cited by 2,352
- 2017Learning Important Features Through Propagating Activation Differencescited by 1,458
- 2018Sanity Checks for Saliency Mapscited by 1,156
- 2014Striving for Simplicity: The All Convolutional Netcited by 990
- 2019Aleatoric and Epistemic Uncertainty in Machine Learning: An Introduction to Concepts and Methodscited by 913
- 2018This Looks Like That: Deep Learning for Interpretable Image Recognitioncited by 737
17 more
- 2017Evasion Attacks against Machine Learning at Test Timecited by 689
- 2016TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systemscited by 664
- 2018Towards Robust Interpretability with Self-Explaining Neural Networkscited by 505
- 2017Interpretation of Neural Networks is Fragilecited by 444
- 2018Deep Learning for Classical Japanese Literaturecited by 422
- 2017Adversarial Examples: Attacks and Defenses for Deep Learningcited by 351
- 2020A Survey on Neural Network Interpretabilitycited by 291
- 2017Deep Learning for Case-Based Reasoning through Prototypes: A Neural Network that Explains Its Predictionscited by 234
- 2020Neural Prototype Trees for Interpretable Fine-grained Image Recognitioncited by 214
- 2020Bayesian Neural Networks: An Introduction and Surveycited by 131
- 2017TensorFlow Distributionscited by 106
- 2019Fairwashing: the risk of rationalizationcited by 81
- 2019Interpretable Image Recognition with Hierarchical Prototypescited by 65
- 2022ProtoVAE: A Trustworthy Self-Explainable Prototypical Variational Modelcited by 34
- 2019In AI We Trust? Factors That Influence Trustworthiness of AI-infused Decision-Making Processescited by 13
- 2021When and How to Fool Explainable Models (and Humans) with Adversarial Examplescited by 10
- 2022Robustness of Unsupervised Representation Learning without Labelscited by 2
Built on by
Not cited yet.