arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1908.04494cs.LGstat.ML

Regional Tree Regularization for Interpretability in Black Box Models

Stanford University(斯坦福大学);University of Basel(巴塞尔大学);Harvard University SEAS(哈佛大学工程与应用科学学院);Tufts University(塔夫茨大学);Massachusetts Institute of Technology(麻省理工学院);University of Siena(锡耶纳大学)

Mike Wu, Sonali Parbhoo, Michael Hughes, Ryan Kindle, Leo Celi, Maurizio Zazzi, Volker Roth, Finale Doshi-Velez

英文摘要:

The lack of interpretability remains a barrier to the adoption of deep neural networks. Recently, tree regularization has been proposed to encourage deep neural networks to resemble compact, axis-aligned decision trees without significant compromises in accuracy. However, it may be unreasonable to expect that a single tree can predict well across all possible inputs. In this work, we propose regional tree regularization, which encourages a deep model to be well-approximated by several separate decision trees specific to predefined regions of the input space. Practitioners can define regions based on domain knowledge of contexts where different decision-making logic is needed. Across many datasets, our approach delivers more accurate predictions than simply training separate decision trees for each region, while producing simpler explanations than other neural net regularization schemes without sacrificing predictive power. Two healthcare case studies in critical care and HIV demonstrate how experts can improve understanding of deep models via our approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑