Probabilistic Explanations for Linear Models
Bernardo Subercaseaux, Marcelo Arenas, Kuldeep S Meel

TL;DR
This paper introduces a probabilistic explanation method for linear models that provides mathematically guaranteed, efficient explanations for model decisions, addressing the computational challenges of existing approaches.
Contribution
It proposes a new relaxation called (δ, ε)-SR, enabling efficient computation of probabilistic explanations for linear models, overcoming previous intractability issues.
Findings
Efficient computation of (δ, ε)-SR explanations for linear models.
Theoretical hardness results for small δ-sufficient reasons.
Introduction of a practical relaxation for probabilistic explanations.
Abstract
Formal XAI is an emerging field that focuses on providing explanations with mathematical guarantees for the decisions made by machine learning models. A significant amount of work in this area is centered on the computation of "sufficient reasons". Given a model and an input instance , a sufficient reason for the decision is a subset of the features of such that for any instance that has the same values as for every feature in , it holds that . Intuitively, this means that the features in are sufficient to fully justify the classification of by . For sufficient reasons to be useful in practice, they should be as small as possible, and a natural way to reduce the size of sufficient reasons is to consider a probabilistic relaxation; the probability of must be…
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.
Videos
Taxonomy
TopicsBayesian Modeling and Causal Inference · Simulation Techniques and Applications
