- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes a simple linear head for unsupervised part discovery on top of a frozen DINOv2 backbone as well as a merging criterion that allows changing the partition granularity after training the head. The method is evaluated on three benchmarks across three granularities with mixed results compared to prior works, which however have more complex architectures.
Critical strengths
The paper shows that unsupervised part discovery is possible based on strong frozen features with only a lightweight head (Table 2) and that the granularity of the resulting partitions can be adapted post-hoc (Table 6). This is relevant as prior works often employ more complex architectures (Table 3) and operate on fixed partition granularities (see e.g. Aniraj et al. 2024).
Critical weaknesses
The method relies on a fairly complex loss function with 6 high-level terms which can further contain multiple sub-components. However, the ablation shows that the different loss terms have very different impact depending on the dataset (Table 5). As an example, removing the foreground anchor loss slightly improves performance on CUB (K=16) while leading to a complete collapse on OOD (K=50). This draws into question how general and robust the loss function is. The complexity is further increased by having different weights for the individual loss terms which are set differently across benchmarks (Table 10) but never ablated. This makes it difficult to assess how general the objective is or how much it was tailored towards the exact benchmarks considered in the paper.
Questions for authors
The paper uses bfloat16 mixed precision (l.802) but compares memory usage using fp32 (l.353) which might skew the results. Is there a reason why the memory comparison does not use the experiment setup used in the rest of the paper?
Thank you for the response, which addresses some of my concerns. However, the rebuttal regarding novelty is not fully persuasive and the code is still not yet available, making it difficult to verify the implementation details.
Considering both the whole paper quality and the rebuttal, I still believe the paper merits a Weak Accept.