mlsanityData to 7 Oct 2026

B-cosification: Transforming Deep Neural Networks to be Inherently Interpretable

arXiv 2411.00715 ↗First posted 1 Nov 2024cs.CV cs.AI cs.LGcited by 12

Not on the map. Why?

Abstract (arXiv)

B-cos Networks have been shown to be effective for obtaining highly human interpretable explanations of model decisions by architecturally enforcing stronger alignment between inputs and weight. B-cos variants of convolutional networks (CNNs) and vision transformers (ViTs), which primarily replace linear layers with B-cos transformations, perform competitively to their respective standard variants while also yielding explanations that are faithful by design. However, it has so far been necessary to train these models from scratch, which is increasingly infeasible in the era of large, pre-trained foundation models. In this work, inspired by the architectural similarities in standard DNNs and B-cos networks, we propose 'B-cosification', a novel approach to transform existing pre-trained models to become inherently interpretable. We perform a thorough study of design choices to perform this conversion, both for convolutional neural networks and vision transformers. We find that B-cosification can yield models that are on par with B-cos models trained from scratch in terms of interpretability, while often outperforming them in terms of classification performance at a fraction of the training cost. Subsequently, we apply B-cosification to a pretrained CLIP model, and show that, even with limited data and compute cost, we obtain a B-cosified version that is highly interpretable and competitive on zero shot performance across a variety of datasets. We release our code and pre-trained model weights at https://github.com/shrebox/B-cosification.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 48 of its 60 references that are in the map. First posted on arXiv 1 Nov 2024.

Builds on

48 of 60 references.

References · 48

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  4. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  5. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  6. 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
  7. 2016Densely Connected Convolutional Networkscited by 6,691
  8. 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
  9. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  10. 2017Axiomatic Attribution for Deep Networkscited by 3,350
  11. 2023Sigmoid Loss for Language Image Pre-Trainingcited by 3,048
  12. 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,348
36 more
  1. 2017Learning Important Features Through Propagating Activation Differencescited by 1,454
  2. 2018Sanity Checks for Saliency Mapscited by 1,149
  3. 2020Concept Bottleneck Modelscited by 1,022
  4. 2014Striving for Simplicity: The All Convolutional Netcited by 983
  5. 2018This Looks Like That: Deep Learning for Interpretable Image Recognitioncited by 731
  6. 2019Score-CAM: Score-Weighted Visual Explanations for Convolutional Neural Networkscited by 575
  7. 2020Captum: A unified and generic model interpretability library for PyTorchcited by 542
  8. 2021Early Convolutions Help Transformers See Bettercited by 395
  9. 2021Generic Attention-model Explainability for Interpreting Bi-Modal and Encoder-Decoder Transformerscited by 316
  10. 2017Right for the Right Reasons: Training Differentiable Models by Constraining their Explanationscited by 293
  11. 2022Post-hoc Concept Bottleneck Modelscited by 289
  12. 2023Label-Free Concept Bottleneck Modelscited by 282
  13. 2020Neural Prototype Trees for Interpretable Fine-grained Image Recognitioncited by 213
  14. 2019Full-Gradient Representation for Neural Network Visualizationcited by 189
  15. 2013Maxout Networkscited by 186
  16. 2021Deformable ProtoPNet: An Interpretable Image Classifier Using Deformable Prototypescited by 120
  17. 2021Do Feature Attribution Methods Correctly Attribute Features?cited by 98
  18. 2022Better plain ViT baselines for ImageNet-1kcited by 97
  19. 2020Don't Judge an Object by Its Context: Learning to Overcome Contextual Biascited by 91
  20. 2024Discover-then-Name: Task-Agnostic Concept Bottlenecks via Automated Concept Discoverycited by 91
  21. 2023Grounding Everything: Emerging Localization Properties in Vision-Language Transformerscited by 89
  22. 2022B-cos Networks: Alignment is All We Need for Interpretabilitycited by 88
  23. 2022MaskTune: Mitigating Spurious Correlations by Forcing to Explorecited by 66
  24. 2023Text-To-Concept (and Back) via Cross-Model Alignmentcited by 63
  25. 2022Post hoc Explanations may be Ineffective for Detecting Unknown Spurious Correlationcited by 59
  26. 2021Convolutional Dynamic Alignment Networks for Interpretable Classificationscited by 54
  27. 2018Local Explanation Methods for Deep Neural Networks Lack Sensitivity to Parameter Valuescited by 40
  28. 2021Fast Axiomatic Attribution for Neural Networkscited by 35
  29. 2024LeGrad: An Explainability Method for Vision Transformers via Feature Formation Sensitivitycited by 32
  30. 2023B-cos Alignment for Inherently Interpretable CNNs and Vision Transformerscited by 31
  31. 2022On Guiding Visual Attention with Language Specificationcited by 30
  32. 2022Towards Better Understanding Attribution Methodscited by 28
  33. 2022RES: A Robust Framework for Guiding Visual Explanationcited by 22
  34. 2021Consistent Explanations by Contrastive Learningcited by 18
  35. 2023Studying How to Efficiently and Effectively Guide Models with Explanationscited by 16
  36. 2024Good Teachers Explain: Explanation-Enhanced Knowledge Distillationcited by 14

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 9; 2026: 3.

12 papers.