paper-with-me

Papers

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

2024-11-01 · Shreyash Arya, Sukrut Rao, Moritz Böhle, Bernt Schiele

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.

📄 PDF Abstract BibTeX arXiv:2411.00715

Code (1)

shrebox/b-cosification 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

CLIP Contrastive Language-Image Pre-training (CLIP), consisting of a simplified version of ConVIRT trained from scratch, is an efficient method of image representation learning…

Similar Papers 제목 키워드 기반

Word Equations: Inherently Interpretable Sparse Word Embeddingsthrough Sparse Coding

2020-04-08 · Adly Templeton

Word embeddings are a powerful natural language processing technique, but they are extremely difficult to interpret. To enable interpretable NLP models, we create vectors where each dimension is inherently interpretable.…

Word Embeddings

Word Equations: Inherently Interpretable Sparse Word Embeddings through Sparse Coding

2021-11-01 · EMNLP (BlackboxNLP) 2021 11 · Adly Templeton

Word embeddings are a powerful natural language processing technique, but they are extremely difficult to interpret. To enable interpretable NLP models, we create vectors where each dimension is inherently interpretable.…

Word Embeddings

Right for the Wrong Reason: Can Interpretable ML Techniques Detect Spurious Correlations?

2023-07-23 · Susu Sun, Lisa M. Koch, Christian F. Baumgartner

While deep neural network models offer unmatched classification performance, they are prone to learning spurious correlations in the data. Such dependencies on confounding information can be difficult to detect using per…

Towards Robust Interpretable Surrogates for Optimization

2024-12-02 · Marc Goerigk, Michael Hartisch, Sebastian Merten

An important factor in the practical implementation of optimization models is the acceptance by the intended users. This is influenced among other factors by the interpretability of the solution process. Decision rules t…

Towards Fully Interpretable Deep Neural Networks: Are We There Yet?

2021-06-24 · Sandareka Wickramanayake, Wynne Hsu, Mong Li Lee

Despite the remarkable performance, Deep Neural Networks (DNNs) behave as black-boxes hindering user trust in Artificial Intelligence (AI) systems. Research on opening black-box DNN can be broadly categorized into post-h…