Predictive uncertainty separates within-model variation from disagreement only relative to the chosen inputs, likelihood and model distribution.
Summary
Which proposed collection action can reduce the predictive spread at this input? Fix input , observed dataset and a distribution over models indexed by . Use the hypothetical equal-weight mixture and . Each normal’s second parameter is its variance.
| Quantity | Calculation | Result |
|---|---|---|
| Predictive mean | 1 | |
| Average conditional variance | 1 | |
| Variance of conditional means | 1 | |
| Total variance | 2 |
Independently, . Subtracting the squared mean gives again.
How they show up mathematically
Let and ; assume finite second moments. Write and square. The cross term vanishes after conditioning on , because . Thus, under the specified model mixture,
Call these model-relative within and between terms aleatoric and epistemic, respectively. Both use squared output units. The identity does not require Gaussian components; their normal form only simplifies this example. More representative data can change model uncertainty, but no universal monotonic decrease is guaranteed.
Learning objective
Separated model means add uncertainty even when each model is confident
Derivation
Can individually concentrated models form a wide mixture?
Change the information or output
Add an informative sensor
New task: supply missing predictive information, rather than repeat the same observations.
Picture and change: suppose each conditional variance falls from one to , while means and mixture weights stay fixed.
Check: within variance becomes ; between variance remains one; total variance is . The old within-model noise was not irreducible relative to the expanded inputs.
Use when: the proposed sensor changes the conditioning information; the stated reduction still needs empirical validation.
Predict a binary label
New task: measure information spread for equally weighted probabilities and .
Picture and change: their mean is . Use entropy in bits, not regression variance.
Check: predictive entropy is one bit; average conditional entropy is approximately bits. The difference is approximately bits of mutual information between the label and this mixture’s model index.
Use when: categorical predictions make an entropy decomposition appropriate. A diverse ensemble is not automatically an exact posterior.
Failure and transfer
All members can predict mean zero and variance while target outputs are near ten. Zero disagreement does not certify correctness, calibration or in-distribution inputs. Now change the Gaussian weights to three quarters and one quarter. What happens?
Reasoned answer
The predictive mean is . Between variance is , within variance remains one, and total variance is . Changing weights changes the distribution being averaged, not merely an uncertainty label.
Estimating each in practice
Aleatoric
For heteroskedastic Gaussian regression, predict mean and log variance , making variance positive. Ignoring the normalizing constant, NLL is . Fit quality and likelihood assumptions determine whether this estimates actual conditional noise. See Kendall and Gal.
Epistemic
| Approach | Approximation | Cost to assess |
|---|---|---|
| Deep ensemble | diversity across separately fitted predictors | multiple training and serving runs |
| MC dropout | stochastic masks in a compatible dropout-trained model | repeated forward passes |
| Variational, SWAG or Laplace | a specified approximate parameter distribution | fitting, storage and sampling overhead |
Measure approximation adequacy instead of declaring a universal strongest method or minimum ensemble size. BatchNorm behavior must remain controlled when enabling dropout sampling. References: deep ensembles and MC dropout.
Decomposition
For discrete mixture weights , let . Then . The difference is model-index mutual information under that joint distribution, not an automatic measurement of real-world ignorance.
Where each matters in practice
Active learning weighs expected information or decision benefit against acquisition cost; noisy labels can still be useful. Abstention, fallback and exploration require task-specific action costs and target-domain validation. No decomposition provides a universal out-of-distribution detector or safety guarantee.
Common pitfalls
One softmax vector cannot identify how uncertainty divides across plausible models. Agreement can reflect common misspecification. A fair binary outcome has variance or entropy one bit; probability alone does not specify uncertainty units.