- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
- This paper proposes GeoHOC, a geometric framework for hierarchical out-of-distribution classification that aims to recognize known classes while assigning unseen classes to their appropriate semantic ancestors. The method represents each category as an angular cap in a normalized vision-language embedding space, with a learnable center and radius controlling semantic direction and acceptance extent. Training combines hierarchical path discrimination, parent-child containment regularization, and cap-based discrimination to encourage correct branch selection and rejection of incorrect sibling classes. During inference, the model recursively selects the most similar child based on its center and uses a calibrated cap acceptance threshold to determine whether to continue descending or stop at the current node. The authors also introduce a known-only calibration strategy that simulates unseen classes by masking known child categories when selecting the stopping threshold. Experiments on CIFAR-100, CUB-200, and Stanford Cars demonstrate improvements in the combined known-class recognition and novel-parent recovery metric, with additional ablations examining the contribution of the geometric objectives and learned parameters.
Critical strengths
- The paper presents a clear and reasonably well-motivated geometric formulation for hierarchical out-of-distribution classification. Representing each class with a learnable angular center and radius provides an intuitive way to connect semantic classification with prediction granularity. The separation between branch localization and cap-based acceptance is also practical and easy to understand.
- The empirical evaluation is reasonably thorough, covering three datasets with multiple folds or seeds, comparisons against recent hierarchical novelty detection methods, and ablations of the main components. I particularly appreciate the inclusion of matched-backbone cosine baselines, geometric containment diagnostics, and recognition-fallback trade-off analysis, which provide useful evidence beyond the primary accuracy metric.
Critical weaknesses
-
While the overall results are positive, the empirical advantage is somewhat less convincing than the main presentation suggests. GeoHOC achieves the highest MixBAcc on all three datasets, but the improvements over the strongest baselines are only 1.37 and 0.76 percentage points on CUB-200 and Stanford Cars, respectively. Moreover, ProHOC achieves higher novel-parent accuracy on both datasets, and GeoHOC does not achieve the best AUROC on any of the three benchmarks. The main comparisons also involve different backbone architectures, making it difficult to isolate the contribution of the proposed geometry from the underlying visual representations. Although the matched-backbone ablations help, the improvement over the depth-wise cosine baseline on CUB-200 is relatively modest.
-
The geometric formulation is intuitive, but its practical relationship to the claimed nested acceptance regions is not entirely clear. The containment constraint is enforced through a soft penalty rather than guaranteed, and Table 4 shows that approximately 39.4% of parent-child edges still violate the sufficient nesting condition on CUB-200. The calibrated stopping offset further changes the effective acceptance boundaries, so the extent to which the final decision regions preserve the intended hierarchical geometry remains unclear. In addition, all three evaluations focus on unseen fine-grained classes with retained direct parents, leaving the behavior under more general hierarchical novelty scenarios largely untested.
Questions for authors
- The improvements over the strongest baselines on CUB-200 and Stanford Cars are relatively small, while the novel-parent accuracy is lower than ProHOC on both datasets. Could the authors provide a clearer comparison of the known-versus-novel trade-off against the strongest existing methods, preferably under matched backbone settings? Since the method combines OpenCLIP adaptation with learned node-specific acceptance boundaries, stronger evidence isolating the benefit of the geometric formulation would improve my assessment.
- Table 4 reports that approximately 39.4% of parent-child edges still violate the sufficient containment condition, even after applying the nesting loss. How often do the learned caps actually fail to satisfy geometric containment, and how does this change after applying the calibrated stopping offset? It would also be useful to understand whether enforcing stricter nesting improves or hurts the final classification results.
- The reported AUROC is lower than the strongest baseline on all three datasets. Appendix D.2 indicates that the novelty score combines cap-based risk with frozen-CLIP similarity risk. Could the authors report the AUROC of these two components separately and clarify how much the learned cap geometry contributes to out-of-distribution discrimination?
- The experiments consider unseen leaf classes whose direct parent remains in the existing hierarchy. How does GeoHOC behave when unseen classes appear at higher hierarchical levels, or when no meaningful existing ancestor is available? Since the method is framed as hierarchical out-of-distribution classification, evidence beyond the held-out leaf setting would help establish the scope of its applicability.