Unified framework for feature-based explanations using ANOVA and game theory.
problem Differences between feature-based explanations methods limit their applicability.
method Introduces a unified framework combining fANOVA and cooperative game theory.
result Uncovered similarities and differences between various explanation techniques.
Unified game formulation for explaining machine learning models using Shapley values.
problem Uncertainty and misleading attributions in existing Shapley value methods.
method Unified game formulation that addresses uncertainty and provides confidence intervals.
result Unified framework for generating and interpreting contrastive explanations of ML models.
The paper adds explanation to predictive process monitoring.
problem Equipping predictive business process monitoring with explanation capabilities.
method Used game theory of Shapley Values to obtain robust explanations.
result First time explanations given in predictive business process monitoring.
Shapley values for feature importance lead to mathematical and practical issues.
problem Mathematical and practical issues with Shapley values for feature importance.
method Game-theoretic formulations of feature importance using Shapley values.
result Mathematical problems arise when using Shapley values for feature importance.
Pref-SHAP explains preferences using Shapley values.
problem Challenging problem of preference explanation in machine learning.
method Shapley value-based model explanation framework for pairwise comparison data.
result Richer and more insightful explanations obtained over baseline.
Unified framework for explaining models by removing features.
problem Unclear relationships and preferences among existing model explanation methods.
method Removal-based explanations characterized by three dimensions.
result Unified framework unifies 26 existing methods.
This paper introduces a method to find complete and interpretable concept-based explanations for deep neural networks.
problem Lack of complete and interpretable concept-based explanations in deep neural networks.
method Definition of completeness, concept discovery method, and importance score calculation using game-theoretic notions.
result The proposed method finds complete and interpretable concept-based explanations for deep neural networks.
A new framework quantifies how model explanations influence each other.
problem Understanding how different model explanations interact and influence each other.
method Introducing the metagame, a conceptual framework for measuring second-order interaction effects of model explanations using Shapley values.
result Meta-attributions provide directional insights into how feature interactions influence model explanations.
Paper uses Shapley values to explain how clusters of training data affect predictions.
problem Explaining how training data clusters impact predictions from black-box models.
method Extends Shapley values to cluster importance, using coalitional game theory.
result Shows how different clusters of training data contribute to model predictions.
We introduce a new method to explain Gaussian processes using Shapley values.
problem Explaining the uncertainty in Gaussian process models.
method Extending Shapley values to stochastic cooperative games for Gaussian processes.
result Our method generates explanations that are random variables and satisfy favorable axioms.
Prevalent theories in cognitive science propose that humans understand and represent the knowledge of the world through causal relationships. In making sense of the world, we build causal models in our mind to encode cause-effect relations of events and use these to explain why new events happen. In this paper, we use …
A new method for variable importance measures without impossible data.
problem Using impossible data for variable importance measures in black box models.
method Cohort Shapley, a method grounded in economic game theory using only observed data.
result Cohort Shapley provides a more trustworthy explanation of black box models' decisions.
We present a modification of the so-called Parrondo's paradox where one is allowed to choose in each turn the game that a large number of individuals play. It turns out that, by choosing the game which gives the highest average earnings at each step, one ends up with systematic loses, whereas a periodic or random seque…
Strategic behaviour is one of the main explanations for cost overruns. It can theoretically be supported by agency theory, in which strategic behaviour is the result of asymmetric information between the principal and agent. This paper gives a formal account of this relation by a signalling game. This is a game with in…
Study shows trust and trustworthiness emerge through reinforcement learning.
problem Trust and trustworthiness are universal but not predicted by traditional economic models.
method Used Q-learning algorithm to simulate trust and trustworthiness dynamics in a trust game.
result High levels of trust and trustworthiness emerge when individuals consider both past and future experiences.
The paper develops statistical inference methods for SHAP values.
problem Lack of statistical inference for SHAP values in model-agnostic feature importance.
method Semi-parametric approach using U-statistics and Neyman orthogonal scores for functionals of nested regressions.
result Asymptotically normal estimates of the pth powers of SHAP values for various p.
MBExplainer provides explanations for models combining graph embeddings and tabular features.
problem Explaining models using a mix of graph embeddings and tabular features.
method Model-agnostic approach using Shapley values and Monte Carlo Tree Search.
result MBExplainer efficiently finds human-readable explanations for model predictions.
This research integrates attention into XAI frameworks for better model explanations.
problem Improving the interpretability of transformer models.
method Developed two novel explanation methods: Shapley value decomposition and token-level directional derivatives.
result Attention weights can be meaningfully incorporated into XAI frameworks, enhancing transformer explainability.
This paper gives yet another definition of game-theoretic probability in the context of continuous-time idealized financial markets. Without making any probabilistic assumptions (but assuming positive and continuous price paths), we obtain a simple expression for the equity premium and derive a version of the capital a…
Paper uses VAEAC to estimate Shapley values for complex models with mixed features.
problem Estimating Shapley values for models with dependent mixed features.
method Uses variational autoencoder with arbitrary conditioning (VAEAC) to model feature dependencies.
result VAEAC approach outperforms state-of-the-art methods for various settings.
The accumulation of individual fitness or wealth is modelled as a population game in which pairs of individuals are recurrently and randomly matched to play a game over a resource. In addition, all individuals have random access to a constant background resource, and their fitness or wealth depreciates over time. For b…
Generative deep learning creates counterfactual states to explain Atari agent decisions.
problem Difficulty in explaining deep reinforcement learning agent decisions to humans.
method Generative deep learning to create counterfactual states.
result Counterfactual states help non-expert participants understand Atari agent decision-making.
A method uses Shapley values and Mahalanobis distances to explain multivariate outliers.
problem Explaining multivariate outlyingness in data.
method Decomposing squared Mahalanobis distance using Shapley values.
result Shapley values provide variable contributions to outlying observations.
Improved KernelSHAP via linear regression for ML model interpretation.
problem Efficiently estimating Shapley values in model-agnostic settings.
method Revisiting KernelSHAP via linear regression, developing techniques for convergence and uncertainty.
result Original KernelSHAP incurs negligible bias for significant variance reduction.
Interpretable ML methods for better decision-making with explanations.
problem Lack of transparency in black-box ML models.
method Use of Formal Concept Analysis and cooperative game theory to assess attribute importance and reduce attribute count.
result Developed methods to assess attribute importance and reduce attribute count in ML models.
Tree-based machine learning models such as random forests, decision trees, and gradient boosted trees are the most popular non-linear predictive models used in practice today, yet comparatively little attention has been paid to explaining their predictions. Here we significantly improve the interpretability of tree-bas…
Unified feature importance for machine learning models tackles sufficiency and necessity limitations.
problem Insufficient and incomplete explanations of machine learning models.
method Formalized sufficiency and necessity notions, proposing a unified importance measure.
result Unified importance measure detects features missed by sufficiency and necessity alone.
Unified local and global explanations through functional decomposition of low dimensional structures.
problem Tackles the challenge of extracting meaningful local and global explanations from machine learning models.
method Proposes a new identification constraint to decompose the global representation into main and interaction components of arbitrary order.
result Unified local and global explanations by connecting partial dependence plots and interventional SHAP values.
GIG improves IG to explain diverse ML functions.
problem Explain diverse ML functions effectively.
method Generalized Integrated Gradients (GIG) method.
result GIG is the only correct method under reasonable axioms.
CausalGame benchmarks LLM agents' causal thinking in games.
problem Evaluating causal thinking in AI Scientists with LLMs.
method Interactive games with 14 scenarios incorporating selection bias, measurement error, and hidden confounders.
result None of the 30 LLM agents demonstrated reliable causal thinking, with the best model achieving only 68.0% survival.
Model cash management under ambiguity using maxmin preferences and diffusion.
problem Optimizing cash reserves in the presence of ambiguity.
method Singular control model with maxmin preferences, verified using Dynkin games.
result Higher expected costs and narrower inaction region under increased ambiguity.
Autonomous AI systems will be entering human society in the near future to provide services and work alongside humans. For those systems to be accepted and trusted, the users should be able to understand the reasoning process of the system, i.e. the system should be transparent. System transparency enables humans to fo…
We investigate the dynamics of a trust game on a mixed population where individuals with the role of buyers are forced to play against a predetermined number of sellers, whom they choose dynamically. Agents with the role of sellers are also allowed to adapt the level of value for money of their products, based on payof…
Stock correlations is crucial to asset pricing, investor decision-making, and financial risk regulations. However, microscopic explanation based on agent-based modeling is still lacking. We here propose a model derived from minority game for modeling stock correlations, in which an agent's expected return for one stock…
DVA framework attributes value of predictive models to features, configurations, and interactions.
problem Lack of explanation for how predictive models influence operational decisions.
method Shapley-based cooperative game theory applied to predict-then-optimize systems.
result DVA can guide targeted interventions to align model beliefs with operational performance.
HyperSHAP explains HPO hyperparameters and interactions, improving trust and adoption.
problem Tackling opaque HPO methods and lack of user trust.
method Game-theoretic explainability framework based on Shapley values and interactions.
result Provides insights into hyperparameter contributions and interactions.
Explaining complex or seemingly simple machine learning models is an important practical problem. We want to explain individual predictions from a complex machine learning model by learning simple, interpretable explanations. Shapley values is a game theoretic concept that can be used for this purpose. The Shapley valu…
Machine learning detects regime shifts in online game-experiments with high accuracy.
problem Detecting regime shifts in online social systems.
method Gradient-boosted decision trees with memory-retaining features.
result Significantly outperforms standard early warning indicators.
New methods for estimating conditional Shapley values compared and evaluated.
problem Estimating precise conditional Shapley values for tabular data models.
method Developed new and extended methods using Monte Carlo integration and regression.
result Recommendations for choosing between Monte Carlo and regression methods based on data distribution.
Recent progress in artificial intelligence (AI) has renewed interest in building systems that learn and think like people. Many advances have come from using deep neural networks trained end-to-end in tasks such as object recognition, video games, and board games, achieving performance that equals or even beats humans …
This work explains crises in markets without external news using bounded rational agents.
problem Inability to model out-of-equilibrium dynamics in economic markets.
method Modeling bounded rational strategic reasoning in multi-agent market games.
result Bounded rational strategic reasoning can lead to endogenously emerging crises.
Paper learns skill distributions from game outcomes, proving minimax optimality.
problem Learning skill distributions from noisy pairwise game outcomes.
method Proposes a simple algorithm using kernel density estimation and minimax techniques.
result Near-optimal minimax mean squared error scaling for skill density estimation.
Anomaly detection algorithms are often thought to be limited because they don't facilitate the process of validating results performed by domain experts. In Contrast, deep learning algorithms for anomaly detection, such as autoencoders, point out the outliers, saving experts the time-consuming task of examining normal …
Many methods to explain black-box models, whether local or global, are additive. In this paper, we study global additive explanations for non-additive models, focusing on four explanation methods: partial dependence, Shapley explanations adapted to a global setting, distilled additive explanations, and gradient-based e…
AXE evaluates explanations to avoid misleading Rashomon set model selection.
problem Evaluating explanations for Rashomon set models to avoid false selection.
method Proposed AXE method to evaluate explanation quality.
result AXE detects adversarial fairwashing with 100% success rate.
The paper proposes criteria and methods for evaluating and aggregating feature-based model explanations.
problem Lack of quantitative evaluation criteria for feature-based model explanations.
method Developed quantitative evaluation criteria (low sensitivity, high faithfulness, low complexity), devised a framework for aggregation, and derived a new aggregate Shapley value explanation function.
result A new aggregate Shapley value explanation function that minimizes sensitivity.
New definition reveals encoding explanations that retain predictive power.
problem Challenges in evaluating and identifying encoding explanations.
method Developed a definition of encoding based on conditional dependence.
result Existing evaluation scores do not rank non-encoding explanations correctly, but STRIPE-X does.
Survey on efficient counterfactual explanations for various ML models.
problem Providing understandable explanations for machine learning predictions.
method Review and propose methods for computing counterfactual explanations.
result Efficient methods for various ML models and new methods for unconsidered models.