about
Measurable Counterfactual Local Explanations for Any Classifier (arxiv.org)
3 points by sel1 on Aug 9, 2019 | hide | past | pdf | discuss on HN

In plain words: A tool that explains a classifier's prediction by finding the smallest change that flips it, then fitting a local model and checking faithfulness by distance to the decision boundary. Four case studies found its explanations over 45% more faithful than a popular regression explainer's.

Abstract

We propose a novel method for explaining the predictions of any classifier. In our approach, local explanations are expected to explain both the outcome of a prediction and how that prediction would change if 'things had been different'. Furthermore, we argue that satisfactory explanations cannot be dissociated from a notion and measure of fidelity, as advocated in the early days of neural networks' knowledge extraction. We introduce a definition of fidelity to the underlying classifier for local explanation models which is based on distances to a target decision boundary. A system called CLEAR: Counterfactual Local Explanations via Regression, is introduced and evaluated. CLEAR generates w-counterfactual explanations that state minimum changes necessary to flip a prediction's classification. CLEAR then builds local regression models, using the w-counterfactuals to measure and improve the fidelity of its regressions. By contrast, the popular LIME method, which also uses regression to generate local explanations, neither measures its own fidelity nor generates counterfactuals. CLEAR's regressions are found to have significantly higher fidelity than LIME's, averaging over 45% higher in this paper's four case studies.

Adam White, Artur d'Avila Garcez
arXiv:1908.03020 · cs.AI, cs.LG · submitted Aug 8, 2019 · updated Nov 24, 2019
abstract · pdf · html

add comment on HN