Explanations for Neural Networks by Neural Networks
Open Access
- 18 January 2022
- journal article
- research article
- Published by MDPI AG in Applied Sciences
- Vol. 12 (3) , 980
Abstract
Understanding the function learned by a neural network is crucial in many domains, e.g., to detect a model’s adaption to concept drift in online learning. Existing global surrogate model approaches generate explanations by maximizing the fidelity between the neural network and a surrogate model on a sample-basis, which can be very time-consuming. Therefore, these approaches are not applicable in scenarios where timely or frequent explanations are required. In this paper, we introduce a real-time approach for generating a symbolic representation of the function learned by a neural network. Our idea is to generate explanations via another neural network (called the Interpretation Network, or -Net), which maps network parameters to a symbolic representation of the network function. We show that the training of an -Net for a family of functions can be performed up-front and subsequent generation of an explanation only requires querying the -Net once, which is computationally very efficient and does not require training data. We empirically evaluate our approach for the case of low-order polynomials as explanations, and show that it achieves competitive results for various data and function complexities. To the best of our knowledge, this is the first approach that attempts to learn mapping from neural networks to symbolic representations.
Keywords
This publication has 15 references indexed in Scilit:
- Causal Interpretations of Black-Box ModelsJournal of Business & Economic Statistics, 2019
- Interpreting CNNs via Decision Trees2019
- Improving the Interpretability of Deep Neural Networks with Knowledge Distillation2018
- A Survey of Methods for Explaining Black Box ModelsACM Computing Surveys, 2018
- Where are we now?2018
- "Why Should I Trust You?"2016
- Symbolic regression of generative network modelsScientific Reports, 2014
- Meijer G-Functions: A Gentle IntroductionNotices of the American Mathematical Society, 2013
- Predictive learning via rule ensemblesThe Annals of Applied Statistics, 2008
- Greedy function approximation: A gradient boosting machine.The Annals of Statistics, 2001