mlsanityData to 14 Oct 2026

Learning local discrete features in explainable-by-design convolutional neural networks

arXiv 2411.00139 ↗First posted 31 Oct 2024cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Our proposed framework attempts to break the trade-off between performance and explainability by introducing an explainable-by-design convolutional neural network (CNN) based on the lateral inhibition mechanism. The ExplaiNet model consists of the predictor, that is a high-accuracy CNN with residual or dense skip connections, and the explainer probabilistic graph that expresses the spatial interactions of the network neurons. The value on each graph node is a local discrete feature (LDF) vector, a patch descriptor that represents the indices of antagonistic neurons ordered by the strength of their activations, which are learned with gradient descent. Using LDFs as sequences we can increase the conciseness of explanations by repurposing EXTREME, an EM-based sequence motif discovery method that is typically used in molecular biology. Having a discrete feature motif matrix for each one of intermediate image representations, instead of a continuous activation tensor, allows us to leverage the inherent explainability of Bayesian networks. By collecting observations and directly calculating probabilities, we can explain causal relationships between motifs of adjacent levels and attribute the model's output to global motifs. Moreover, experiments on various tiny image benchmark datasets confirm that our predictor ensures the same level of performance as the baseline architecture for a given count of parameters and/or layers. Our novel method shows promise to exceed this performance while providing an additional stream of explanations. In the solved MNIST classification task, it reaches a comparable to the state-of-the-art performance for single models, using standard training setup and 0.75 million parameters.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 40 of its 69 references that are in the map. First posted on arXiv 31 Oct 2024.

Builds on

40 of 69 references.

References · 40

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2016Densely Connected Convolutional Networkscited by 6,720
  3. 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
  4. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  5. 2017Axiomatic Attribution for Deep Networkscited by 3,384
  6. 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
  7. 2017Learning Important Features Through Propagating Activation Differencescited by 1,458
  8. 2017SmoothGrad: removing noise by adding noisecited by 1,109
  9. 2021Transformers in Vision: A Surveycited by 1,013
  10. 2018Explaining Explanations: An Overview of Interpretability of Machine Learningcited by 508
  11. 2018Towards Robust Interpretability with Self-Explaining Neural Networkscited by 505
  12. 2018Deep Learning for Classical Japanese Literaturecited by 422
28 more
  1. 2021A Survey of Transformerscited by 401
  2. 2020Neural Additive Models: Interpretable Machine Learning with Neural Netscited by 319
  3. 2022Estimating the Carbon Footprint of BLOOM, a 176B Parameter Language Modelcited by 265
  4. 2019On Completeness-aware Concept-Based Explanations in Deep Neural Networkscited by 239
  5. 2017Distilling a Neural Network Into a Soft Decision Treecited by 236
  6. 2017Deep Learning for Case-Based Reasoning through Prototypes: A Neural Network that Explains Its Predictionscited by 234
  7. 2016Model-Agnostic Interpretability of Machine Learningcited by 219
  8. 2020Neural Prototype Trees for Interpretable Fine-grained Image Recognitioncited by 214
  9. 2018Deep k-Nearest Neighbors: Towards Confident, Interpretable and Robust Deep Learningcited by 207
  10. 2021Trustworthy AI: From Principles to Practicescited by 207
  11. 2016Grad-CAM: Why did you say that?cited by 161
  12. 2017On the Properties of the Softmax Function with Application in Game Theory and Reinforcement Learningcited by 142
  13. 2015Interpretable classifiers using rules and Bayesian analysis: Building a better stroke prediction modelcited by 140
  14. 2022Algorithms to estimate Shapley value feature attributionscited by 115
  15. 2021XProtoNet: Diagnosis in Chest Radiography with Global and Local Explanationscited by 73
  16. 2019Interpretable Image Recognition with Hierarchical Prototypescited by 65
  17. 2021Learning to Synthesize Programs as Interpretable and Generalizable Policiescited by 59
  18. 2021Convolutional Dynamic Alignment Networks for Interpretable Classificationscited by 54
  19. 2023Robust Counterfactual Explanations for Neural Networks With Probabilistic Guaranteescited by 45
  20. 2021Fast Axiomatic Attribution for Neural Networkscited by 35
  21. 2020One Explanation is Not Enough: Structured Attention Graphs for Image Classificationcited by 32
  22. 2021Explaining Latent Representations with a Corpus of Examplescited by 30
  23. 2020A Framework to Learn with Interpretationcited by 23
  24. 2021Fine-Grained Neural Network Explanation by Identifying Input Features with Predictive Informationcited by 17
  25. 2022Learning Interpretable Decision Rule Sets: A Submodular Optimization Approachcited by 13
  26. 2023Achieving Diversity in Counterfactual Explanations: a Review and Discussioncited by 11
  27. 2023Revisiting the Performance-Explainability Trade-Off in Explainable Artificial Intelligence (XAI)cited by 10
  28. 2022Backpropagation Neural Treecited by 3

Built on by

Not cited yet.