TL;DR
This paper introduces a computationally efficient method for quantifying epistemic uncertainty in deep neural networks using a modified Delta method based on the Fisher information matrix, demonstrated on image classification tasks.
Contribution
It proposes a low-cost Delta method variant for deep networks leveraging eigenpairs of the Fisher information matrix, with error bounds and practical implementation details.
Findings
Meaningful uncertainty rankings for images were obtained.
False positives exhibit higher epistemic uncertainty than true positives.
The method is effective on MNIST and CIFAR-10 datasets.
Abstract
The Delta method is a classical procedure for quantifying epistemic uncertainty in statistical models, but its direct application to deep neural networks is prevented by the large number of parameters . We propose a low cost variant of the Delta method applicable to -regularized deep neural networks based on the top eigenpairs of the Fisher information matrix. We address efficient computation of full-rank approximate eigendecompositions in terms of either the exact inverse Hessian, the inverse outer-products of gradients approximation or the so-called Sandwich estimator. Moreover, we provide a bound on the approximation error for the uncertainty of the predictive class probabilities. We observe that when the smallest eigenvalue of the Fisher information matrix is near the -regularization rate, the approximation error is close to zero even when . A demonstration…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
