On the explainable properties of 1-Lipschitz Neural Networks: An Optimal Transport Perspective
Not on the map. Why?
Abstract (arXiv)
Input gradients have a pivotal role in a variety of applications, including adversarial attack algorithms for evaluating model robustness, explainable AI techniques for generating Saliency Maps, and counterfactual explanations.However, Saliency Maps generated by traditional neural networks are often noisy and provide limited insights. In this paper, we demonstrate that, on the contrary, the Saliency Maps of 1-Lipschitz neural networks, learned with the dual loss of an optimal transportation problem, exhibit desirable XAI properties:They are highly concentrated on the essential parts of the image with low noise, significantly outperforming state-of-the-art explanation approaches across various models and metrics. We also prove that these maps align unprecedentedly well with human explanations on ImageNet.To explain the particularly beneficial properties of the Saliency Map for such models, we prove this gradient encodes both the direction of the transportation plan and the direction towards the nearest adversarial attack. Following the gradient down to the decision boundary is no longer considered an adversarial attack, but rather a counterfactual explanation that explicitly transports the input from one class to another. Thus, Learning with such a loss jointly optimizes the classification objective and the alignment of the gradient, i.e. the Saliency Map, to the transportation plan direction.These networks were previously known to be certifiably robust by design, and we demonstrate that they scale well for large problems and models, and are tailored for explainability using a fast and straightforward method.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 54 of its 71 references that are in the map. First posted on arXiv 14 Jun 2022.
Builds on
54 of 71 references.
References · 54
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,733
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2014Deep Learning Face Attributes in the Wildcited by 3,693
- 2017Axiomatic Attribution for Deep Networkscited by 3,384
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,998
- 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,371
- 2017Improved Training of Wasserstein GANscited by 2,235
- 2020Shortcut Learning in Deep Neural Networkscited by 1,969
- 2018Spectral Normalization for Generative Adversarial Networkscited by 1,636
38 more
- 2018Sanity Checks for Saliency Mapscited by 1,156
- 2017SmoothGrad: removing noise by adding noisecited by 1,109
- 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,089
- 2018Robustness May Be at Odds with Accuracycited by 880
- 2018RISE: Randomized Input Sampling for Explanation of Black-box Modelscited by 838
- 2018Computational Optimal Transportcited by 780
- 2016Weight Normalization: A Simple Reparameterization to Accelerate Training of Deep Neural Networkscited by 543
- 2017Interpretation of Neural Networks is Fragilecited by 444
- 2017The (Un)reliability of saliency methodscited by 333
- 2019Counterfactual Visual Explanationscited by 313
- 2019On the (In)fidelity and Sensitivity for Explanationscited by 310
- 2020Algorithmic Recourse: from Counterfactual Explanations to Interventionscited by 250
- 2018Sorting out Lipschitz function approximationcited by 213
- 2020Evaluating and Aggregating Feature-based Model Explanationscited by 188
- 2017Formal Guarantees on the Robustness of a Classifier against Adversarial Manipulationcited by 185
- 2019Sanity Checks for Saliency Metricscited by 119
- 2016Robust Large Margin Deep Neural Networkscited by 118
- 2019Fooling Neural Network Interpretations via Adversarial Model Manipulationcited by 112
- 2016Multifaceted Feature Visualization: Uncovering the Different Types of Features Learned By Each Neuron in Deep Neural Networkscited by 106
- 2021Orthogonalizing Convolutional Layers with the Cayley Transformcited by 105
- 2019When Explanations Lie: Why Many Modified BP Attributions Failcited by 92
- 2019Preventing Gradient Attenuation in Lipschitz Constrained Convolutional Networkscited by 87
- 2021The Out-of-Distribution Problem in Explainability and Search Methods for Feature Importance Explanationscited by 87
- 2019On the Connection Between Adversarial Robustness and Saliency Map Interpretabilitycited by 80
- 2021Look at the Variance! Efficient Black-box Explanations with Sobol-based Sensitivity Analysiscited by 65
- 2021Beyond Trivial Counterfactual Explanations with Diverse Valuable Explanationscited by 56
- 2017Towards better understanding of gradient-based attribution methods for Deep Neural Networkscited by 54
- 2020SCOUT: Self-aware Discriminant Counterfactual Explanationscited by 52
- 2021Do Input Gradients Highlight Discriminative Features?cited by 52
- 2020Evaluations and Methods for Explanation through Robustness Analysiscited by 51
- 2020Proper Network Interpretability Helps Adversarial Robustness in Classificationcited by 41
- 2021STEEX: Steering Counterfactual Explanations with Semanticscited by 40
- 2022Don't Lie to Me! Robust and Efficient Explainability with Verified Perturbation Analysiscited by 38
- 2019Do Explanations Reflect Decisions? A Machine-centric Strategy to Quantify the Performance of Explainability Algorithmscited by 32
- 2021On Baselines for Local Feature Attributionscited by 29
- 2020Achieving robustness in classification using optimal transport with hinge regularizationcited by 27
- 2020How Good is your Explanation? Algorithmic Stability Measures to Assess the Quality of Explanations for Deep Neural Networkscited by 27
- 2021Transport-based Counterfactual Modelscited by 27
50 most cited of 54 All 54 (JSON)
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 4; 2026: 1.
6 papers.
- 2025An Adaptive Orthogonal Convolution Scheme for Efficient and Flexible CNN Architecturescited by 8
- 2022Universal Neural Optimal Transportcited by 6
- 2025Efficient Robust Conformal Prediction via Lipschitz-Bounded Networkscited by 4
- 2025Wasserstein Distances Made Explainable: Insights Into Dataset Shifts and Transport Phenomenacited by 2
- 2025Informative Post-Hoc Explanations Only Exist for Simple Functionscited by 2
- 2026Mutual Equilibrium: Multimodal Representation Learning through Reciprocal Feedbackcited by 0
- 2026Mutual Equilibrium: Multimodal Representation Learning through Reciprocal Feedback30 Sep 2026
- 2025Informative Post-Hoc Explanations Only Exist for Simple Functions15 Aug 2025
- 2025Efficient Robust Conformal Prediction via Lipschitz-Bounded Networks5 Jun 2025
- 2025Wasserstein Distances Made Explainable: Insights Into Dataset Shifts and Transport Phenomena9 May 2025
- 2025An Adaptive Orthogonal Convolution Scheme for Efficient and Flexible CNN Architectures14 Jan 2025
- 2022Universal Neural Optimal Transport30 Nov 2022