A Framework for Feasible Counterfactual Exploration incorporating Causality, Sparsity and Density

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Markou, Kleopatra, Tomaras, Dimitrios, Kalogeraki, Vana, Gunopulos, Dimitrios
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866910417031266304
author Markou, Kleopatra
Tomaras, Dimitrios
Kalogeraki, Vana
Gunopulos, Dimitrios
author_facet Markou, Kleopatra
Tomaras, Dimitrios
Kalogeraki, Vana
Gunopulos, Dimitrios
contents The imminent need to interpret the output of a Machine Learning model with counterfactual (CF) explanations - via small perturbations to the input - has been notable in the research community. Although the variety of CF examples is important, the aspect of them being feasible at the same time, does not necessarily apply in their entirety. This work uses different benchmark datasets to examine through the preservation of the logical causal relations of their attributes, whether CF examples can be generated after a small amount of changes to the original input, be feasible and actually useful to the end-user in a real-world case. To achieve this, we used a black box model as a classifier, to distinguish the desired from the input class and a Variational Autoencoder (VAE) to generate feasible CF examples. As an extension, we also extracted two-dimensional manifolds (one for each dataset) that located the majority of the feasible examples, a representation that adequately distinguished them from infeasible ones. For our experimentation we used three commonly used datasets and we managed to generate feasible and at the same time sparse, CF examples that satisfy all possible predefined causal constraints, by confirming their importance with the attributes in a dataset.
format Preprint
id arxiv_https___arxiv_org_abs_2404_13476
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A Framework for Feasible Counterfactual Exploration incorporating Causality, Sparsity and Density
Markou, Kleopatra
Tomaras, Dimitrios
Kalogeraki, Vana
Gunopulos, Dimitrios
Machine Learning
Artificial Intelligence
The imminent need to interpret the output of a Machine Learning model with counterfactual (CF) explanations - via small perturbations to the input - has been notable in the research community. Although the variety of CF examples is important, the aspect of them being feasible at the same time, does not necessarily apply in their entirety. This work uses different benchmark datasets to examine through the preservation of the logical causal relations of their attributes, whether CF examples can be generated after a small amount of changes to the original input, be feasible and actually useful to the end-user in a real-world case. To achieve this, we used a black box model as a classifier, to distinguish the desired from the input class and a Variational Autoencoder (VAE) to generate feasible CF examples. As an extension, we also extracted two-dimensional manifolds (one for each dataset) that located the majority of the feasible examples, a representation that adequately distinguished them from infeasible ones. For our experimentation we used three commonly used datasets and we managed to generate feasible and at the same time sparse, CF examples that satisfy all possible predefined causal constraints, by confirming their importance with the attributes in a dataset.
title A Framework for Feasible Counterfactual Exploration incorporating Causality, Sparsity and Density
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2404.13476