3 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.LG2024★ 1 cited
Feature Attribution with Necessity and Sufficiency via Dual-stage Perturbation Test for Causal Explanation
Xuexin Chen, Ruichu Cai, Zhengting Huang +5
We investigate the problem of explainability for machine learning models, focusing on Feature Attribution Methods (FAMs) that evaluate feature importance through perturbation tests…
cs.LG2024★ 1 cited
Where and How to Attack? A Causality-Inspired Recipe for Generating Counterfactual Adversarial Examples
Ruichu Cai, Yuxuan Zhu, Jie Qiao +3
Deep neural networks (DNNs) have been demonstrated to be vulnerable to well-crafted \emph{adversarial examples}, which are generated through either well-conceived -n…
cs.LG2022★ 3 cited
On the Probability of Necessity and Sufficiency of Explaining Graph Neural Networks: A Lower Bound Optimization Approach
Ruichu Cai, Yuxuan Zhu, Xuexin Chen +4
The explainability of Graph Neural Networks (GNNs) is critical to various GNN applications, yet it remains a significant challenge. A convincing explanation should be both necessar…