atlas

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

Less is More: Fewer Interpretable Region via Submodular Subset Selection

ICLR 2024 · Label-efficient and robust learning › Recognition and long-tail · approach: Feature attribution methods · 1 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.

Reformulates image attribution as submodular subset selection over masked image sub-regions, scoring subsets by confidence, effectiveness, consistency, and collaboration terms, and greedily selecting regions to improve Deletion/Insertion faithfulness and explain misclassifications.

Problem

Existing image attribution methods produce small regions that are not dense enough and fail to explain samples the model predicts incorrectly (the attribution does not suppress the wrong-class response).

Approach

Treats attribution as maximizing a monotone submodular set function over sub-regions built from a prior saliency map, combining four scores (EDL-based confidence, feature-distance effectiveness, cosine consistency with target feature, and collaboration/leave-out effect), and selects regions greedily with a (1-1/e) guarantee.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Apply submodular subset selection to HSIC-AttributionHSIC-Attribution · Celeb-A validationDeletion AUC: 0.1151 -> 0.1054Helped
Apply submodular subset selection to HSIC-AttributionHSIC-Attribution · Celeb-A validationInsertion AUC: 0.5692 -> 0.5752Helped
Apply submodular subset selection to HSIC-AttributionHSIC-Attribution · VGG-Face2 validationInsertion AUC: 0.6694 -> 0.6705Helped
Apply submodular subset selection to HSIC-AttributionHSIC-Attribution · CUB-200-2011 validationInsertion AUC: 0.6843 -> 0.7262Helped
Apply submodular subset selection to HSIC-AttributionHSIC-Attribution · CUB-200-2011 validation, misclassified samplesAverage highest confidence, 0-100% search: 0.2493 -> 0.4513Helped
Apply submodular subset selection to HSIC-AttributionHSIC-Attribution · CUB-200-2011 validation, misclassified samplesInsertion AUC: 0.1446 -> 0.1772Helped
Add confidence score (ablation)Full submodular attribution function · CUB-200-2011 validationDeletion AUC: 0.0811 -> 0.0613Helped
Add effectiveness score (ablation)Full submodular attribution function · Celeb-A validationDeletion AUC: 0.1067 -> 0.1054Helped
Add consistency score (ablation)Full submodular attribution function · CUB-200-2011 validationDeletion AUC: 0.0811 -> 0.0613Helped
Add collaboration score (ablation)Full submodular attribution function · CUB-200-2011 validationDeletion AUC: 0.0651 -> 0.0613Helped
Use HSIC-Attribution saliency map as a prior instead of plain patches (ablation)Sub-region division · Celeb-A validationDeletion AUC: 0.1284 -> 0.1054Helped
Increase confidence-score weight to 20 (ablation)Full submodular attribution function · CUB-200-2011 validationInsertion AUC: 0.7262 -> 0.5979Hurt

Surprising findings

Limitations

Experimental setup

Datasets: Celeb-A VGG-Face2 CUB-200-2011

Benchmarks: Celeb-A VGG-Face2 CUB-200-2011

Metrics: Deletion AUC Insertion AUC average highest confidence

Baselines: Saliency Grad-CAM Grad-CAM++ Score-CAM LIME Kernel Shap RISE HSIC-Attribution

Builds on: HSIC-Attribution RISE evidential deep learning submodular greedy maximization (Nemhauser et al.)

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