Is the Last Layer Sufficient for Uncertainty Quantification?
Not on the map. Why?
Abstract (arXiv)
Epistemic uncertainty quantification (UQ) for deep neural networks (DNNs) is a requirement for safe adoption of AI in mission-critical settings. Several leading methods for UQ linearize DNNs to form Bayesian Generalized Linear Models (GLMs), where epistemic uncertainty is modeled via the predictive posterior distribution. Linearizing around the parameters of the final connected layer of a DNN is a commonly used approximation for reducing the computational burden of such GLMs, though it is often believed to come at the cost of degraded performance. In this work, we compare GLMs arising from full-network and last-layer linearization using both theoretical and empirical approaches. We first employ tools from random matrix theory to conduct a theoretical comparison; this analysis reveals no meaningful improvement in the UQ capabilities of full linearization. Coupled with a large-scale empirical evaluation across a range of modern machine learning tasks, we arrive at the following conclusion: a last-layer approximation yields comparable UQ performance while offering substantially improved computational efficiency.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 61 of its 92 references that are in the map. First posted on arXiv 29 May 2026.
Builds on
61 of 92 references.
References · 61
- 2017Attention Is All You Needcited by 59,932
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
- 2017Deep Neural Networks as Gaussian Processescited by 617
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 572
- 2019A Simple Baseline for Bayesian Uncertainty in Deep Learningcited by 555
- 2019Benign Overfitting in Linear Regressioncited by 544
38 more
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 410
- 2020Simple and Principled Uncertainty Estimation with Deterministic Deep Learning via Distance Awarenesscited by 389
- 2021Laplace Redux -- Effortless Bayesian Deep Learningcited by 359
- 2018Gaussian Process Behaviour in Wide Deep Neural Networkscited by 314
- 2021The Intrinsic Dimension of Images and Its Impact on Learningcited by 307
- 2015Scalable Bayesian Optimization Using Deep Neural Networkscited by 284
- 2019Intrinsic dimension of data representations in deep neural networkscited by 276
- 2021Deep learning: a statistical viewpointcited by 239
- 2019What's Hidden in a Randomly Weighted Neural Network?cited by 236
- 2021MOS: Towards Scaling Out-of-distribution Detection for Large Semantic Spacecited by 233
- 2020Loss landscapes and optimization in over-parameterized non-linear systems and neural networkscited by 231
- 2020Being Bayesian, Even Just a Bit, Fixes Overconfidence in ReLU Networkscited by 227
- 2020Deep learning versus kernel learning: an empirical study of loss landscape geometry and the time evolution of the Neural Tangent Kernelcited by 185
- 2018Understanding Measures of Uncertainty for Adversarial Example Detectioncited by 177
- 2018Dimensionality-Driven Learning with Noisy Labelscited by 173
- 2021A Universal Law of Robustness via Isoperimetrycited by 150
- 2022Quantifying Aleatoric and Epistemic Uncertainty in Machine Learning: Are Conditional Entropy and Mutual Information Appropriate Measures?cited by 124
- 2021Scalable Marginal Likelihood Estimation for Model Selection in Deep Learningcited by 105
- 2020The Neural Tangent Kernel in High Dimensions: Triple Descent and a Multi-Scale Theory of Generalizationcited by 101
- 2016PAC-Bayesian Theory Meets Bayesian Inferencecited by 87
- 2019Harnessing the Power of Infinitely Wide Deep Nets on Small-data Taskscited by 87
- 2019'In-Between' Uncertainty in Bayesian Neural Networkscited by 79
- 2020Spectra of the Conjugate Kernel and Neural Tangent Kernel for linear-width neural networkscited by 76
- 2020A Random Matrix Analysis of Random Fourier Features: Beyond the Gaussian Kernel, a Precise Phase Transition, and the Corresponding Double Descentcited by 69
- 2021DOCTOR: A Simple Method for Detecting Misclassification Errorscited by 52
- 2022Rank Diminishing in Deep Neural Networkscited by 47
- 2019Robustness of Neural Networks: A Probabilistic and Practical Approachcited by 38
- 2019On the marginal likelihood and cross-validationcited by 36
- 2021Fast Adaptation with Linearized Neural Networkscited by 32
- 2022Spectral Evolution and Invariance in Linear-width Neural Networkscited by 30
- 2022Accelerated Linearized Laplace Approximation for Bayesian Deep Learningcited by 27
- 2023Uncertainty Quantification in Machine Learning for Engineering Design and Health Prognostics: A Tutorialcited by 27
- 2023Mind the spikes: Benign overfitting of kernels and neural networks in fixed dimensioncited by 26
- 2020On Last-Layer Algorithms for Classification: Decoupling Representation from Uncertainty Estimationcited by 23
- 2022Sampling-based inference for large linear models, with application to linearised Laplacecited by 18
- 2023Variational Linearized Laplace Approximation for Bayesian Deep Learningcited by 17
- 2023A Data-Driven Measure of Relative Uncertainty for Misclassification Detectioncited by 14
- 2023Beyond the Universal Law of Robustness: Sharper Laws for Random Features and Neural Tangent Kernelscited by 13
50 most cited of 61 All 61 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.