GRETEL unifies GCE evaluation across various settings.
problem Lack of standardized evaluation for Graph Counterfactual Explanations.
method Unified framework for testing GCE methods in diverse settings.
result GRETEL promotes reproducible evaluations of GCE techniques.
Paper proposes counterfactual explanations for ML on multivariate time series data.
problem Lack of user trust and difficulty in debugging ML frameworks using multivariate time series data.
method Proposes a novel explainability technique for providing counterfactual explanations.
result Outperforms state-of-the-art explainability methods in metrics like faithfulness and robustness.
WISCA generates consensus explanations from conflicting model-agnostic interpretability methods.
problem Conflicting explanations from diverse interpretability algorithms.
method WISCA integrates class probability and normalized attributions to generate consistent explanations.
result WISCA consistently aligns with the most reliable individual method, improving explanation reliability.
The paper argues for prioritizing identifying structure over complex models for scientific discovery.
problem Underdetermination of mechanisms in high-dimensional data, leading to unreliable explanations.
method Proposes concrete standards for 'mechanistic ML' to avoid collapsing explanations.
result Large language models (LLMs) can collapse large equivalence classes of explanations, making it hard to distinguish between mechanisms.
Automated decision making is used routinely throughout our everyday life. Recommender systems decide which jobs, movies, or other user profiles might be interesting to us. Spell checkers help us to make good use of language. Fraud detection systems decide if a credit card transactions should be verified more closely. M…
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.
Study compares and contrasts various ML explanation methods, highlighting their disagreements and similarities.
problem Understanding and quantifying the differences between various machine learning explanation methods.
method Synthesized and visualized various explanation methods for global and local aspects of ML models.
result There is substantial agreement on the top features but less on specific rankings, and tree interpreter is comparable to SHAP for feature effects.
Translating machine learning (ML) models effectively to clinical practice requires establishing clinicians' trust. Explainability, or the ability of an ML model to justify its outcomes and assist clinicians in rationalizing the model prediction, has been generally understood to be critical to establishing trust. Howeve…
Paper addresses feasibility of counterfactual explanations in ML models, especially for critical domains.
problem Feasibility of counterfactual examples in ML models, especially in healthcare and finance.
method Uses partial structural causal models and modified variational autoencoder loss to generate counterfactuals that satisfy feasibility constraints.
result Generated counterfactuals better satisfy feasibility constraints than existing methods.
Proposes MOC method for better counterfactual explanations in ML models.
problem Difficulties in balancing multiple objectives for counterfactual explanations.
method Translates counterfactual search into a multi-objective optimization problem.
result Returns diverse counterfactuals with different trade-offs and maintains feature diversity.
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.
This study compares feature importance and explainability in quantum vs classical ML models.
problem Lack of transparency in ML models, especially in sensitive fields.
method Comparison of classical ML (SVM, Random Forest) and hybrid quantum ML (VQC, QSVC) models using feature importance and explainability methods.
result Quantum ML models provide insights similar to classical models but with unique quantum features.
OptiLIME improves LIME explanations by balancing stability and adherence.
problem LIME's instability and lack of reliability in explanations.
method OptiLIME uses a deterministic sampling approach and feature selection to maximize stability while retaining predefined adherence.
result OptiLIME provides more reliable and interpretable explanations.
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.
SMILE improves explainability of machine learning models.
problem Difficulty in understanding and trusting the conclusions of black-box machine learning models.
method Statistical Model-agnostic Interpretability with Local Explanations (SMILE).
result SMILE makes machine learning models more interpretable.
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.
XAI methods fail to explain ML models reliably.
problem Current XAI methods fail to provide reliable explanations for ML models.
method Formally define problems and design methods accordingly.
result Diverse notions of explanation correctness and metrics needed.
Improved interpretability methods for ML models using local regressions and variable importance.
problem Inability of existing interpretability methods to provide reliable explanations for ML models, especially in high-dimensional problems with irrelevant features and non-linear relationships.
method Introduces VarImp and SupClus methods using local regressions with weighted distance considering variable importance.
result VarImp and SupClus methods yield better explanations than state-of-the-art approaches, especially in high-dimensional problems with irrelevant features and non-linear relationships.
Local Interpretable Model-Agnostic Explanations (LIME) is a popular technique used to increase the interpretability and explainability of black box Machine Learning (ML) algorithms. LIME typically generates an explanation for a single prediction by any ML model by learning a simpler interpretable model (e.g. linear cla…
Study investigates XAI methods in clinical gait analysis.
problem Limited understanding of machine learning models in healthcare.
method XAI methods, specifically Layer-wise Relevance Propagation (LRP), to explain ML predictions.
result Explanations from LRP show promising statistical and clinical relevance.
New framework explains ML credit scoring models using counterfactual examples.
problem Explaining complex ML models in finance for credit scoring.
method Adversarial counterfactual examples for tabular data.
result Proposes a method to generate realistic counterfactual examples for tabular data.
Predictive models can be used for causal inference with feature selection.
problem Limitations of predictive models in interpreting causal relationships.
method Constrained learning process by selecting features according to Pearl's backdoor adjustment criterion.
result Causal models provide near unbiased effect estimates and better generalization.
EAGLE improves reproducibility and stability of model explanations.
problem Creating reliable explanations for opaque machine learning models.
method Formulates perturbation selection as an information-theoretic active learning problem.
result EAGLE learns a linear surrogate model with feature importance scores and uncertainty estimates.
Interpretability has become an important topic of research as more machine learning (ML) models are deployed and widely used to make important decisions. Most of the current explanation methods provide explanations through feature importance scores, which identify features that are important for each individual input. …
Two XAI methods, SHAP and LIME, are discussed for tabular data models.
problem Making machine learning models transparent and trustworthy.
method SHAP and LIME methods for explaining model predictions.
result SHAP and LIME are model-dependent and sensitive to feature collinearity.
As machine learning becomes more pervasive, there is an urgent need for interpretable explanations of predictive models. Prior work has developed effective methods for visualizing global model behavior, as well as generating local (instance-specific) explanations. However, relatively little work has addressed regional …
Study uses chatbot to understand users' needs for ML model explanations.
problem Lack of understanding of user needs for model explanations.
method Developed a conversational system (dr_ant) to collect user questions about a machine learning model trained on Titanic data.
result Collected a corpus of 1000+ dialogues to identify common user questions.
SAGE-FIN detects financial fraud using GNNs and Granger causality.
problem Detecting fraud in financial networks with limited labeled data and lack of explainability.
method Semi-supervised GNN approach with Granger causal explanations.
result SAGE-FIN outperforms on real-world financial network dataset with explainable flagged items.
Transfer learning which aims at utilizing knowledge learned from one problem (source domain) to solve another different but related problem (target domain) has attracted wide research attentions. However, the current transfer learning methods are mostly uninterpretable, especially to people without ML expertise. In thi…
Decisions by Machine Learning (ML) models have become ubiquitous. Trusting these decisions requires understanding how algorithms take them. Hence interpretability methods for ML are an active focus of research. A central problem in this context is that both the quality of interpretability methods as well as trust in ML…
RFX-Fuse combines Breiman and Cutler's Random Forest with modern ML capabilities.
problem Lack of a unified ML engine with diverse capabilities.
method Unified ML engine with native GPU/CPU support, delivering 5+ functionalities in one model.
result Native explainable similarity and imputation validation.
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.
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.
Study evaluates feature ranking methods' faithfulness in ML models, improving with dimensionality reduction.
problem Quantifying and improving the faithfulness of feature ranking methods in ML models.
method Evaluation of multiple feature ranking methods, including SHAP, LIME, ALE variance, and LR coefficients, using permutation importance as a baseline.
result Dimensionality reduction improves the faithfulness of feature ranking methods, making permutation importance the most faithful method.
Systematic review of ML explainability in process mining.
problem Understanding the black-box nature of ML models in process mining.
method Systematic literature review using PRISMA framework.
result Identification of key trends and challenges in interpretability.
Spin-opstrings from QMC simulations enable ML of quantum phases.
problem Capturing and predicting quantum phase transitions using ML.
method Spin-opstrings derived from QMC simulations used as ML input.
result Spin-opstrings accurately predict quantum phase transitions.
SurvBeX explains ML survival models using Beran estimator.
problem Interpreting predictions of machine learning survival models.
method Uses modified Beran estimator as surrogate model to compute feature impacts.
result SurvBeX minimizes mean distance between black-box and surrogate model survival functions.
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.
New insights on Shapley value precision for tabular data predictions.
problem Precision of Shapley value explanations for individual observations.
method Conditional Shapley value estimation methods for tabular data.
result Shapley value explanations are less precise for outer observations.
New method explains ML performance gaps without causal knowledge.
problem Understanding why ML algorithms perform differently across domains.
method Nonparametric hierarchical decomposition framework.
result Detailed variable-level explanations for performance gaps.
Study finds explainability used mainly by ML engineers, not end users.
problem Insufficient transparency for end users in deployed machine learning models.
method Synthesizes limitations of current explainability techniques and develops a framework for clear goals.
result Current explainability techniques primarily serve internal stakeholders, not external users.
This review clarifies XAI for regression models and establishes new theoretical insights.
problem Lack of XAI techniques for regression models, especially in safety-critical applications.
method Clarifies conceptual differences, establishes theoretical insights, provides demonstrations, discusses challenges.
result Novel theoretical insights and demonstrations of XAI for regression models.
Complex black-box predictive models may have high accuracy, but opacity causes problems like lack of trust, lack of stability, sensitivity to concept drift. On the other hand, interpretable models require more work related to feature engineering, which is very time consuming. Can we train interpretable and accurate mod…
New approach to meaningful and robust algorithmic recourse.
problem Ineffective and unmeaningful algorithmic recourse explanations.
method Meaningful Algorithmic Recourse (MAR) and Effective Algorithmic Recourse (EAR).
result Proposes new constraints for algorithmic recourse that improve both prediction and target.
Material scientists are increasingly adopting the use of machine learning (ML) for making potentially important decisions, such as, discovery, development, optimization, synthesis and characterization of materials. However, despite ML's impressive performance in commercial applications, several unique challenges exist …
SHAP explains boosted trees with additively modeled features.
problem Explaining predictions of boosted trees models with additively modeled features.
method SHAP values for additively modeled features in boosted trees models.
result SHAP dependence plot matches partial dependence plot for additively modeled features.
Framework enhances AI explainability by aligning with human cognitive models.
problem Lack of explainability in AI models hinders trust and accountability.
method Integrates explainability techniques with Malle's five category model of behavior explanation.
result Demonstrates practical relevance in credit risk assessment and regulatory analysis.
High-dimensional spectroscopy data makes ML models achieve near-perfect accuracy, even when chemical distinctions are absent.
problem Why machine learning models achieve near-perfect accuracy in spectroscopic classification tasks without chemically meaningful features.
method Theoretical analysis grounded in the Feldman-Hajek theorem and concentration of measure, combined with specific experiments on synthetic and real fluorescence spectra.
result Infinitesimal distributional differences in high-dimensional spaces can lead to perfect separability, making models achieve near-perfect accuracy in spectroscopy.