An explainability-aware L0 penalty yields coherent counterfactual edits, and the same geometry defines a Tolerance-Region Confusion Matrix that quantifies class-to-class fragility under interpretable perturbations.
Inverse Classification for Comparison-based Interpretability in Machine Learning
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
In the context of post-hoc interpretability, this paper addresses the task of explaining the prediction of a classifier, considering the case where no information is available, neither on the classifier itself, nor on the processed data (neither the training nor the test data). It proposes an instance-based approach whose principle consists in determining the minimal changes needed to alter a prediction: given a data point whose classification must be explained, the proposed method consists in identifying a close neighbour classified differently, where the closeness definition integrates a sparsity constraint. This principle is implemented using observation generation in the Growing Spheres algorithm. Experimental results on two datasets illustrate the relevance of the proposed approach that can be used to gain knowledge about the classifier.
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimized Instance Alteration for Explaining and Assessing Robustness of Classifiers
An explainability-aware L0 penalty yields coherent counterfactual edits, and the same geometry defines a Tolerance-Region Confusion Matrix that quantifies class-to-class fragility under interpretable perturbations.