Pith. sign in

REVIEW 2 cited by

Even if Explanations: Prior Work, Desiderata & Benchmarks for Semi-Factual XAI

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

arxiv 2301.11970 v2 pith:2JAXCWQN submitted 2023-01-27 cs.AI

Even if Explanations: Prior Work, Desiderata & Benchmarks for Semi-Factual XAI

classification cs.AI
keywords counterfactualdesiderataexplanationshistoricalloansemi-factualai-systemalgorithmic
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Recently, eXplainable AI (XAI) research has focused on counterfactual explanations as post-hoc justifications for AI-system decisions (e.g. a customer refused a loan might be told: If you asked for a loan with a shorter term, it would have been approved). Counterfactuals explain what changes to the input-features of an AI system change the output-decision. However, there is a sub-type of counterfactual, semi-factuals, that have received less attention in AI (though the Cognitive Sciences have studied them extensively). This paper surveys these literatures to summarise historical and recent breakthroughs in this area. It defines key desiderata for semi-factual XAI and reports benchmark tests of historical algorithms (along with a novel, naieve method) to provide a solid basis for future algorithmic developments.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Towards Verified and Targeted Explanations through Formal Methods

    cs.LG 2026-04 accept novelty 7.0

    ViTaX certifies targeted semifactual robustness: a minimal feature subset can be perturbed by ε without flipping a neural network from class y to a user-specified high-risk class t.

  2. Bridging the Disciplinary Gap in Explainable AI: From Abstract Desiderata to Concrete Tasks

    cs.CY 2026-05 unverdicted novelty 6.0

    The authors introduce a taxonomy with target, functional role, and mode of justification axes plus a framework that decomposes abstract XAI desiderata into concrete benchmarkable tasks via identified dependency structures.