TL;DR
This paper introduces an interpretable machine learning model that constructs domain-specific, understandable queries to make accurate predictions, using a generative model and MCMC for efficient query selection, outperforming post-hoc explanations.
Contribution
The authors propose a novel interpretable prediction framework that dynamically composes task-specific queries without assuming query independence, using a VAE and MCMC for optimal query selection.
Findings
Effective in vision and NLP tasks
Outperforms post-hoc explanation methods
Supports complex, task-dependent interpretability
Abstract
There is a growing concern about typically opaque decision-making with high-performance machine learning algorithms. Providing an explanation of the reasoning process in domain-specific terms can be crucial for adoption in risk-sensitive domains such as healthcare. We argue that machine learning algorithms should be interpretable by design and that the language in which these interpretations are expressed should be domain- and task-dependent. Consequently, we base our model's prediction on a family of user-defined and task-specific binary functions of the data, each having a clear interpretation to the end-user. We then minimize the expected number of queries needed for accurate prediction on any given input. As the solution is generally intractable, following prior work, we choose the queries sequentially based on information gain. However, in contrast to previous work, we need not…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsBalanced Selection
