Logit-based Uncertainty Measure in Classification
Not on the map. Why?
Abstract (arXiv)
We introduce a new, reliable, and agnostic uncertainty measure for classification tasks called logit uncertainty. It is based on logit outputs of neural networks. We in particular show that this new uncertainty measure yields a superior performance compared to existing uncertainty measures on different tasks, including out of sample detection and finding erroneous predictions. We analyze theoretical foundations of the measure and explore a relationship with high density regions. We also demonstrate how to test uncertainty using intermediate outputs in training of generative adversarial networks. We propose two potential ways to utilize logit-based uncertainty in real world applications, and show that the uncertainty measure outperforms.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 12 of its 16 references that are in the map. First posted on arXiv 6 Jul 2021.
Builds on
12 of 16 references.
References · 12
- 2016Densely Connected Convolutional Networkscited by 6,720
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
- 2018Evidential Deep Learning to Quantify Classification Uncertaintycited by 732
- 2017Deep Neural Networks as Gaussian Processescited by 622
- 2015Weight Uncertainty in Neural Networkscited by 554
- 2017Training Confidence-calibrated Classifiers for Detecting Out-of-Distribution Samplescited by 389
- 2018Gaussian Process Behaviour in Wide Deep Neural Networkscited by 317
- 2019Fixing the train-test resolution discrepancycited by 209
- 2018Deep k-Nearest Neighbors: Towards Confident, Interpretable and Robust Deep Learningcited by 207
- 2018To Trust Or Not To Trust A Classifiercited by 207
- 2020Concept Drift and Covariate Shift Detection Ensemble with Lagged Labelscited by 5
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1.
3 papers.