Summary
- The authors propose a probabilistic probing method to understand a given pre-trained classifier.
- The authors describe how looking at classifier predicted class probabilities is not enough since "0.5" in a binary task can happen for several reasons spanning the aleatoric/epistemic uncertainty spectrum
- On the other hand, the proposed probabilistic method allows for posterior estimates of classifier's predicted probabilities, which allows for example to produce variance/entropy/etc
- The particular method used is to compute functions g() of a classifier's representation a(x) for inputs x and to study the distribution of g()
- The distribution of g() is defined through a hierarchical GP called the Beta GP
- After giving an exposition of the model the authors introduce two sets of experiments: whether the probe can correctly identify that there is true label uncertainty in some synthetic experiments, and whether the model can correctly identify that data is OOD for a given classifier.
While proposed method is well motivated and properly defined, I have some major questions regarding evaluation (proper definition of all tasks and baselines). For now, I think the paper needs some clarification before acceptance, but would be glad to raise my score, given clarification from authors.
Strengths
The papers strength's are:
- Beta-GP-based probing method is very clearly defined
- All of the computations e.g. posterior computations are precisely stated in the appendix
- The overall motivation of the work (probabilistic probing) is solid
- The introduced entropy/variance based metrics that pull apart some aspects of aleatoric versus epistemic uncertainty, adapted from previous literature, seem like a nice contribution to uncertainty/probing evaluation metrics
Weaknesses
There are two downstream uses of the method
- checking correlation of probes' reported uncertainty versus the true label uncertainty for synthetic/semi-synthetic datasets
- OOD detection
The precise definitions for baselines in uncertainty estimation experiments were not given (namely LPE) and more definitions are necessary to correctly interpret the variance/entropy-based metrics. See "Questions".
For OOD detection, the superiority over baselines is exemplified but the baselines are out of date. The synthetic dataset is not named, and some details are missing from the Imagenet result to understand exactly how to the pretrained model checkpoints were run on the binarized data. See "questions"
Minor writing style suggestion that does not affect my review: In sentences like
"There are important details in Beta GPs that require special attention: how to set the prior and how to approximate the posterior."
Since there are a few distributions floating around that were recently introduced to the reader, it could be helpful to include the symbols in mid-sentence: "There are two important details in Beta GPs that requires special attention: how to set the prior (mu and k(,) in GP(mu,k))
and how to approximate the posterior p(f_alpha,f_beta | D, mu k )."
And include a sentence after
"With samples from the posterior (falpha, fbeta) we can then approximate the distribution of g()~G with the log normals parameterized by f_alpha, f_beta."
This could help the reader piece everything together.
Questions
The results for the first experimental section (uncertainty quantification) seem convincing relative to the baselines but one major issue
- LPE is not cited, and the authors do not mention that they propose it. There is only a high-level description given. I was trying to look for a precise definition of the method since it is taken as one of the main baselines, but cannot find it anywhere.
- Please give a citation for LPE, or precisely define it and state that this is a baseline proposed by the authors.
- This is moreover important since one cannot arbitrarily compare model entropies/variances with each other for continuous models without more assumptions (same base measure, etc). And for this, precise definition of all distributions is important.
For OOD detection, two main groups of concerns, task definition and baselines:
Task issue 1:
- there seem two be two datasets, a synthetic one and ImageNet
- this section doesn't explicitly name which synthetic dataset. I only assume by continuity that it is the shapes dataset from the previous subsection. Please name all datasets in all sections/captions/figures they are used in rather than just refer to "synthetic data".
- The authors say "we generate another set of queries that include 1024 ID images and 1024 OOD images (uniform random
noise)" but don't say from where is the in-distribution.
Task issue 2:
- For Imagenet there are also some missing details that stop me from understanding the experiment.
- I understand this: "Queries and observations are sampled disjointly from the validation split of the ImageNet dataset"
- I understand this + I read the appendix section: "We make 10 set of Ds using 10 binary classification tasks defined by supersets of ImageNet classes"
- How are the pre-trained classifiers use? Did you specifically pull checkpoints that were also trained on the binarized problems? Or did you somehow pool together a multiclass classifier's probabilities for the underlying model + renormalize? What happened to the probabilities assigned to the other classes?
- Please let us know and then revise the paper to clarify the exact use of the pre-trained models versus the data and what exactly was computed, including any equations if there were any transformation steps from multiclass checkpoints to the binary task, or clarify that binary classification model checkpoints were used that correspond to the same binarization that you applied to the data
- Also, is the out-distribution in both datasets just uniform noise, or uniform noise added to ID data?
Baselines: The baselines seem a little out of date, with the two non-LPE baselines (again, where is LPE from?) being from 2016 and 2018. It's okay to include older baselines as part of a broader evaluation, but why not include also recent methods from 2020-2023 such as any of the below. I might be missing context on this sub-area of ML, but at least in others I review actively, it's fairly rare to find a paper that only evaluates to methods from <=2018. Several well-cited recent methods are documented below. Maybe not all are applicable as baselines for your particular setup/model assumptions/method assumptions (e.g. black box vs having access to something), but please clarify.
- 2018, ODIN, Enhancing the reliability of out-of-distribution image
detection in neural networks. https://arxiv.org/abs/1706.02690
- 2018, A simple unified framework for detecting out-of-distribution samples and adversarial attacks.
https://papers.nips.cc/paper_files/paper/2018/hash/abdeb6f575ac5c6676b747bca8d09cc2-Abstract.html
- 2019 Likelihood Ratios for Out-of-Distribution Detection https://proceedings.neurips.cc/paper_files/paper/2019/file/1e79596878b2320cac26dd792a6c51c9-Paper.pdf
- 2020, Energy-based out-of-distribution detection. https://proceedings.neurips.cc/paper/2020/hash/f5496252609c43eb8a3d147ab9b9c006-Abstract.html
- 2021, REACT, React: Out-of-distribution detection with rectified activations.
https://proceedings.neurips.cc/paper/2021/hash/01894d6f048493d2cacde3c579c315a3-Abstract.html
- 2022, Dice: Leveraging sparsification for out-of-distribution detection. In ECCV,
https://arxiv.org/abs/2111.09805
- 2022, Out-of-distribution detection with deep nearest neighbors. https://arxiv.org/abs/2204.06507
- 2022, Scaling out-of-distribution detection for real-world settings, https://arxiv.org/abs/1911.11132
- 2022, Vim: Out-of-distribution with virtual-logit matching, https://arxiv.org/abs/2203.10807
- 2022, a review: https://arxiv.org/pdf/2110.11334.pdf
In short, it seems like good work, but it seems like authors know more than the readers (about task definitions, datasets, why newer baselines were not used). Please clarify. Glad to increase score if sufficient answers given to these concerns. Most concerns can be answered without experiments except the "old baselines" concern, which requires either experiments or a commitment to include newer baselines.
Rating
6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.
Confidence
3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.