REVIEW 2 cited by
Counterfactual Explanations via Riemannian Latent Space Traversal
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
Signed reviews
read the original abstract
The adoption of increasingly complex deep models has fueled an urgent need for insight into how these models make predictions. Counterfactual explanations form a powerful tool for providing actionable explanations to practitioners. Previously, counterfactual explanation methods have been designed by traversing the latent space of generative models. Yet, these latent spaces are usually greatly simplified, with most of the data distribution complexity contained in the decoder rather than the latent embedding. Thus, traversing the latent space naively without taking the nonlinear decoder into account can lead to unnatural counterfactual trajectories. We introduce counterfactual explanations obtained using a Riemannian metric pulled back via the decoder and the classifier under scrutiny. This metric encodes information about the complex geometric structure of the data and the learned representation, enabling us to obtain robust counterfactual trajectories with high fidelity, as demonstrated by our experiments in real-world tabular datasets.
Forward citations
Cited by 2 Pith papers
-
Causally Steered Diffusion for Automated Video Counterfactual Generation
CSVC optimizes text prompts via vision-language-model feedback to steer frozen video diffusion editors toward causally consistent facial counterfactuals such as aging, gender change, beard addition, and baldness.
-
Graph Counterfactual Explainable AI via Latent Space Traversal
Counterfactual graph explanations are generated by gradient descent in the latent space of a permutation-equivariant graph VAE, steering the graph's encoding to the opposite class.
Discussion (0). Continue with ORCID to comment.