mlsanityData to 14 Oct 2026

DISCOVER: Making Vision Networks Interpretable via Competition and Dissection

arXiv 2310.04929 ↗First posted 7 Oct 2023cs.CV cs.LG stat.MLcited by 8

Not on the map. Why?

Abstract (arXiv)

Modern deep networks are highly complex and their inferential outcome very hard to interpret. This is a serious obstacle to their transparent deployment in safety-critical or bias-aware applications. This work contributes to post-hoc interpretability, and specifically Network Dissection. Our goal is to present a framework that makes it easier to discover the individual functionality of each neuron in a network trained on a vision task; discovery is performed in terms of textual description generation. To achieve this objective, we leverage: (i) recent advances in multimodal vision-text models and (ii) network layers founded upon the novel concept of stochastic local competition between linear units. In this setting, only a small subset of layer neurons are activated for a given input, leading to extremely high activation sparsity (as low as only ≈ 4%). Crucially, our proposed method infers (sparse) neuron activation patterns that enables the neurons to activate/specialize to inputs with specific characteristics, diversifying their individual functionality. This capacity of our method supercharges the potential of dissection processes: human understandable descriptions are generated only for the very few active neurons, thus facilitating the direct investigation of the network's decision process. As we experimentally show, our approach: (i) yields Vision Networks that retain or improve classification performance, and (ii) realizes a principled framework for text-based description and examination of the generated neuronal representations.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 23 of its 33 references that are in the map. First posted on arXiv 7 Oct 2023.

Builds on

23 of 33 references.

References · 23

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  3. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  4. 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
  5. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,070
  6. 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
  7. 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
  8. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
  9. 2020Concept Bottleneck Modelscited by 1,032
  10. 2022Mass-Editing Memory in a Transformercited by 1,001
  11. 2017Network Dissection: Quantifying Interpretability of Deep Visual Representationscited by 708
  12. 2021Knowledge Neurons in Pretrained Transformerscited by 601
11 more
  1. 2023Label-Free Concept Bottleneck Modelscited by 285
  2. 2022CLIP-Dissect: Automatic Description of Neuron Representations in Deep Vision Networkscited by 147
  3. 2022Natural Language Descriptions of Deep Visual Featurescited by 137
  4. 2021Stochastic Transformer Networks with Linear Competing Units: Application to end-to-end SL Translationcited by 35
  5. 2023Sparse Linear Concept Discovery Modelscited by 22
  6. 2018Nonparametric Bayesian Deep Networks with Local Competitioncited by 17
  7. 2020Contextual Semantic Interpretabilitycited by 14
  8. 2021Local Competition and Stochasticity for Adversarial Robustness in Deep Learningcited by 12
  9. 2021Stochastic Local Winner-Takes-All Networks Enable Profound Adversarial Robustnesscited by 11
  10. 2022Stochastic Deep Networks with Linear Competing Units for Model-Agnostic Meta-Learningcited by 7
  11. 2022Competing Mutual Information Constraints with Stochastic Competition-based Activations for Learning Diversified Representationscited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 3; 2025: 4; 2026: 1.

8 papers.