mlsanityData to 7 Oct 2026

Hierarchical, Interpretable, Label-Free Concept Bottleneck Model

arXiv 2604.02468 ↗First posted 2 Apr 2026cs.CV cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Concept Bottleneck Models (CBMs) introduce interpretability to black-box deep learning models by predicting labels through human-understandable concepts. However, unlike humans, who identify objects at different levels of abstraction using both general and specific features, existing CBMs operate at a single semantic level in both concept and label space. We propose HIL-CBM, a Hierarchical Interpretable Label-Free Concept Bottleneck Model that extends CBMs into a hierarchical framework to enhance interpretability by more closely mirroring the human cognitive process. HIL-CBM enables classification and explanation across multiple semantic levels without requiring relational concept annotations. HIL-CBM aligns the abstraction level of concept-based explanations with that of model predictions, progressing from abstract to concrete. This is achieved by (i) introducing a gradient-based visual consistency loss that encourages abstraction layers to focus on similar spatial regions, and (ii) training dual classification heads, each operating on feature concepts at different abstraction levels. Experiments on benchmark datasets demonstrate that HIL-CBM outperforms state-of-the-art sparse CBMs in classification accuracy. Human evaluations further show that HIL-CBM provides more interpretable and accurate explanations, while maintaining a hierarchical and label-free approach to feature concepts.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 26 of its 42 references that are in the map. First posted on arXiv 2 Apr 2026.

Builds on

26 of 42 references.

References · 26

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  3. 2020Language Models are Few-Shot Learnerscited by 32,199
  4. 2023GPT-4 Technical Reportcited by 18,132
  5. 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
  6. 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,348
  7. 2017Interpretability Beyond Feature Attribution: Quantitative Testing with Concept Activation Vectors (TCAV)cited by 1,309
  8. 2020Concept Bottleneck Modelscited by 1,022
  9. 2022Post-hoc Concept Bottleneck Modelscited by 289
  10. 2023Label-Free Concept Bottleneck Modelscited by 282
  11. 2023BioCLIP: A Vision Foundation Model for the Tree of Lifecited by 159
  12. 2022CLIP-Dissect: Automatic Description of Neuron Representations in Deep Vision Networkscited by 144
14 more
  1. 2019Taking a HINT: Leveraging Explanations to Make Vision and Language Models More Groundedcited by 127
  2. 2021Leveraging Sparse Linear Layers for Debuggable Deep Networkscited by 82
  3. 2023CHiLS: Zero-Shot Image Classification with Hierarchical Label Setscited by 79
  4. 2019Interpretable Image Recognition with Hierarchical Prototypescited by 64
  5. 2020CASTing Your Model: Learning to Localize Improves Self-Supervised Representationscited by 63
  6. 2017Do Convolutional Neural Networks Learn Class Hierarchy?cited by 61
  7. 2022Use All The Labels: A Hierarchical Multi-Label Contrastive Learning Frameworkcited by 59
  8. 2023Coarse-to-Fine Concept Bottleneck Modelscited by 31
  9. 2021Consistent Explanations by Contrastive Learningcited by 18
  10. 2024Visually Consistent Hierarchical Image Classificationcited by 16
  11. 2025Show and Tell: Visually Explainable Deep Neural Nets via Spatially-Aware Concept Bottleneck Modelscited by 12
  12. 2019Hierarchical Prototype Learning for Zero-Shot Recognitioncited by 5
  13. 2023Hierarchical Dynamic Masks for Visual Explanation of Neural Networkscited by 4
  14. 2024Improving Network Interpretability via Explanation Consistency Evaluationcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.