Hier-COS: Making Deep Features Hierarchy-aware via Composition of Orthogonal Subspaces
Depanshu Sani, Saket Anand
摘要
Traditional classifiers treat all class labels as mutually independent, thereby considering all negative classes to be equally incorrect. This approach fails severely in many real-world scenarios, where a known semantic hierarchy defines a partial order of preferences over negative classes. While hierarchy-aware feature representations have shown promise in mitigating this problem, their performance is typically assessed using metrics like Mistake Severity (MS) and Average Hierarchical Distance (AHD). In this paper, we highlight important shortcomings in existing hierarchical evaluation metrics, demonstrating that they are often incapable of measuring true hierarchical performance. Our analysis reveals that existing methods learn sub-optimal hierarchical representations, despite competitive MS and AHD scores. To counter these issues, we introduce Hierarchical Composition of Orthogonal Subspaces (Hier-COS), a novel framework for unified 'hierarchy-aware fine-grained' and 'hierarchical multi-label' classification. We show that Hier-COS is theoretically guaranteed to be consistent with the given hierarchy tree. Furthermore, our framework implicitly adapts the learning capacity for different classes based on their position within the hierarchy tree — a vital property absent in existing methods. Finally, to address the limitations of evaluation metrics, we propose Hierarchically Ordered Preference Score (HOPS), a ranking-based metric that demonstrably overcomes the deficiencies of current evaluation standards. We benchmark Hier-COS on four challenging datasets, including the deep and imbalanced tieredImageNet-H (12-level) and iNaturalist-19 (7-level). Through extensive experiments, we demonstrate that Hier-COS achieves state-of-the-art performance across all hierarchical metrics for every dataset, while simultaneously beating the top-1 accuracy in all but one case. Lastly, we show that Hier-COS can effectively learn to transform the frozen features extracted from a pretrained backbone (ViT) to be hierarchy-aware, yielding substantial benefits for hierarchical classification performance.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper8
- No Cost Likelihood Manipulation at Test Time for Making Better Mistakes in Deep NetworksShyamgopal Karthik, Ameya Prabhu, Puneet K. Dokania, Vineet GandhiICLR 2021 · 被引用 26 次
- Inducing Neural Collapse to a Fixed Hierarchy-Aware Frame for Reducing Mistake SeverityTong Liang, Jim DavisICCV 2023 · 被引用 14 次
- Consistency-aware Feature Learning for Hierarchical Fine-grained Visual ClassificationRui Wang, Cong Zou, Weizhong Zhang, Zixuan Zhu 等ACM MM 2023 · 被引用 6 次
- Hyperbolic Image EmbeddingsValentin Khrulkov, Leyla Mirvakhabova, Evgeniya Ustinova, Ivan V. Oseledets 等CVPR 2020
- Making Better Mistakes: Leveraging Class Hierarchies With Deep NetworksLuca Bertinetto, Romain Müller, Konstantinos Tertikas, Sina Samangooei 等CVPR 2020
相关 Paper
- Test-Time Amendment with a Coarse Classifier for Fine-Grained ClassificationKanishk Jain, Shyamgopal Karthik, Vineet GandhiNeurIPS 2023 · 被引用 9 次
- Hierarchical classification at multiple operating pointsJack ValmadreNeurIPS 2022 · 被引用 27 次
- HGLTR: Hierarchical Knowledge Injection for Calibrating Pre-trained Models in Long-Tail RecognitionJinpeng Zheng, Shao-Yuan Li, Gan Xu, Wenhai Wan 等AAAI 2026
- Uncertainty-Aware Hierarchical Refinement for Incremental Implicitly-Refined ClassificationJian Yang, Kai Zhu, Kecheng Zheng, Yang CaoNeurIPS 2022 · 被引用 4 次
- Visually Consistent Hierarchical Image ClassificationSeulki Park, Youren Zhang, Stella X. Yu, Sara Beery 等ICLR 2025
