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.
Method trains deep models to explain predictions with fewer examples.
problem Difficulty in humans understanding deep model predictions.
method Simultaneously trains prediction and explanation models with sparse regularization.
result Improves faithfulness of explanations with fewer examples while maintaining predictive performance.
Study finds visual explanations do not significantly improve human accuracy or trust in model predictions.
problem Measuring the impact of visual explanations on human accuracy and trust in model predictions.
method Randomized controlled trial with image-based age prediction task, varying levels of explanation quality.
result Visual explanations do not significantly alter human accuracy or trust in the model.
This research examines how model explanations change under distribution shifts in tabular data.
problem Detecting distribution shifts in tabular data affecting model performance and explanations.
method Investigates the relationship between model performance and explanation characteristics under distribution shifts.
result Explanation shifts are a better indicator for detecting predictive performance changes than traditional distribution shift techniques.
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.
Explearn learns to explain predictions using Gaussian Processes.
problem Learning to explain predictions effectively.
method Gaussian Processes-based contextual bandits.
result Guaranteed convergence with high probability.
We introduce a method, KL-LIME, for explaining predictions of Bayesian predictive models by projecting the information in the predictive distribution locally to a simpler, interpretable explanation model. The proposed approach combines the recent Local Interpretable Model-agnostic Explanations (LIME) method with ideas …
Extends local attributions to Bayesian Neural Networks for improved explanations.
problem Lack of explanations for Bayesian Neural Networks' predictions.
method Extend local attributions to a probabilistic explanation distribution of BNNs.
result Enriches standard explanations with uncertainty information and visualizes explanation stability.
TED framework teaches AI to explain decisions, improving accuracy.
problem Providing understandable explanations for AI predictions in high-stakes applications.
method Augmenting training data with explanations from domain users, using embeddings and multi-task learning.
result AI models can be taught to provide meaningful explanations, sometimes improving accuracy.
RAW-Explainer generates interpretable subgraph explanations for link predictions in knowledge graphs.
problem Interpreting GNN predictions for link prediction in heterogeneous settings is challenging.
method RAW-Explainer uses random walk objective and neural network to generate connected, concise subgraph explanations.
result RAW-Explainer strikes a balance between explanation quality and computational efficiency.
ID-ExpO fine-tunes neural networks for more faithful explanations.
problem Improving the faithfulness of explanations for complex machine learning models.
method Differentiable insertion/deletion metric-aware regularizers for optimization.
result Fine-tuned predictors produce more faithful explanations.
The study evaluates how well local explanations align with model predictions.
problem Capturing the faithfulness of local explanations to model predictions.
method Introducing consistency and sufficiency as properties, and developing quantitative measures and estimators.
result Quantitative measures of consistency and sufficiency depend on test-time data distribution.
Paper introduces new evaluation criteria for feature-based model explanations.
problem Establishing reliable feature importance explanations for models.
method Robustness analysis using smaller adversarial perturbations.
result New explanations that are necessary and sufficient for predictions.
CLE explains any classifier predictions in plain terms.
problem Understanding complex classifier predictions.
method Model-agnostic explanation technique approximating locally using interpretable models.
result CLE provides faithful and interpretable explanations for various classifiers.
New research challenges the idea that counterfactual explanations should be sparse.
problem Predictive multiplicity leads to multiple models giving almost equal solutions.
method Derive a general upper bound for counterfactual costs under multiplicity and compare sparse vs. data support approaches.
result Data support methods are more robust to multiplicity but have higher counterfactual costs.
Study evaluates relevance metrics for similarity-based model explanations.
problem Providing understandable explanations for complex model predictions.
method Evaluated three relevance metrics using three tests.
result Cosine similarity of gradients performs best for explanations.
Modern learning algorithms excel at producing accurate but complex models of the data. However, deploying such models in the real-world requires extra care: we must ensure their reliability, robustness, and absence of undesired biases. This motivates the development of models that are equally accurate but can be also e…
Unified metric c-Eval evaluates feature-based explanations by perturbation.
problem Lack of consensus on evaluating feature-based local explanations.
method Introduces c-Eval metric and framework to quantify explanation quality.
result c-Eval captures the importance of input features and is applicable in adversarial-robust models.
This study analyzes counterfactual explanations for student success models.
problem Improving trust in machine learning models for student success prediction.
method Comparison of counterfactual generation methods (WhatIf, Multi-Objective, Nearest Instance) for student success prediction models.
result WhatIf Counterfactual Explanations are more effective for student success prediction models.
New method provides calibrated feature importance explanations for regression models.
problem Lack of uncertainty quantification in existing local explanation methods.
method Extension of Calibrated Explanations method to support regression and probabilistic regression.
result Calibrated Explanations for regression provides quantified uncertainty and robust explanations.
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.
Study proposes explainable analytics for manufacturing process planning.
problem Improving data-driven decision-making in manufacturing.
method Combines process mining, machine learning, and XAI. Uses deep learning for prediction and Shapley values/ICE plots for explanations.
result Enhanced decision-making capabilities through local post-hoc explanations.
A barrier to the wider adoption of neural networks is their lack of interpretability. While local explanation methods exist for one prediction, most global attributions still reduce neural network decisions to a single set of features. In response, we present an approach for generating global attributions called GAM, w…
Study on the relationship between explanations and predictions in machine learning models.
problem Understanding the relationship between explanations and predictions in machine learning models.
method Causal inference to measure treatment effect on hyperparameters and inputs.
result The relationship between explanations and predictions is far from ideal, especially in high-performing models.
Paper introduces Native Guide for generating time series counterfactual explanations.
problem Lack of explainability for time series data in AI systems.
method Model-agnostic, instance-based counterfactual generation for time series classification.
result Native Guide produces better counterfactual explanations than benchmarks.
RbX generates local explanations for black-box models using greedy polytope construction.
problem Generating interpretable local explanations for complex models.
method Greedy algorithm for building a convex polytope to approximate feature regions.
result RbX can more accurately identify important features compared to existing methods.
δ-CLUE generates diverse explanations for model uncertainty.
problem Lack of constraints in generating explanations for uncertainty estimates.
method Augmenting CLUE approach to provide a set of plausible explanations.
result Returns a set of diverse inputs that yield confident predictions.
This research investigates reliable local explanations for machine listening models.
problem Generating reliable local explanations for machine listening models.
method Investigates the sensitivity of SoundLIME explanations to input perturbations and proposes a novel method for identifying suitable content types.
result SoundLIME explanations are sensitive to the content in occluded input regions, and the average magnitude of input mel-spectrogram bins is the most suitable content type for temporal explanations.
Humans are the final decision makers in critical tasks that involve ethical and legal concerns, ranging from recidivism prediction, to medical diagnosis, to fighting against fake news. Although machine learning models can sometimes achieve impressive performance in these tasks, these tasks are not amenable to full auto…
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.
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.
Study investigates how AI can create and detect deceptive explanations, finding they can fool humans but ML can detect them.
problem The risk of deceptive AI explanations increasing trust issues and economic risks.
method Investigates creation and detection of deceptive explanations using AI models and machine learning methods.
result Deceptive explanations can fool humans, but ML can detect them with high accuracy.
Paper proposes Coalitional BAE to improve explainability of unsupervised deep learning models.
problem Improving explainability of Autoencoder's predictions.
method Introduces Coalitional BAE, inspired by agent-based system theory, to reduce correlation in explanations.
result Improved quality of explanations using Coalitional BAE on publicly available datasets.
A framework generates diverse counterfactual explanations for machine learning models.
problem Creating understandable explanations for machine learning predictions.
method Framework based on determinantal point processes for generating and evaluating diverse counterfactuals.
result Framework generates diverse counterfactuals that approximate local decision boundaries better than prior approaches.
LIMEtree offers faithful explanations for multiple classes in predictive models.
problem Generating explanations for several classes can be difficult due to conflicting evidence.
method LIMEtree uses multi-output regression trees for consistent and faithful explanations of multiple classes.
result LIMEtree provides diverse explanation types and outperforms LIME in evaluations.
We generate counterfactual explanations for tree-based boosting ensembles.
problem Understanding how tree-based models make predictions.
method Extending a method for random forests to GBDTs, accounting for tree sequential dependency and negative gradients.
result A method to generate counterfactual explanations for GBDTs.
We propose a general model explanation system (MES) for "explaining" the output of black box classifiers. This paper describes extensions to Turner (2015), which is referred to frequently in the text. We use the motivating example of a classifier trained to detect fraud in a credit card transaction history. The key asp…
GRACE generates concise explanations for neural networks on tabular data.
problem Lack of explainable AI solutions for neural networks on tabular data.
method Borrowing ideas from causality and philosophy, GRACE generates contrastive samples to explain neural network predictions.
result GRACE explanations are more intuitive and lead to better decision-making.
Proposes GPR with local explanation for feature interpretation.
problem Lack of feature interpretation in Gaussian process regression.
method Introduces a locally linear model to explain feature contributions in GPR predictions.
result Achieves comparable predictive performance to GPR and superior interpretability.
DistShap parallelizes GNN explanation for large graphs.
problem Computational expense in attributing GNN predictions to specific edges or features.
method Distributed Shapley values across multiple GPUs for scalable GNN explanations.
result DistShap outperforms existing methods and scales to models with millions of features.
Fraud detection is a difficult problem that can benefit from predictive modeling. However, the verification of a prediction is challenging; for a single insurance policy, the model only provides a prediction score. We present a case study where we reflect on different instance-level model explanation techniques to aid …
Paper examines risks of unjustified counterfactual explanations from post-hoc interpretability models.
problem Risks of generating unjustified counterfactual explanations from post-hoc interpretability models.
method Investigates local neighborhoods of instances for justification and compares state-of-the-art approaches.
result High risk of generating unjustified counterfactual examples, leading to less useful explanations.
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…
Improves local model explanations using GANs and Linear Model Trees.
problem Need for accurate and intuitive explanations of complex machine learning models.
method Generative Adversarial Network (GAN) for synthetic data generation and Linear Model Trees for surrogate model training.
result Significantly improved local model explanations with contextual information.
Develops counterfactual visual explanations to show how images could change to classify differently.
problem Creating understandable explanations for vision system predictions.
method Selects a distractor image and identifies spatial regions to modify for different classification.
result Users trained with counterfactual explanations perform better in fine-grained bird classification.
PiNets provide faithful explanations for neural networks.
problem Lack of true explanations for neural network predictions.
method Pointwise-interpretable Networks (PiNets) that form linear models instance-wise.
result PiNets offer explanations that are meaningful, aligned, robust, and sufficient.
Generative models explain machine learning predictions with counterfactual instances.
problem Generating human-interpretable insights into machine learning model predictions.
method Sparse counterfactual explanations using conditional generative models.
result Single forward pass generates batches of counterfactual instances.
Efficiently computes counterfactual explanations for LVQ models.
problem Need to efficiently explain predictions of machine learning models.
method Derives convex and non-convex programs for LVQ models.
result Efficient computation of counterfactual explanations for LVQ models.