# On Last-Layer Algorithms for Classification: Decoupling Representation from Uncertainty Estimation

Source: [On Last-Layer Algorithms for Classification: Decoupling Representation from Uncertainty Estimation](<https://www.sota2.com/research/paper/68fa66ea1e209131cea1328b>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T22:02:19.923Z

Authors: Nicolas Brosse, Carlos Riquelme, Alice Martin, Sylvain Gelly, \\'Eric Moulines

Published: 2020-01-22T15:08:30.000Z

## Abstract

Uncertainty quantification for deep learning is a challenging open problem. Bayesian statistics offer a mathematically grounded framework to reason about uncertainties; however, approximate posteriors for modern neural networks still require prohibitive computational costs. We propose a family of algorithms which split the classification task into two stages: representation learning and uncertainty estimation. We compare four specific instances, where uncertainty estimation is performed via either an ensemble of Stochastic Gradient Descent or Stochastic Gradient Langevin Dynamics snapshots, an ensemble of bootstrapped logistic regressions, or via a number of Monte Carlo Dropout passes. We evaluate their performance in terms of \\emph{selective} classification (risk-coverage), and their ability to detect out-of-distribution samples. Our experiments suggest there is limited value in adding multiple uncertainty layers to deep classifiers, and we observe that these simple methods strongly outperform a vanilla point-estimate SGD in some complex benchmarks like ImageNet.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2001.08049>)

[PDF](<https://arxiv.org/pdf/2001.08049.pdf>)
