$PredDiff$: Explanations and Interactions from Conditional Expectations
- URL: http://arxiv.org/abs/2102.13519v1
- Date: Fri, 26 Feb 2021 14:46:47 GMT
- Title: $PredDiff$: Explanations and Interactions from Conditional Expectations
- Authors: Stefan Bl\"ucher and Nils Strodthoff
- Abstract summary: $PredDiff$ is a model-agnostic, local attribution method rooted in probability theory.
In this work, we clarify properties of $PredDiff$ and put forward several extensions of the original formalism.
- Score: 0.3655021726150368
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: $PredDiff$ is a model-agnostic, local attribution method that is firmly
rooted in probability theory. Its simple intuition is to measure prediction
changes when marginalizing out feature variables. In this work, we clarify
properties of $PredDiff$ and put forward several extensions of the original
formalism. Most notably, we introduce a new measure for interaction effects.
Interactions are an inevitable step towards a comprehensive understanding of
black-box models. Importantly, our framework readily allows to investigate
interactions between arbitrary feature subsets and scales linearly with their
number. We demonstrate the soundness of $PredDiff$ relevances and interactions
both in the classification and regression setting. To this end, we use
different analytic, synthetic and real-world datasets.
Related papers
- Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit
Feedback and Unknown Transition [71.33787410075577]
We study reinforcement learning with linear function approximation, unknown transition, and adversarial losses.
We propose a new algorithm that attains an $widetildeO(dsqrtHS3K + sqrtHSAK)$ regret with high probability.
arXiv Detail & Related papers (2024-03-07T15:03:50Z) - Succinct Interaction-Aware Explanations [33.25637826682827]
SHAP is a popular approach to explain black-box models by revealing the importance of individual features.
NSHAP, on the other hand, reports the additive importance for all subsets of features.
We propose to combine the best of these two worlds, by partitioning the features into parts that significantly interact.
arXiv Detail & Related papers (2024-02-08T11:04:11Z) - Online non-parametric likelihood-ratio estimation by Pearson-divergence
functional minimization [55.98760097296213]
We introduce a new framework for online non-parametric LRE (OLRE) for the setting where pairs of iid observations $(x_t sim p, x'_t sim q)$ are observed over time.
We provide theoretical guarantees for the performance of the OLRE method along with empirical validation in synthetic experiments.
arXiv Detail & Related papers (2023-11-03T13:20:11Z) - FABind: Fast and Accurate Protein-Ligand Binding [127.7790493202716]
$mathbfFABind$ is an end-to-end model that combines pocket prediction and docking to achieve accurate and fast protein-ligand binding.
Our proposed model demonstrates strong advantages in terms of effectiveness and efficiency compared to existing methods.
arXiv Detail & Related papers (2023-10-10T16:39:47Z) - On the Joint Interaction of Models, Data, and Features [82.60073661644435]
We introduce a new tool, the interaction tensor, for empirically analyzing the interaction between data and model through features.
Based on these observations, we propose a conceptual framework for feature learning.
Under this framework, the expected accuracy for a single hypothesis and agreement for a pair of hypotheses can both be derived in closed-form.
arXiv Detail & Related papers (2023-06-07T21:35:26Z) - Robust Counterfactual Explanations for Neural Networks With Probabilistic Guarantees [11.841312820944774]
We propose a measure -- that we call $textitStability$ -- to quantify the robustness of counterfactuals to potential model changes for differentiable models.
Our main contribution is to show that counterfactuals with sufficiently high value of $textitStability$ will remain valid after potential model changes with high probability.
arXiv Detail & Related papers (2023-05-19T20:48:05Z) - Exploring the cloud of feature interaction scores in a Rashomon set [17.775145325515993]
We introduce the feature interaction score (FIS) in the context of a Rashomon set.
We demonstrate the properties of the FIS via synthetic data and draw connections to other areas of statistics.
Our results suggest that the proposed FIS can provide valuable insights into the nature of feature interactions in machine learning models.
arXiv Detail & Related papers (2023-05-17T13:05:26Z) - You Mostly Walk Alone: Analyzing Feature Attribution in Trajectory
Prediction [52.442129609979794]
Recent deep learning approaches for trajectory prediction show promising performance.
It remains unclear which features such black-box models actually learn to use for making predictions.
This paper proposes a procedure that quantifies the contributions of different cues to model performance.
arXiv Detail & Related papers (2021-10-11T14:24:15Z) - Counterfactual Invariance to Spurious Correlations: Why and How to Pass
Stress Tests [87.60900567941428]
A spurious correlation' is the dependence of a model on some aspect of the input data that an analyst thinks shouldn't matter.
In machine learning, these have a know-it-when-you-see-it character.
We study stress testing using the tools of causal inference.
arXiv Detail & Related papers (2021-05-31T14:39:38Z) - A Self-Penalizing Objective Function for Scalable Interaction Detection [2.208242292882514]
We tackle the problem of nonparametric variable selection with a computation on discovering interactions between variables.
The trick is to maximize parametrized nonparametric dependence measures which we call metric learning objectives.
arXiv Detail & Related papers (2020-11-24T17:07:49Z) - Deep Learning for Individual Heterogeneity: An Automatic Inference
Framework [2.6813717321945107]
We develop methodology for estimation and inference using machine learning to enrich economic models.
We show how to design the network architecture to match the structure of the economic model.
We obtain inference based on a novel influence function calculation.
arXiv Detail & Related papers (2020-10-28T01:41:47Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.