Decomposing Representations for Deterministic Uncertainty Estimation
Not on the map. Why?
Abstract (arXiv)
Uncertainty estimation is a key component in any deployed machine learning system. One way to evaluate uncertainty estimation is using "out-of-distribution" (OoD) detection, that is, distinguishing between the training data distribution and an unseen different data distribution using uncertainty. In this work, we show that current feature density based uncertainty estimators cannot perform well consistently across different OoD detection settings. To solve this, we propose to decompose the learned representations and integrate the uncertainties estimated on them separately. Through experiments, we demonstrate that we can greatly improve the performance and the interpretability of the uncertainty estimation.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 7 of its 14 references that are in the map. First posted on arXiv 1 Dec 2021.
Builds on
7 of 14 references.
References · 7
- 2016Wide Residual Networkscited by 3,057
- 2018A Simple Unified Framework for Detecting Out-of-Distribution Samples and Adversarial Attackscited by 1,472
- 2018Invertible Residual Networkscited by 364
- 2021A Simple Fix to Mahalanobis Distance for Improving Near-OOD Detectioncited by 206
- 2020Contrastive Training for Improved Out-of-Distribution Detectioncited by 186
- 2018Excessive Invariance Causes Adversarial Vulnerabilitycited by 66
- 2020Why is the Mahalanobis Distance Effective for Anomaly Detection?cited by 28
Built on by
Citing papers per year: 2023: 1.
1 paper.
- 2023Two-step counterfactual generation for OOD examplescited by 0
- 2023Two-step counterfactual generation for OOD examples10 Feb 2023