English

Robust Ranking Explanations

Machine Learning 2023-07-11 v1 Cryptography and Security

Abstract

Robust explanations of machine learning models are critical to establish human trust in the models. Due to limited cognition capability, most humans can only interpret the top few salient features. It is critical to make top salient features robust to adversarial attacks, especially those against the more vulnerable gradient-based explanations. Existing defense measures robustness using p\ell_p-norms, which have weaker protection power. We define explanation thickness for measuring salient features ranking stability, and derive tractable surrogate bounds of the thickness to design the \textit{R2ET} algorithm to efficiently maximize the thickness and anchor top salient features. Theoretically, we prove a connection between R2ET and adversarial training. Experiments with a wide spectrum of network architectures and data modalities, including brain networks, demonstrate that R2ET attains higher explanation robustness under stealthy attacks while retaining accuracy.

Keywords

Cite

@article{arxiv.2307.04024,
  title  = {Robust Ranking Explanations},
  author = {Chao Chen and Chenghua Guo and Guixiang Ma and Ming Zeng and Xi Zhang and Sihong Xie},
  journal= {arXiv preprint arXiv:2307.04024},
  year   = {2023}
}

Comments

Accepted to IMLH (Interpretable ML in Healthcare) workshop at ICML 2023. arXiv admin note: substantial text overlap with arXiv:2212.14106

R2 v1 2026-06-28T11:25:11.445Z