Beyond Sparsity: Tree Regularization of Deep Models for Interpretability

Mike Wu, Michael C. Hughes, Sonali Parbhoo, Maurizio Zazzi, Volker Roth +1 more
11/16/2017
stat.MLcs.LG

Official code: dtak/tree-regularization-public (80 stars, MIT, last commit 2018-01-04).

Abstract

The lack of interpretability remains a key barrier to the adoption of deep models in many applications. In this work, we explicitly regularize deep models so human users might step through the process behind their predictions in little time. Specifically, we train deep time-series models so their class-probability predictions have high accuracy while being closely modeled by decision trees with few nodes. Using intuitive toy examples as well as medical tasks for treating sepsis and HIV, we demonstrate that this new tree regularization yields models that are easier for humans to simulate than simpler L1 or L2 penalties without sacrificing predictive power.

View on arXivView PDF

Code Implementations(1)

MIT

Code for AAAI 2018 accepted paper: "Beyond Sparsity: Tree Regularization of Deep Models for Interpretability"

8021PythonNov 15, 20178 years agoMIT

Cite this paper

@article{wu2017beyond,
  title  = {Beyond Sparsity: Tree Regularization of Deep Models for Interpretability},
  author = {Mike Wu and Michael C. Hughes and Sonali Parbhoo and Maurizio Zazzi and Volker Roth and Finale Doshi-Velez},
  year   = {2017},
  eprint = {1711.06178},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1711.06178}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1711.06178.svg)](https://codeofpaper.com/paper/1711.06178)

Discussion