REVIEW 2 cited by
Distance-based Confidence Score for Neural Network Classifiers
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
The reliable measurement of confidence in classifiers' predictions is very important for many applications and is, therefore, an important part of classifier design. Yet, although deep learning has received tremendous attention in recent years, not much progress has been made in quantifying the prediction confidence of neural network classifiers. Bayesian models offer a mathematically grounded framework to reason about model uncertainty, but usually come with prohibitive computational costs. In this paper we propose a simple, scalable method to achieve a reliable confidence score, based on the data embedding derived from the penultimate layer of the network. We investigate two ways to achieve desirable embeddings, by using either a distance-based loss or Adversarial Training. We then test the benefits of our method when used for classification error prediction, weighting an ensemble of classifiers, and novelty detection. In all tasks we show significant improvement over traditional, commonly used confidence scores.
Forward citations
Cited by 2 Pith papers
-
Active Learning for UAV-based Semantic Mapping
A novelty-guided drone path planner collects training images with useful new content faster than fixed lawnmower patterns, reaching 90% mIoU on a terrain map in three simulated missions.
-
Learning Densities in Feature Space for Reliable Segmentation of Indoor Scenes
A background-only normalizing-flow density estimator on CNN features detects foreground objects in indoor scenes and generalizes better to novel objects than a standard FCN softmax segmenter.
Discussion (0). Continue with ORCID to comment.