pith. sign in

arxiv: 1807.00130 · v1 · pith:XRGWGD7Vnew · submitted 2018-06-30 · 💻 cs.LG · stat.ML

Game-Theoretic Interpretability for Temporal Modeling

classification 💻 cs.LG stat.ML
keywords predictortemporalmodelsco-operativeexplainerfamilygameinterpretability
0
0 comments X
read the original abstract

Interpretability has arisen as a key desideratum of machine learning models alongside performance. Approaches so far have been primarily concerned with fixed dimensional inputs emphasizing feature relevance or selection. In contrast, we focus on temporal modeling and the problem of tailoring the predictor, functionally, towards an interpretable family. To this end, we propose a co-operative game between the predictor and an explainer without any a priori restrictions on the functional class of the predictor. The goal of the explainer is to highlight, locally, how well the predictor conforms to the chosen interpretable family of temporal models. Our co-operative game is setup asymmetrically in terms of information sets for efficiency reasons. We develop and illustrate the framework in the context of temporal sequence models with examples.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.