atlas

Research map / Label-efficient and robust learning / Recognition and long-tail

Provably Better Explanations with Optimized Aggregation of Feature Attributions

ICML 2024 · Label-efficient and robust learning › Recognition and long-tail · approach: Feature attribution methods · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes optimal convex aggregation of feature attributions across methods via a quadratic program over generalized L2 quality metrics (robustness and faithfulness), with provable improvement and generalization bounds.

Problem

Individual feature attribution methods are often unstable, hyperparameter-sensitive and unfaithful, and there is no principled way to combine different attributions to improve explanation quality.

Approach

Cast explanation quality metrics (Average-Sensitivity, Infidelity, and others) as generalized L2 metrics so that the quality of a convex combination of attributions becomes a quadratic form in the weights; solve a constrained QP for weights, with provable improvement over the weighted individual qualities and an O(1/sqrt(m)) generalization bound.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Optimize convex aggregation weights for Average-SensitivityGradient-based attribution methods · ImageNet-ILSVRC2012, VGG16; AlexNet; ResNet18; MobileNetV2; MLPMixerSENS_AVG: VGG16: 0.582 -> 0.424; AlexNet: 0.476 -> 0.349; ResNet18: 0.518 -> 0.410; MobileNetV2: 0.568 -> 0.505; MLPMixer: 0.631 -Helped
Optimize convex aggregation weights for InfidelityFeature attribution methods · ImageNet-ILSVRC2012, DenseNet121; ResNet18; MobileNetV2; DeiT; SwinTINFD: DenseNet121: 2.514 -> 2.390; ResNet18: 2.729 -> 2.595; MobileNetV2: 0.467 -> 0.443; DeiT: 0.339 -> 0.335; SwinT: 0.341 -Helped
Optimize aggregation jointly for Infidelity and Average-Sensitivity instead of optimizing faithfulness aloneFeature attribution methods · ImageNet-ILSVRC2012, DenseNet121INFD: 2.390 -> 2.514Hurt
Optimize aggregation weights for robustnessFeature attribution methods · ResNet18RIS: 9.47 -> 3.27Helped
Optimize aggregation weights for robustnessFeature attribution methods · ResNet18RRS: 6.08 -> 2.09Helped
Optimize aggregation weights for robustnessFeature attribution methods · ResNet18ROS: 10.28 -> 3.55Helped
Optimize aggregation weights for faithfulness using blurred-image perturbationsFeature attribution methods · ResNet18, alternative zero and image-mean corruptionsINFD: 3.21 -> 2.82 (INFD_0); 3.10 -> 2.78 (INFD_xbar)Helped
Optimize aggregation jointly for faithfulness and robustnessFeature attribution methods · ResNet18, zero corruptionFCOR_0: 0.44 -> 0.49Helped
Optimize aggregation weights for robustnessFeature attribution methods · ResNet18, ROAD MoRF_10, MoRF_20, and MoRF_30ROAD: -3.09 -> -3.36; -4.86 -> -5.48; -6.31 -> -7.17Helped
Optimize aggregation weights for faithfulnessFeature attribution methods · CIFAR10, BloodMNIST, DermaMNIST, and PathMNISTINFD: CIFAR10: 3.538 -> 3.342; BloodMNIST: 11.80 -> 10.66; DermaMNIST: 0.322 -> 0.281; PathMNIST: 5.135 -> 4.850Helped

Surprising findings

Limitations

Experimental setup

Datasets: ImageNet ILSVRC2012 CIFAR10 BloodMNIST DermaMNIST PathMNIST

Benchmarks: ImageNet ILSVRC2012 CIFAR10 BloodMNIST DermaMNIST PathMNIST

Metrics: Average-Sensitivity Max-Sensitivity Infidelity Faithfulness correlation RIS RRS ROS ROAD

Baselines: AGG_Mean AGG_Var SmoothGrad VarGrad Integrated Gradients GradCAM

Builds on: Average-Sensitivity Infidelity SmoothGrad error ambiguity decomposition

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy