Informative Semi-Factuals for XAI: The Elaborated Explanations that People Prefer
Authors: Saugat Aryal, Mark T. Keane
Organizations: School of Computer Science, University College Dublin, Dublin, Ireland · Insight Research Ireland Centre for Data Analytics, Dublin, Ireland
Recently, in eXplainable AI (XAI), even if explanations -- so-called semi-factuals -- have emerged as a popular strategy that explains how a predicted outcome can remain the same even when certain input-features are altered. For example, in the commonly-used banking app scenario, a semi-factual explanation could inform customers about better options, other alternatives for their successful application, by saying "Even if you asked for double the loan amount, you would still be accepted". Most semi-factuals XAI algorithms focus on finding maximal value-changes to a single key-feature that do not alter the outcome (unlike counterfactual explanations that often find minimal value-changes to several features that alter the outcome). However, no current semi-factual method explains why these extreme value-changes do not alter outcomes; for example, a more informative semi-factual could tell the customer that it is their good credit score that allows them to borrow double their requested loan. In this work, we advance a new algorithm -- the informative semi-factuals (ISF) method -- that generates more elaborated explanations supplementing semi-factuals with information about additional hidden features that influence an automated decision. Experimental results on benchmark datasets show that this ISF method computes semi-factuals that are both informative and of high-quality on key metrics. Furthermore, a user study shows that people prefer these elaborated explanations over the simpler semi-factual explanations generated by current methods.
Figures & tables
Figure 1: The decision space for three loans, with two features shown (i.e., Loan Amount in sandCreditScoreasCS),forthreeapplicants:John,MarkandMary.JohnandMarkhavetheirloansacceptedbutMaryhasbeenrejected.Markasksforanexplanationabouthowtogetabetterdeal.Thesemi−factual(SF)tellshimthatwithhis550creditscore,hecanactuallygeta65k loan. Mark previously thought that if he asked for more, he would end up being rejected like Mary. The semi-factual shows Mark the limits on his loan aplication given his credit score (n.b., if he asked for $70k, he would be rejected like Mary).
Figure 2: The rightmost graph shows a decision space for Mark and his semi-factual explanation (SF), with a path between them based on two perturbation steps (Q’ and Q”) in which the key-feature loan amount is systematically increased from 20kto65K, without changing credit-score (which stays at 550). The leftmost graphic shows the relative changes in the marginal contributions of these two features across these perturbed instances as they remain in the loan-accept class. As loan amount increases its marginal contribution to keeping instances in the loan-accept class decreases (see purple plot) and even though credit-score’s value does not change, it’s marginal contribution increases (see orange plot) revealing this seesaw pattern between the two features.
Figure 3: From Expt.1, the percentage of semi-factuals, for five datasets, generated by the ISF and Ensemble-methods (N=38,233 in total), that manifested the seesaw pattern in key-feature versus hidden-feature contributions.
Figure 4: From Expt.2, the mean goodness scores for semi-factuals generated by the ISF and Ensemble-methods for the five datasets (N=38,233 in total), in each of the four evaluation metrics (a-d).
Figure 5: The percentage of people choosing the (a) Bare Semi-factual or Informative Semi-Factual in User Study 1, and (b) the Good or Bad Semi-factuals in User Study 2, for scenarios with the loan-accepted or loan-rejected outcomes
Appendix figures & tables1 asset
Supplementary material from the paper’s appendix.
Appendix
Dataset
Sample of Best Semi-factuals
Best-Semi-factuals with Seesaw Pattern
Adult Income
1200
1029
Blood Alcohol
400
360
PIMA Diabetes
100
92
Default Credit Card
3200
2826
German Credit
400
358
HELOC
2000
1820
Appendix
Table 1: Table showing the number of best semi-factuals sampled from each dataset and how many of those had the seesaw pattern.
Explainable AI (XAI) techniques are increasingly important for the validation and responsible use of modern deep learning models, but are difficult to evaluate due to the lack of good ground-truth to compare against. We propose a framework that serves as a quantifiable metric for the quality of XAI methods, based on continuous input perturbation. Our metric formally considers the sufficiency and necessity of the attributed information to the model's decision-making, and we illustrate a range of cases where it aligns better with human intuitions of explanation quality than do existing metrics. To exploit the properties of this metric, we also propose a novel XAI method, considering the case where we fine-tune a model using a differentiable approximation of the metric as a supervision signal. The result is an adapter module that can be trained on top of any black-box model to output causal explanations of the model's decision process, without degrading model performance. We show that the explanations generated by this method outperform those of competing XAI techniques according to a number of quantifiable metrics.
Amritpal Singh, Andrey Barsky, Mohamed Ali Souibgui +2
Computer Vision Center, Barcelona, Spain · Autonomous University of Barcelona, Spain
The XAI community has studied a wide range of queries and scores for explaining predictions of ML models. From a data management perspective, this proliferation of explanation notions calls for declarative query languages in which such notions can be specified, combined, and analyzed uniformly. In this paper, we develop such a framework for Boolean models. We first revisit FOIL, an interpretability query language for black-box models, and show that it has two fundamental limitations: it cannot express central optimality-based explanation queries, and its evaluation problem over decision trees is hard for every level of the polynomial hierarchy. We then introduce ExplAIner, a query language based on FOIL with an extended vocabulary and a layered structure. We show that ExplAIner can express a broad family of explanation notions, including abductive, contrastive, feature-based, and distance-based queries. We also prove that the evaluation problem for each query in ExplAIner belongs to the Boolean hierarchy over every class of Boolean models for which some basic predicates can be evaluated in polynomial time. In particular, that property holds for deterministic and decomposable Boolean circuits. Finally, we introduce Opt-FOIL, an optimization-oriented fragment of ExplAIner for computing explanations that are minimal with respect to strict partial orders, and prove that its evaluation problem is in FPNP under the same tractability assumptions. These complexity results have a direct algorithmic consequence: a fixed ExplAIner query can be evaluated with a fixed number of calls to a SAT solver, while a notion of explanation specified in Opt-FOIL can be computed with a polynomial number of such calls. This is particularly relevant in formal XAI, where SAT solvers have been successfully used to compute explanations for several classes of ML models.
Marcelo Arenas, Pablo Barceló, Diego Bustamante +3
Pontificia Universidad Católica de Chile, Chile · Carnegie Mellon University, USA
Financial institutions increasingly require AI explanations that are persistent, cross-validated across methods, and conversationally accessible to human decision-makers. We present an architecture for human-centered explainable AI in financial sentiment analysis that combines three contributions. First, we treat XAI artifacts -- LIME feature attributions, occlusion-based word importance scores, and saliency heatmaps -- as persistent, searchable objects in distributed S3-compatible storage with structured metadata and natural-language summaries, enabling semantic retrieval over explanation history and automatic index reconstruction after system failures. Second, we enable multi-method explanation triangulation, where a retrieval-augmented generation (RAG) assistant compares and synthesizes results from multiple XAI methods applied to the same prediction, allowing users to assess explanation robustness through natural-language dialogue. Third, we evaluate the faithfulness of generated explanations using automated checks over grounding completeness, hallucinated claims, and method-attribution behavior. We demonstrate the architecture on an EXTRA-BRAIN financial sentiment analysis pipeline using FinBERT predictions and present evaluation results showing that constrained prompting reduces hallucination rate by 36% and increases method-attribution citations by 73% compared to naive prompting. We discuss implications for trustworthy, human-centered AI services in regulated financial environments.
Georgios Makridis, Georgios Fatouros, John Soldatos +2
University of Piraeus, Greece · ExpertAI-Lux S.à r.l · Department of Digital Systems