On the robustness of sparse counterfactual explanations to adverse perturbations

DOI10.1016/j.artint.2022.103840arXiv2201.09051OpenAlexW4311771716MaRDI QIDQ6156854

Marco Virgolin, Saverio Fracaros

Publication date: 19 June 2023

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.09051

zbMATH Keywords

uncertaintyrobustnessexplainable machine learningexplainable artificial intelligencecounterfactual explanation

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites Work

• Unnamed Item
• Greedy function approximation: A gradient boosting machine.
• Implementing the Nelder-Mead simplex algorithm with adaptive parameters
• Hedonic housing prices and the demand for clean air
• Multilayer feedforward networks are universal approximators
• Deep double descent: where bigger models and more data hurt*
• Reconciling modern machine-learning practice and the classical bias–variance trade-off
• A Simplex Method for Function Minimization

This page was built for publication: On the robustness of sparse counterfactual explanations to adverse perturbations