REVIEW 2 cited by
Robust Models Are More Interpretable Because Attributions Look Normal
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Recent work has found that adversarially-robust deep networks used for image classification are more interpretable: their feature attributions tend to be sharper, and are more concentrated on the objects associated with the image's ground-truth class. We show that smooth decision boundaries play an important role in this enhanced interpretability, as the model's input gradients around data points will more closely align with boundaries' normal vectors when they are smooth. Thus, because robust models have smoother boundaries, the results of gradient-based attribution methods, like Integrated Gradients and DeepLift, will capture more accurate information about nearby decision boundaries. This understanding of robust interpretability leads to our second contribution: \emph{boundary attributions}, which aggregate information about the normal vectors of local decision boundaries to explain a classification outcome. We show that by leveraging the key factors underpinning robust interpretability, boundary attributions produce sharper, more concentrated visual explanations -- even on non-robust models. Any example implementation can be found at \url{https://github.com/zifanw/boundary}.
Forward citations
Cited by 2 Pith papers
-
Attribution for Enhanced Explanation with Transferable Adversarial eXploration
Using transferable adversarial attacks like MIG and GRA inside AttEXplore raises insertion scores on ImageNet, but the best attack is chosen post hoc on the test set and deletion scores worsen.
-
ABE: A Unified Framework for Robust and Faithful Attribution-Based Explainability
ABE is a PyTorch framework that integrates attribution algorithms with adversarial robustness modules, but its central axiom-preservation proof rests on an unproven finite-step Taylor equality.
Discussion (0). Continue with ORCID to comment.