TY - GEN
T1 - ReLAX
T2 - 31st ACM International Conference on Information and Knowledge Management, CIKM 2022
AU - Chen, Ziheng
AU - Silvestri, Fabrizio
AU - Wang, Jia
AU - Zhu, He
AU - Ahn, Hongshik
AU - Tolomei, Gabriele
N1 - Funding Information:
Several research directions are worth exploring in future work. For example: extend ReLAX to generate explanations for nontabular input data like images, and compare our method against non-counterfactual explanation approaches like SHAP [24] or LIME [31]. ACKNOWLEDGMENTS This research was supported by the Italian Ministry of Education, University and Research (MIUR) under the grant "Dipartimenti di eccellenza 2018-2022" and the XJTLU Research Development Fund under RDF-21-01-053, TDF21/22-R23-160, and AI Empowerment Tech. Inc. Research Fund under RDS10120220021. We thank the support from Casual AI Reading Group sponsored by Swarma Club and XOrder. We also thank Prof. Jianye Hao and Dr. Tianpei Yang.
Publisher Copyright:
© 2022 ACM.
PY - 2022/10/17
Y1 - 2022/10/17
N2 - Counterfactual examples (CFs) are one of the most popular methods for attaching post-hoc explanations to machine learning (ML) models. However, existing CF generation methods either exploit the internals of specific models or depend on each sample's neighborhood, thus they are hard to generalize for complex models and inefficient for large datasets. This work aims to overcome these limitations and introduces ReLAX, a model-agnostic algorithm to generate optimal counterfactual explanations. Specifically, we formulate the problem of crafting CFs as a sequential decision-making task and then find the optimal CFs via deep reinforcement learning (DRL) with discrete-continuous hybrid action space. Extensive experiments conducted on several tabular datasets have shown that ReLAX outperforms existing CF generation baselines, as it produces sparser counterfactuals, is more scalable to complex target models to explain, and generalizes to both classification and regression tasks. Finally, to demonstrate the usefulness of our method in a real-world use case, we leverage CFs generated by ReLAX to suggest actions that a country should take to reduce the risk of mortality due to COVID-19. Interestingly enough, the actions recommended by our method correspond to the strategies that many countries have actually implemented to counter the COVID-19 pandemic.
AB - Counterfactual examples (CFs) are one of the most popular methods for attaching post-hoc explanations to machine learning (ML) models. However, existing CF generation methods either exploit the internals of specific models or depend on each sample's neighborhood, thus they are hard to generalize for complex models and inefficient for large datasets. This work aims to overcome these limitations and introduces ReLAX, a model-agnostic algorithm to generate optimal counterfactual explanations. Specifically, we formulate the problem of crafting CFs as a sequential decision-making task and then find the optimal CFs via deep reinforcement learning (DRL) with discrete-continuous hybrid action space. Extensive experiments conducted on several tabular datasets have shown that ReLAX outperforms existing CF generation baselines, as it produces sparser counterfactuals, is more scalable to complex target models to explain, and generalizes to both classification and regression tasks. Finally, to demonstrate the usefulness of our method in a real-world use case, we leverage CFs generated by ReLAX to suggest actions that a country should take to reduce the risk of mortality due to COVID-19. Interestingly enough, the actions recommended by our method correspond to the strategies that many countries have actually implemented to counter the COVID-19 pandemic.
KW - counterfactual explanations
KW - deep reinforcement learning
KW - explainable ai
KW - machine learning explainability
UR - http://www.scopus.com/inward/record.url?scp=85140830775&partnerID=8YFLogxK
U2 - 10.1145/3511808.3557429
DO - 10.1145/3511808.3557429
M3 - Conference Proceeding
AN - SCOPUS:85140830775
T3 - International Conference on Information and Knowledge Management, Proceedings
SP - 252
EP - 261
BT - CIKM 2022 - Proceedings of the 31st ACM International Conference on Information and Knowledge Management
PB - Association for Computing Machinery
Y2 - 17 October 2022 through 21 October 2022
ER -