paper-with-me

홈 › Papers

Don't Lie to Me! Robust and Efficient Explainability with Verified Perturbation Analysis

2022-02-15 · CVPR 2023 1 · Thomas Fel, Melanie Ducoffe, David Vigouroux, Remi Cadene, Mikael Capelle, Claire Nicodeme, Thomas Serre

A variety of methods have been proposed to try to explain how deep neural networks make their decisions. Key to those approaches is the need to sample the pixel space efficiently in order to derive importance maps. However, it has been shown that the sampling methods used to date introduce biases and other artifacts, leading to inaccurate estimates of the importance of individual pixels and severely limit the reliability of current explainability methods. Unfortunately, the alternative -- to exhaustively sample the image space is computationally prohibitive. In this paper, we introduce EVA (Explaining using Verified perturbation Analysis) -- the first explainability method guarantee to have an exhaustive exploration of a perturbation space. Specifically, we leverage the beneficial properties of verified perturbation analysis -- time efficiency, tractability and guaranteed complete coverage of a manifold -- to efficiently characterize the input variables that are most likely to drive the model decision. We evaluate the approach systematically and demonstrate state-of-the-art results on multiple benchmarks.

📄 PDF Abstract BibTeX arXiv:2202.07728

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

GPO-VAE: Modeling Explainable Gene Perturbation Responses utilizing GRN-Aligned Parameter Optimization

2025-01-31 · Seungheun Baek, Soyon Park, Yan Ting Chok, Mogan Gim 외

Motivation: Predicting cellular responses to genetic perturbations is essential for understanding biological systems and developing targeted therapeutic strategies. While variational autoencoders (VAEs) have shown promis…

VeriX: Towards Verified Explainability of Deep Neural Networks

2022-12-02 · NeurIPS 2023 11

We present VeriX (Verified eXplainability), a system for producing optimal robust explanations and generating counterfactuals along decision boundaries of machine learning models. We build such explanations and counterfa…

Sensitivity

Comparing Post-Hoc Explainable AI Methods for Interpreting Black-Box EEG Models in Depression Detection

2026-05-27 · Antonia Šarčević, Nikolina Frid arxiv

Recent advances in deep learning have enabled increasingly accurate electroencephalography (EEG)-based classification of Major Depressive Disorder (MDD), but the decision-making processes of high-capacity models remain d…

Feature Importance

GNNX-BENCH: Unravelling the Utility of Perturbation-based GNN Explainers through In-depth Benchmarking

2023-10-03 · Mert Kosan, Samidha Verma, Burouj Armgaan, Khushbu Pahwa 외

Numerous explainability methods have been proposed to shed light on the inner workings of GNNs. Despite the inclusion of empirical evaluations in all the proposed algorithms, the interrogative aspects of these evaluation…

Benchmarkingcounterfactual

Scalable Verified Training for Provably Robust Image Classification

2019-10-01 · ICCV 2019 10 · Sven Gowal, Krishnamurthy (Dj) Dvijotham, Robert Stanforth, Rudy Bunel 외

Recent work has shown that it is possible to train deep neural networks that are provably robust to norm-bounded adversarial perturbations. Most of these methods are based on minimizing an upper bound on the worst-case l…

ClassificationGeneral Classificationimage-classificationImage Classification