Model Agnostic Supervised Local Explanations
arXiv:1807.02910
Abstract
Model interpretability is an increasingly important component of practical machine learning. Some of the most common forms of interpretability systems are example-based, local, and global explanations. One of the main challenges in interpretability is designing explanation systems that can capture aspects of each of these explanation types, in order to develop a more thorough understanding of the model. We address this challenge in a novel model called MAPLE that uses local linear modeling techniques along with a dual interpretation of random forests (both as a supervised neighborhood approach and as a feature selection method). MAPLE has two fundamental advantages over existing interpretability systems. First, while it is effective as a black-box explanation system, MAPLE itself is a highly accurate predictive model that provides faithful self explanations, and thus sidesteps the typical accuracy-interpretability trade-off. Specifically, we demonstrate, on several UCI datasets, that MAPLE is at least as accurate as random forests and that it produces more faithful local explanations than LIME, a popular interpretability system. Second, MAPLE provides both example-based and local explanations and can detect global patterns, which allows it to diagnose limitations in its local explanations.
Cited by in corpus (40)
- A Survey on the Explainability of Supervised Machine Learning
- Explainable AI for Trees: From Local Explanations to Global Understanding
- How can I choose an explainer? An Application-grounded Evaluation of Post-hoc Explanations
- Explainable Machine Learning for Public Policy: Use Cases, Gaps, and Research Directions
- Counterfactual Shapley Additive Explanations
- On the (In)fidelity and Sensitivity for Explanations
- Fairness via Explanation Quality: Evaluating Disparities in the Quality of Post hoc Explanations
- Regularizing Black-box Models for Improved Interpretability
- Can I Trust the Explainer? Verifying Post-hoc Explanatory Methods
- A Survey on Neural Network Interpretability
- BayLIME: Bayesian Local Interpretable Model-Agnostic Explanations
- ShapG: new feature importance method based on the Shapley value
- Reliable Post hoc Explanations: Modeling Uncertainty in Explainability
- Explaining Deep Neural Networks
- Model Agnostic Multilevel Explanations
- Explainable automatic industrial carbon footprint estimation from bank transaction classification using natural language processing
- Calibrated Explanations: with Uncertainty Information and Counterfactuals
- Adversarial Infidelity Learning for Model Interpretation
- Synthetic Benchmarks for Scientific Research in Explainable Machine Learning
- Evaluations and Methods for Explanation through Robustness Analysis
- Causal Interpretability for Machine Learning -- Problems, Methods and Evaluation
- Why model why? Assessing the strengths and limitations of LIME
- Interpretable Machine Learning: Moving From Mythos to Diagnostics
- Generating Hierarchical Explanations on Text Classification via Feature Interaction Detection
- Towards Interpretable Polyphonic Transcription with Invertible Neural Networks
- Explaining Predictions by Approximating the Local Decision Boundary
- LCS-DIVE: An Automated Rule-based Machine Learning Visualization Pipeline for Characterizing Complex Associations in Classification
- A Review of Explainable Artificial Intelligence in Manufacturing
- Instance-Based Learning of Span Representations: A Case Study through Named Entity Recognition
- Explaining Groups of Points in Low-Dimensional Representations
- A Learning Theoretic Perspective on Local Explainability
- Regularizing Black-box Models for Improved Interpretability (HILL 2019 Version)
- TREX: Tree-Ensemble Representer-Point Explanations
- Why Attentions May Not Be Interpretable?
- Forest Guided Smoothing
- Marginal Contribution Feature Importance -- an Axiomatic Approach for The Natural Case
- Information-theoretic Evolution of Model Agnostic Global Explanations
- XPROAX-Local explanations for text classification with progressive neighborhood approximation
- A Sparsity Algorithm with Applications to Corporate Credit Rating
- Instance-Based Neural Dependency Parsing