- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This work looks to critically examine the information-theory breakdown of total uncertainty into its aleatoric and epistemic components. The work reasons that the significant portions of the possible range for AU and EU are actually unreachable. The stated main contribution of the work is the derived bound that AU is .
Critical strengths
- The greater topic is valuable and of interest to the community. It is an attempt to map out the more detailed nuances of the standard decomposition of uncertainty and an attempt to impede epistemic collapse (model overconfidence), which is important for OOD detection.
- The conjecture presented discusses the ways to attain minimum AU for a given TU, and is plausible.
Critical weaknesses
-
While plausible, the paper does not describe the conjecture clearly, D is essentially the set of plausible ensemble votes where one member of the ensemble is uncertain, and D is also used to denote data earlier in the paper. The empirical backing with relatively simple datasets such as MNIST and CIFAR-10 are not sufficient in themselves to strongly back a claim.
-
The figures and the author's message can be strengthened by explicitly displaying the areas which are infeasible/unreachable.
-
Some observations presented as "theorems" are trivial. The contributions of this work then cannot be said to contain these "theorems".
Theorem 1 is about the traditional bounds of TU and EU, which are apparent from the definition and well-known. This makes Figure 2 also mostly trivial.
Theorem 2 is about the fact that at AU=0, the possible values of TU becomes discrete, because they require the ensemble members to have zero entropy, meaning every ensemble is a pure vote and their disagreement is then the only source of uncertainty.
Theorem 3 is about the uncertain ensemble member among the items that D contains. Since D is the set of ensemble votes where one member is uncertain, the AU must be the entropy of that one member divided by N, which must be less than the maximum possible binary entropy divided by N. Again, this is trivial.
Theorem 4 is the least trivial of the group though it is still quite simple. It describes the curves seen in earlier figures, specifically the lowest curve. It's claim about the first "bubble" drives the argument in L377 about ensuring AU > EU, but this is extremely vague and not discussed in the theorem at all.
I would recommend that the narrative is fully restructured in terms of presentation of these ideas. However, even if this is done, the contrubution for the work remains too minor at this point in time, with insufficient backing.
Questions for authors
- Are properly calibrated models still a concern when it comes to epistemic collapse?