Scaling Laws for Uncertainty in Deep Learning
Mattia Rosso, Simone Rossi, Giulio Franzese, Markus Heinonen, Maurizio Filippone
TL;DR
This work investigates whether predictive uncertainties in deep learning obey scaling laws with dataset size $N$ and model size $P$. It combines a broad empirical study—across CNNs, ViTs, and language models using Monte Carlo dropout, Gaussian approximations, MCMC, deep ensembles, and partially stochastic networks—with theoretical insights linking generalization and uncertainty in identifiable parametric models. The authors demonstrate robust power-law scaling for in- and out-of-distribution uncertainties and provide a Bayesian-linear-regression-based account showing $O(1/N)$ contraction in identifiable settings, while overparameterization yields more complex, architecture- and method-dependent behavior. They discuss practical implications for extrapolating uncertainties to larger data and models and highlight limitations of entropy-based uncertainty metrics and the need for optimization-aware theory and singular-learning perspectives.
Abstract
Deep learning has recently revealed the existence of scaling laws, demonstrating that model performance follows predictable trends based on dataset and model sizes. Inspired by these findings and fascinating phenomena emerging in the over-parameterized regime, we examine a parallel direction: do similar scaling laws govern predictive uncertainties in deep learning? In identifiable parametric models, such scaling laws can be derived in a straightforward manner by treating model parameters in a Bayesian way. In this case, for example, we obtain $O(1/N)$ contraction rates for epistemic uncertainty with respect to the number of data $N$. However, in over-parameterized models, these guarantees do not hold, leading to largely unexplored behaviors. In this work, we empirically show the existence of scaling laws associated with various measures of predictive uncertainty with respect to dataset and model sizes. Through experiments on vision and language tasks, we observe such scaling laws for in- and out-of-distribution predictive uncertainty estimated through popular approximate Bayesian inference and ensemble methods. Besides the elegance of scaling laws and the practical utility of extrapolating uncertainties to larger data or models, this work provides strong evidence to dispel recurring skepticism against Bayesian approaches: "In many applications of deep learning we have so much data available: what do we need Bayes for?". Our findings show that "so much data" is typically not enough to make epistemic uncertainty negligible.
