Unified Shapley Framework to Explain Prediction Drift

• URL: http://arxiv.org/abs/2102.07862v1
• Date: Mon, 15 Feb 2021 21:58:19 GMT
• Title: Unified Shapley Framework to Explain Prediction Drift
• Authors: Aalok Shanbhag, Avijit Ghosh, Josh Rubin
• Abstract summary: We propose GroupShapley and GroupIG as axiomatically justified methods to tackle this problem. In doing so, we re-frame all current feature/data importance measures based on the Shapley value as essentially problems of distributional comparisons. We axiomatize certain desirable properties of distributional difference, and study the implications of choosing them.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Predictions are the currency of a machine learning model, and to understand the model's behavior over segments of a dataset, or over time, is an important problem in machine learning research and practice. There currently is no systematic framework to understand this drift in prediction distributions over time or between two semantically meaningful slices of data, in terms of the input features and points. We propose GroupShapley and GroupIG (Integrated Gradients), as axiomatically justified methods to tackle this problem. In doing so, we re-frame all current feature/data importance measures based on the Shapley value as essentially problems of distributional comparisons, and unify them under a common umbrella. We axiomatize certain desirable properties of distributional difference, and study the implications of choosing them empirically.

Related papers

• A Critical Assessment of Interpretable and Explainable Machine Learning for Intrusion Detection [0.0]
  We study the use of overly complex and opaque ML models, unaccounted data imbalances and correlated features, inconsistent influential features across different explanation methods, and the implausible utility of explanations. Specifically, we advise avoiding complex opaque models such as Deep Neural Networks and instead using interpretable ML models such as Decision Trees. We find that feature-based model explanations are most often inconsistent across different settings.
  arXiv  Detail & Related papers  (2024-07-04T15:35:42Z)
• Generating collective counterfactual explanations in score-based classification via mathematical optimization [4.281723404774889]
  A counterfactual explanation of an instance indicates how this instance should be minimally modified so that the perturbed instance is classified in the desired class. Most of the Counterfactual Analysis literature focuses on the single-instance single-counterfactual setting. By means of novel Mathematical Optimization models, we provide a counterfactual explanation for each instance in a group of interest.
  arXiv  Detail & Related papers  (2023-10-19T15:18:42Z)
• Grouping Shapley Value Feature Importances of Random Forests for explainable Yield Prediction [0.8543936047647136]
  We explain the concept of Shapley values directly computed for groups of features and introduce an algorithm to compute them efficiently on tree structures. We provide a blueprint for designing swarm plots that combine many local explanations for global understanding.
  arXiv  Detail & Related papers  (2023-04-14T13:03:33Z)
• An Additive Instance-Wise Approach to Multi-class Model Interpretation [53.87578024052922]
  Interpretable machine learning offers insights into what factors drive a certain prediction of a black-box system. Existing methods mainly focus on selecting explanatory input features, which follow either locally additive or instance-wise approaches. This work exploits the strengths of both methods and proposes a global framework for learning local explanations simultaneously for multiple target classes.
  arXiv  Detail & Related papers  (2022-07-07T06:50:27Z)
• TACTiS: Transformer-Attentional Copulas for Time Series [76.71406465526454]
  estimation of time-varying quantities is a fundamental component of decision making in fields such as healthcare and finance. We propose a versatile method that estimates joint distributions using an attention-based decoder. We show that our model produces state-of-the-art predictions on several real-world datasets.
  arXiv  Detail & Related papers  (2022-02-07T21:37:29Z)
• Partial Order in Chaos: Consensus on Feature Attributions in the Rashomon Set [50.67431815647126]
  Post-hoc global/local feature attribution methods are being progressively employed to understand machine learning models. We show that partial orders of local/global feature importance arise from this methodology. We show that every relation among features present in these partial orders also holds in the rankings provided by existing approaches.
  arXiv  Detail & Related papers  (2021-10-26T02:53:14Z)
• Shapley variable importance clouds for interpretable machine learning [2.830197032154301]
  We propose a Shapley variable importance cloud that pools information across good models to avoid biased assessments in SHAP analyses of final models. We demonstrate the additional insights gain compared to conventional explanations and Dong and Rudin's method using criminal justice and electronic medical records data.
  arXiv  Detail & Related papers  (2021-10-06T03:41:04Z)
• Test-time Collective Prediction [73.74982509510961]
  Multiple parties in machine learning want to jointly make predictions on future test points. Agents wish to benefit from the collective expertise of the full set of agents, but may not be willing to release their data or model parameters. We explore a decentralized mechanism to make collective predictions at test time, leveraging each agent's pre-trained model.
  arXiv  Detail & Related papers  (2021-06-22T18:29:58Z)
• Fundamental Limits and Tradeoffs in Invariant Representation Learning [99.2368462915979]
  Many machine learning applications involve learning representations that achieve two competing goals. Minimax game-theoretic formulation represents a fundamental tradeoff between accuracy and invariance. We provide an information-theoretic analysis of this general and important problem under both classification and regression settings.
  arXiv  Detail & Related papers  (2020-12-19T15:24:04Z)
• Deducing neighborhoods of classes from a fitted model [68.8204255655161]
  In this article a new kind of interpretable machine learning method is presented. It can help to understand the partitioning of the feature space into predicted classes in a classification model using quantile shifts. Basically, real data points (or specific points of interest) are used and the changes of the prediction after slightly raising or decreasing specific features are observed.
  arXiv  Detail & Related papers  (2020-09-11T16:35:53Z)
• Explaining predictive models with mixed features using Shapley values and conditional inference trees [1.8065361710947976]
  Shapley values stand out as a sound method to explain predictions from any type of machine learning model. We propose a method to explain mixed dependent features by modeling the dependence structure of the features using conditional inference trees.
  arXiv  Detail & Related papers  (2020-07-02T11:25:45Z)

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.