Cited by 21Explainable Artificial Intelligence (XAI)Software Testing and Debugging TechniquesAdversarial Robustness in Machine Learning

The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.

Shortcomings of Top-Down Randomization-Based Sanity Checks for Evaluations of Deep Neural Network Explanations

Open access
Binder, Alexander, Weber, Leander, Lapuschkin, Sebastian, Montavon, Grégoire, Müller, Klaus-Robert, Samek, Wojciech·2023·2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)

Abstract

While the evaluation of explanations is an important step towards trustworthy models, it needs to be done carefully, and the employed metrics need to be well-understood. Specifically model randomization testing can be overinterpreted if regarded as a primary criterion for selecting or discarding explanation methods. To address shortcomings of this test, we start by observing an experimental gap in the ranking of explanation methods between randomization-based sanity checks [1] and model output faithfulness measures (e.g. [20]). We identify limitations of model-randomization-based sanity checks for the purpose of evaluating explanations. Firstly, we show that uninformative attribution maps created with zero pixel-wise covariance easily achieve high scores in this type of checks. Secondly, we show that top-down model randomization preserves scales of forward pass activations with high probability. That is, channels with large activations have a high probility to contribute strongly to the output, even after randomization of the network on top of them. Hence, explanations after randomization can only be expected to differ to a certain extent. This explains the observed experimental gap. In summary, these results demonstrate the inadequacy of model-randomization-based sanity checks as a criterion to rank attribution methods.

Overview

Integrity signals

Registry

Crossref · 10.1109/cvpr52729.2023.01549

Cites

25 of 25 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 5

  1. adebayo, 2018, Sanity checks for saliency maps, Advances in neural information processing systems, 31, 9525
  2. nilsson, 2020, Understanding ssim, ArXiv Preprint, 13846
  3. nguyen, 2020, On quantitative aspects of model interpretability, ArXiv Preprint
  4. smilkov, 2017, Smoothgrad: removing noise by adding noise, ArXiv Preprint
  5. balduzzi, 2017, The shattered gradients problem: If resnets are the answer, then what is the question?, International Conference on Machine Learning (ICML), 70, 342

Cited by

Sorted by citations

Metadata

Authors
Binder, A., Weber, L., Lapuschkin, S., Montavon, G., Müller, K.-R., & Samek, W.
Affiliations
  • Singapore University of Technology and Design (SG)
  • Fraunhofer Institute for Telecommunications, Heinrich Hertz Institute (DE)
  • Berlin Institute for the Foundations of Learning and Data (DE)
  • Korea University (KR)
Venue
2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)
Publisher
IEEE
Published
2023-06
Pages
16143-16152
ISSN
1063-6919 (ISSN-L)
OpenAlex
W4386076467
Cited by
21
References
25
Citations by year
2026: 2 · 2025: 8 · 2024: 7 · 2023: 4
FWCI
3.73
Type
conference paper
Language
en
Open access
Locations
  • IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Figshare (submittedVersion, cc-by-nc-nd)
  • Fraunhofer-Publica (Fraunhofer-Gesellschaft) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • European Commission (965221)
  • Science Foundation Ireland
  • Bundesministerium für Bildung und Forschung (01 IS 14013 A, Patho234, 01IS14013A-E, 01GQ0850, 01IS18037A, 01GQ1115, 01IS18025A, 01IS18037I, 031L0207C)
  • Korea University (2019-0-00079, 2022-0-00984)
  • Norges Forskningsråd (309439)
  • Ministry of Science and ICT, South Korea (2022-0- 00984, 01GQ1115, 01GQ0850, 01IS18037A, 01IS18025A, 2019-0-00079)
  • Institute for Information and Communications Technology Promotion (2019–0–00079, 2022-, 2022-0-00984)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)
  • Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
Keywords
explainable AI, explanation evaluation, sanity checks, attribution maps

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review