Interpretable Explanations of Black Boxes by Meaningful Perturbation
Ruth Fong, Andrea Vedaldi
TL;DR
<3-5 sentence high-level summary>Addresses the need for interpretable explanations of black-box predictors by proposing explanations as meta-predictors that can be learned from data. The paper develops a model-agnostic, perturbation-based framework that treats explanations as programs predicting f's responses and evaluates faithfulness through prediction error. It specializes the framework to a saliency paradigm based on meaningful image perturbations, including deletion and preservation games solved via iterated gradients with artifact-mitigation regularizers. Empirical results show interpretable, minimal deletions that localize decision-relevant regions, reveal non-obvious correlations, and offer adversarial-defense insights and localization capabilities.
Abstract
As machine learning algorithms are increasingly applied to high impact yet high risk tasks, such as medical diagnosis or autonomous driving, it is critical that researchers can explain how such algorithms arrived at their predictions. In recent years, a number of image saliency methods have been developed to summarize where highly complex neural networks "look" in an image for evidence for their predictions. However, these techniques are limited by their heuristic nature and architectural constraints. In this paper, we make two main contributions: First, we propose a general framework for learning different kinds of explanations for any black box algorithm. Second, we specialise the framework to find the part of an image most responsible for a classifier decision. Unlike previous works, our method is model-agnostic and testable because it is grounded in explicit and interpretable image perturbations.
