REVIEW 17 cited by
Counterfactual Explanations and Algorithmic Recourses for Machine Learning: A Review
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Counterfactual Explanations and Algorithmic Recourses for Machine Learning: A Review
read the original abstract
Machine learning plays a role in many deployed decision systems, often in ways that are difficult or impossible to understand by human stakeholders. Explaining, in a human-understandable way, the relationship between the input and output of machine learning models is essential to the development of trustworthy machine learning based systems. A burgeoning body of research seeks to define the goals and methods of explainability in machine learning. In this paper, we seek to review and categorize research on counterfactual explanations, a specific class of explanation that provides a link between what could have happened had input to a model been changed in a particular way. Modern approaches to counterfactual explainability in machine learning draw connections to the established legal doctrine in many countries, making them appealing to fielded systems in high-impact areas such as finance and healthcare. Thus, we design a rubric with desirable properties of counterfactual explanation algorithms and comprehensively evaluate all currently proposed algorithms against that rubric. Our rubric provides easy comparison and comprehension of the advantages and disadvantages of different approaches and serves as an introduction to major research themes in this field. We also identify gaps and discuss promising research directions in the space of counterfactual explainability.
Forward citations
Cited by 17 Pith papers
-
Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms
CPCF, a compact finite-domain CP encoding for tree ensembles, outperforms MaxSAT and MILP for optimal counterfactual search in most tested regimes.
-
Back to the Feature: Explaining Video Classifiers with Video Counterfactual Explanations
BTTF optimizes the initial noise of an image-to-video diffusion model using the target classifier's gradients to produce minimal counterfactual videos that explain video classifiers.
-
Learning-Augmented Robust Algorithmic Recourse
Introduces learning-augmented robust algorithmic recourse that trades off consistency with accurate future-model predictions against robustness to inaccurate predictions via a novel algorithm.
-
A Meta Reinforcement Learning Approach to Goals-Based Wealth Management
MetaRL pre-trained on GBWM problems delivers near-optimal dynamic strategies in 0.01s achieving 97.8% of DP optimal utility and handles larger problems where DP fails.
-
From Universal to Individualized Actionability: Revisiting Personalization in Algorithmic Recourse
Formalizing personalization as individual actionability in causal recourse shows hard constraints degrade validity and plausibility while revealing socio-demographic disparities in costs.
-
DCFO: Density-Based Counterfactuals for Outliers -- Additional Material
DCFO partitions the feature space by nearest-neighbour structure to make LOF scores differentiable, then uses gradient-based search to find the closest change that turns an outlier into an inlier.
-
Enhancing Interpretability and Effectiveness in Recommendation with Numerical Features via Learning to Contrast the Counterfactual samples
A plug-in contrastive loss that enforces monotonicity between numerical features and recommender outputs, via counterfactual sample synthesis, improves AUC, GAUC, and monotonicity.
-
VISION: Robust and Interpretable Code Vulnerability Detection Leveraging Counterfactual Augmentation
LLM-generated counterfactual code pairs with flipped vulnerability labels, used to train a GNN, sharply improve CWE-20 detection and attribution on the released CWE-20-CFA benchmark.
-
AULLM++: Structured-Token-Conditioned Large Language Models for Micro-Expression Action Unit Detection
AULLM++ fuses multi-granularity visual tokens with FACS-prior AU graph instructions into an LLM prompt and uses counterfactual consistency training to improve micro-expression AU detection and cross-domain Macro-F1.
-
Profit-Based Counterfactual Explanations for Product Improvement: A Case Study of Manga Sales in Japan
PBCE formulates counterfactual explanations as profit maximization, removing exogenous targets and treating feature changes as modification costs, applied to manga sales prediction in Japan.
-
UNR-Explainer: Counterfactual Explanations for Unsupervised Node Representation Learning Models
UNR-Explainer applies MCTS to find subgraphs that change k-NN relations in unsupervised node embeddings, claiming superior performance on GraphSAGE and DGI across datasets.
-
A Neuro-Symbolic Framework for Accountability in Public-Sector AI
A framework combining legal ontology, rule extraction, and solver reasoning verifies whether AI explanations for CalFresh eligibility align with statutory constraints.
-
Inferring Effects of Major Events through Discontinuity Forecasting of Population Anxiety
Discontinuity forecasting predicts a county's anxiety jump and slope change after a major event from pre-event trends, reaching out-of-sample correlations of about .76 and .87.
-
Position: Explainability Research Must Prioritize Foundations over Ad-hoc Methods
Explainable AI research should prioritize definitions, properties, evaluations, and actionability over new ad-hoc methods, on evidence from 617 papers and 34 practitioners.
-
Explainable bank failure prediction models: Counterfactual explanations to reduce the failure risk
Compares counterfactual generation methods with balancing strategies on bank failure data, finding NICF with cost-sensitive learning produces the highest quality explanations on validity, proximity, and sparsity.
-
Trustworthy AI in Digital Health: A Comprehensive Review of Robustness and Explainability
A survey of robustness and explainability methods for digital health AI, proposing a taxonomy and illustrating known XAI tools, without new empirical or theoretical results.
-
CoFE: A Framework Generating Counterfactual ECG for Explainable Cardiac AI-Diagnostics
CoFE edits ECG signals in a StyleGAN2 latent space so that an AI model changes its prediction, and the resulting feature changes match clinical signs for AF and hyperkalemia.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.