publication . Preprint . 2018

Gaining Free or Low-Cost Transparency with Interpretable Partial Substitute

Wang, Tong;
Open Access English
  • Published: 12 Feb 2018
Abstract
This work addresses the situation where a black-box model with good predictive performance is chosen over its interpretable competitors, and we show interpretability is still achievable in this case. Our solution is to find an interpretable substitute on a subset of data where the black-box model is overkill or nearly overkill while leaving the rest to the black-box. This transparency is obtained at minimal cost or no cost of the predictive performance. Under this framework, we develop a Hybrid Rule Sets (HyRS) model that uses decision rules to capture the subspace of data where the rules are as accurate or almost as accurate as the black-box provided. To train ...
Subjects
free text keywords: Computer Science - Machine Learning, Statistics - Machine Learning
Download from
37 references, page 1 of 3

[1] A. Aamodt and E. Plaza. Case-based reasoning: Foundational issues, methodological variations, and system approaches. AI comm, 7(1):39-59, 1994.

[2] P. Adler, C. Falk, S. A. Friedler, G. Rybeck, C. Scheidegger, B. Smith, and S. Venkatasubramanian. Auditing black-box models for indirect inƒuence. In ICDM, pages 1-10. IEEE, 2016.

[3] E. Angelino, N. Larus-Stone, D. Alabi, M. Seltzer, and C. Rudin. Learning certi€- ably optimal rule lists. In SIGKDD, pages 35-44. ACM, 2017. [OpenAIRE]

[4] I. Bichindaritz and C. Marling. Case-based reasoning in the health sciences: What's next? Arti€cial intelligence in medicine, 36(2):127-135, 2006. [OpenAIRE]

[5] T. Chen and C. Guestrin. Xgboost: A scalable tree boosting system. In SIGKDD, pages 785-794. ACM, 2016.

[6] F. Doshi-Velez and B. Kim. A roadmap for a rigorous science of interpretability. arXiv preprint arXiv:1702.08608, 2017.

[7] Y. Freund and R. E. Schapire. A desicion-theoretic generalization of on-line learning and an application to boosting. In European conference on computational learning theory, pages 23-37. Springer, 1995. [OpenAIRE]

[8] A. d. Garcez, T. R. Besold, L. De Raedt, P. Fo¨ldiak, P. Hitzler, T. Icard, K.-U. Ku¨hnberger, L. C. Lamb, R. Miikkulainen, and D. L. Silver. Neural-symbolic learning and reasoning: contributions and challenges. In Proceedings of the AAAI Spring Symposium on Knowledge Representation and Reasoning: Integrating Symbolic and Neural Approaches, Stanford, 2015. [OpenAIRE]

[9] A. S. d. Garcez, K. B. Broda, and D. M. Gabbay. Neural-symbolic learning systems: foundations and applications. Springer Science & Business Media, 2012.

[10] K. Hornik, A. Zeileis, T. Hothorn, and C. Buchta. Rweka: an r interface to weka. R package version, pages 03-4, 2007.

[11] Z. Hu, X. Ma, Z. Liu, E. Hovy, and E. Xing. Harnessing deep neural networks with logic rules. arXiv preprint arXiv:1603.06318, 2016.

[12] Z. Hua and B. Zhang. A hybrid support vector machines and logistic regression approach for forecasting intermiŠent demand of spare parts. Applied Mathematics and Computation, 181(2):1035-1048, 2006.

[13] B. Kim, C. Rudin, and J. Shah. Bayesian case model: A generative approach for case-based reasoning and prototype classi€cation. In NIPS, 2014.

[14] H. C. Koh, W. C. Tan, and C. P. Goh. A two-step method to construct credit scoring models with data mining techniques. International Journal of Business and Information, 1(1), 2015.

[15] R. Kohavi. Scaling up the accuracy of naive-bayes classi€ers: A decision-tree hybrid. In KDD, volume 96, pages 202-207, 1996.

37 references, page 1 of 3
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue