Pith. sign in

REVIEW

Sampling-free Epistemic Uncertainty Estimation Using Approximated Variance Propagation

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

arxiv 1908.00598 v3 pith:KM3WB42E submitted 2019-08-01 cs.LG stat.ML

classification cs.LGstat.ML
keywords uncertaintyepistemicapproachcomputationalmonte-carloneuraloverheadquantity
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present a sampling-free approach for computing the epistemic uncertainty of a neural network. Epistemic uncertainty is an important quantity for the deployment of deep neural networks in safety-critical applications, since it represents how much one can trust predictions on new data. Recently promising works were proposed using noise injection combined with Monte-Carlo sampling at inference time to estimate this quantity (e.g. Monte-Carlo dropout). Our main contribution is an approximation of the epistemic uncertainty estimated by these methods that does not require sampling, thus notably reducing the computational overhead. We apply our approach to large-scale visual tasks (i.e., semantic segmentation and depth regression) to demonstrate the advantages of our method compared to sampling-based approaches in terms of quality of the uncertainty estimates as well as of computational overhead.

Discussion (0). Continue with ORCID to comment.

Pith tools