Making CNNs Interpretable by Building Dynamic Sequential Decision Forests with Top-down Hierarchy Learning

• URL: http://arxiv.org/abs/2106.02824v1
• Date: Sat, 5 Jun 2021 07:41:18 GMT
• Title: Making CNNs Interpretable by Building Dynamic Sequential Decision Forests with Top-down Hierarchy Learning
• Authors: Yilin Wang, Shaozuo Yu, Xiaokang Yang, Wei Shen
• Abstract summary: We propose a generic model transfer scheme to make Convlutional Neural Networks (CNNs) interpretable. We achieve this by building a differentiable decision forest on top of CNNs. We name the transferred model deep Dynamic Sequential Decision Forest (dDSDF)
• Score: 62.82046926149371
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we propose a generic model transfer scheme to make Convlutional Neural Networks (CNNs) interpretable, while maintaining their high classification accuracy. We achieve this by building a differentiable decision forest on top of CNNs, which enjoys two characteristics: 1) During training, the tree hierarchies of the forest are learned in a top-down manner under the guidance from the category semantics embedded in the pre-trained CNN weights; 2) During inference, a single decision tree is dynamically selected from the forest for each input sample, enabling the transferred model to make sequential decisions corresponding to the attributes shared by semantically-similar categories, rather than directly performing flat classification. We name the transferred model deep Dynamic Sequential Decision Forest (dDSDF). Experimental results show that dDSDF not only achieves higher classification accuracy than its conuterpart, i.e., the original CNN, but has much better interpretability, as qualitatively it has plausible hierarchies and quantitatively it leads to more precise saliency maps.

Related papers

• Informed deep hierarchical classification: a non-standard analysis inspired approach [0.0]
  It consists in a multi-output deep neural network equipped with specific projection operators placed before each output layer. The design of such an architecture, called lexicographic hybrid deep neural network (LH-DNN), has been possible by combining tools from different and quite distant research fields. To assess the efficacy of the approach, the resulting network is compared against the B-CNN, a convolutional neural network tailored for hierarchical classification tasks.
  arXiv  Detail & Related papers  (2024-09-25T14:12:50Z)
• An Explainable Model-Agnostic Algorithm for CNN-based Biometrics Verification [55.28171619580959]
  This paper describes an adaptation of the Local Interpretable Model-Agnostic Explanations (LIME) AI method to operate under a biometric verification setting.
  arXiv  Detail & Related papers  (2023-07-25T11:51:14Z)
• Do We Really Need a Learnable Classifier at the End of Deep Neural Network? [118.18554882199676]
  We study the potential of learning a neural network for classification with the classifier randomly as an ETF and fixed during training. Our experimental results show that our method is able to achieve similar performances on image classification for balanced datasets.
  arXiv  Detail & Related papers  (2022-03-17T04:34:28Z)
• Meta Ordinal Regression Forest for Medical Image Classification with Ordinal Labels [37.121792169424744]
  We propose a novel meta ordinal regression forest (MORF) method for medical image classification with ordinal labels. MORF learns the ordinal relationship through the combination of convolutional neural network and differential forest in a meta-learning framework. Experimental results on two medical image classification datasets with ordinal labels demonstrate the superior performances of our MORF method over existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-03-15T08:43:57Z)
• Deep Neural Decision Forest for Acoustic Scene Classification [45.886356124352226]
  Acoustic scene classification (ASC) aims to classify an audio clip based on the characteristic of the recording environment. We propose a novel approach for ASC using deep neural decision forest (DNDF)
  arXiv  Detail & Related papers  (2022-03-07T14:39:42Z)
• An evidential classifier based on Dempster-Shafer theory and deep learning [6.230751621285322]
  We propose a new classification system based on Dempster-Shafer (DS) theory and a convolutional neural network (CNN) architecture for set-valued classification. Experiments on image recognition, signal processing, and semantic-relationship classification tasks demonstrate that the proposed combination of deep CNN, DS layer, and expected utility layer makes it possible to improve classification accuracy.
  arXiv  Detail & Related papers  (2021-03-25T01:29:05Z)
• Growing Deep Forests Efficiently with Soft Routing and Learned Connectivity [79.83903179393164]
  This paper further extends the deep forest idea in several important aspects. We employ a probabilistic tree whose nodes make probabilistic routing decisions, a.k.a., soft routing, rather than hard binary decisions. Experiments on the MNIST dataset demonstrate that our empowered deep forests can achieve better or comparable performance than [1],[3].
  arXiv  Detail & Related papers  (2020-12-29T18:05:05Z)
• Succinct Explanations With Cascading Decision Trees [5.877164140116815]
  We propose a new decision tree model that we call Cascading Decision Trees. Our key insight is to separate the notion of a decision path and an explanation path. Applying cascading decision trees to new samples results in a significantly shorter and succinct explanation.
  arXiv  Detail & Related papers  (2020-10-13T18:48:39Z)
• Fine-Grained Visual Classification with Efficient End-to-end Localization [49.9887676289364]
  We present an efficient localization module that can be fused with a classification network in an end-to-end setup. We evaluate the new model on the three benchmark datasets CUB200-2011, Stanford Cars and FGVC-Aircraft.
  arXiv  Detail & Related papers  (2020-05-11T14:07:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.