Regional tree regularization for interpretability in deep neural networks

23Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

Abstract

The lack of interpretability remains a barrier to adopting deep neural networks across many safety-critical domains. Tree regularization was recently proposed to encourage a deep neural network’s decisions to resemble those of a globally compact, axis-aligned decision tree. However, it is often unreasonable to expect a single tree to predict well across all possible inputs. In practice, doing so could lead to neither interpretable nor performant optima. To address this issue, we propose regional tree regularization – a method that encourages a deep model to be well-approximated by several separate decision trees specific to predefined regions of the input space. Across many datasets, including two healthcare applications, we show our approach delivers simpler explanations than other regularization schemes without compromising accuracy. Specifically, our regional regularizer finds many more “desirable” optima compared to global analogues.

Cite

CITATION STYLE

APA

Wu, M., Parbhoo, S., Hughes, M. C., Kindle, R., Celi, L., Zazzi, M., … Doshi-Velez, F. (2020). Regional tree regularization for interpretability in deep neural networks. In AAAI 2020 - 34th AAAI Conference on Artificial Intelligence (pp. 6413–6421). AAAI press. https://doi.org/10.1609/aaai.v34i04.6112

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free