atlas

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

Unlearning-based Neural Interpretations

ICLR 2025 · Label-efficient and robust learning › Recognition and long-tail · approach: Self-explaining and visual explanation networks · 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 UNI, which computes a learned, unlearning-based baseline for path-attribution (e.g., Integrated Gradients) by unlearning salient features in model space and matching activations in input space, yielding more faithful, robust attributions than static baselines.

Problem

Gradient-based path attribution methods such as Integrated Gradients depend on a baseline input representing absence of features; static baselines (black, blurred, noised) inject colour, texture and frequency biases and high-curvature paths make attributions noisy and fragile.

Approach

Replace static baselines with an adaptive baseline found by first-order unlearning of the model (ascent in loss along a steepest-ascent direction in weight space), then optimising a perturbation of the input so its class confidence matches the unlearned model's confidence on the original input; the resulting baseline defines a monotonic, low-curvature path for path attribution.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use UNI instead of the strongest listed baselineImageNet-1K attribution on ResNet-18 · ImageNet-1KMuFidelity: .10 -> .12Helped
Use UNI instead of the strongest listed baselineImageNet-1K attribution on EfficientNet-v2-small · ImageNet-1KMuFidelity: .06 ± .045 vs .06 ± .046No clear effect
Use UNI instead of GIGImageNet-1K attribution on ConvNeXt-Tiny · ImageNet-1KMuFidelity: .18 -> .16Hurt
Use UNI instead of the strongest listed baselineImageNet-1K attribution on VGG-16-bn · ImageNet-1KMuFidelity: .14 -> .18Helped
Use UNI instead of the strongest listed baselineImageNet-1K attribution on ViT-B-16 · ImageNet-1KMuFidelity: .14 -> .15Helped
Use UNI instead of the strongest listed baselineImageNet-1K attribution on Swin-T-Tiny · ImageNet-1KMuFidelity: .13 ± .102 vs .13 ± .100No clear effect
Use UNI instead of the strongest listed baselineImageNet-1K attribution across backbones · ImageNet-1KDeletion AUC: .06 vs .08; .19 vs .18; .11 vs .17; .08 vs .10; .14 vs .13; .13 vs .22Mixed
Use UNI instead of the strongest listed baselineImageNet-1K attribution across backbones · ImageNet-1KInsertion AUC: .56 -> .64; .51 -> .64; .56 -> .63; .47 -> .56; .59 -> .71; .63 -> .68Helped
Use UNI instead of IGImageNet attribution robustness across backbones · ImageNet-1KSpearman correlation under FGSM: .088 -> .271; .009 -> .302; .010 -> .292; .143 -> .290; .018 -> .319; .088 -> .271Helped
Use UNI instead of Random baselinePythia-1b-v0 attribution patching · 100 counterfactual promptsL2 distance to activation patching: 6.64 -> 3.12Helped
Use UNI instead of Random baselineGPT2-medium attribution patching · 100 counterfactual promptsL2 distance to activation patching: 35.00 -> 15.26Helped
Use UNI instead of Random baselineLlama-3.2-1B attribution patching · 100 counterfactual promptsL2 distance to activation patching: 10.17 -> 5.25Helped

Surprising findings

Limitations

Experimental setup

Datasets: ImageNet-1K ImageNet-C

Benchmarks: ImageNet-1K ImageNet-C

Metrics: MuFidelity deletion AUC insertion AUC Spearman correlation top-1000 pixel intersection LPIPS L2 distance to activation patching

Baselines: Integrated Gradients BlurIG GIG AGI GBP DeepLIFT Simple Gradients

Builds on: Integrated Gradients DeepLIFT BlurIG Expected Gradients activation patching

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