An Isotropic Approach to Efficient Uncertainty Quantification with Gradient Norms
Nils Gr\"unefeld, Jes Frellsen, Christian Hardmeier

TL;DR
This paper introduces a computationally efficient method for quantifying uncertainty in neural networks using gradient norms and an isotropy assumption, applicable to large models without training data access.
Contribution
It proposes a lightweight, isotropic approximation for epistemic and aleatoric uncertainty estimation from a single forward-backward pass, validated against MCMC estimates.
Findings
Strong correlation with MCMC estimates on synthetic problems
Uncertainty improves answer correctness prediction on TruthfulQA
Parameter uncertainty captures different signals than self-assessment
Abstract
Existing methods for quantifying predictive uncertainty in neural networks are either computationally intractable for large language models or require access to training data that is typically unavailable. We derive a lightweight alternative through two approximations: a first-order Taylor expansion that expresses uncertainty in terms of the gradient of the prediction and the parameter covariance, and an isotropy assumption on the parameter covariance. Together, these yield epistemic uncertainty as the squared gradient norm and aleatoric uncertainty as the Bernoulli variance of the point prediction, from a single forward-backward pass through an unmodified pretrained model. We justify the isotropy assumption by showing that covariance estimates built from non-training data introduce structured distortions that isotropic covariance avoids, and that theoretical results on the spectral…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
