On the Epistemic Uncertainty of Overparametrized Neural Networks
read the original abstract
Epistemic uncertainty is often viewed as a reducible uncertainty that vanishes with increasing data. This perspective implicitly assumes parameter identifiability and equates epistemic uncertainty with predictive variability. In overparametrized neural networks, however, model parameters are typically non-identifiable due to symmetries and redundant representations. As a consequence, substantial parameter uncertainty can persist even when the underlying function is fully identified. In this work, we analyze epistemic uncertainty through the lens of non-identifiability and characterize both discrete and continuous sources of residual uncertainty. Focusing on one-hidden-layer ReLU networks, we thoroughly analyze the resulting posterior structure and validate our theoretical insights through empirical studies.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Epistemic Uncertainty Is Not the Reducible Kind
The mutual-information measure of epistemic uncertainty is not reducible by additional data, requiring a split into aleatoric, sample-reducible epistemic, and mechanism-reducible epistemic uncertainty.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.