paper-with-me

홈 › Papers

H-Sets: Hessian-Guided Discovery of Set-Level Feature Interactions in Image Classifiers

2026-04-23 · Ayushi Mehrotra, Dipkamal Bhusal, Michael Clifford, Nidhi Rastogi arxiv

Feature attribution methods explain the predictions of deep neural networks by assigning importance scores to individual input features. However, most existing methods focus solely on marginal effects, overlooking feature interactions, where groups of features jointly influence model output. Such interactions are especially important in image classification tasks, where semantic meaning often arises from pixel interdependencies rather than isolated features. Existing interaction-based methods for images are either coarse (e.g., superpixel-only) or, fail to satisfy core interpretability axioms. In this work, we introduce H-Sets, a novel two-stage framework for discovering and attributing higher-order feature interactions in image classifiers. First, we detect locally interacting pairs via input Hessians and recursively merge them into semantically coherent sets; segmentation from Segment Anything (SAM) is used as a spatial grouping prior but can be replaced by other segmentations. Second, we attribute each set with IDG-Vis, a set-level extension of Integrated Directional Gradients that integrates directional gradients along pixel-space paths and aggregates them with Harsanyi dividends. While Hessians introduce additional compute at the detection stage, this targeted cost consistently yields saliency maps that are sparser and more faithful. Evaluations across VGG, ResNet, DenseNet and MobileNet models on ImageNet and CUB datasets show that H-Sets generate more interpretable and faithful saliency maps compared to existing methods.

📄 PDF Abstract BibTeX arXiv:2604.22045

Code (0)

등록된 구현이 없습니다.

Tasks

Image Classification

Similar Papers 제목 키워드 기반

Diffusion Models for Causal Discovery via Topological Ordering

2022-10-12 · Pedro Sanchez, Xiao Liu, Alison Q O'Neil, Sotirios A. Tsaftaris

Discovering causal relations from observational data becomes possible with additional assumptions such as considering the functional relations to be constrained as nonlinear with additive noise (ANM). Even with strong as…

Causal Discovery

Object Discovery from Motion-Guided Tokens

2023-03-27 · CVPR 2023 1 · Zhipeng Bao, Pavel Tokmakov, Yu-Xiong Wang, Adrien Gaidon 외

Object discovery -- separating objects from the background without manual labels -- is a fundamental open challenge in computer vision. Previous methods struggle to go beyond clustering of low-level cues, whether handcra…

DecoderObjectObject DiscoveryQuantization+1

Fed-FA: Theoretically Modeling Client Data Divergence for Federated Language Backdoor Defense

2023-09-21 · NeurIPS 2023 11

Federated learning algorithms enable neural network models to be trained across multiple decentralized edge devices without sharing private data. However, they are susceptible to backdoor attacks launched by malicious cl…

Score-informed Neural Operator for Enhancing Ordering-based Causal Discovery

2025-08-18 · Jiyeon Kang, Songseong Kim, Chanhui Lee, Doyeong Hwang 외 arxiv

Ordering-based approaches to causal discovery identify topological orders of causal graphs, providing scalable alternatives to combinatorial search methods. Under the Additive Noise Model (ANM) assumption, recent causal …

Prompt Engineering

Achieving ${O}(ε^{-1.5})$ Complexity in Hessian/Jacobian-free Stochastic Bilevel Optimization

2023-12-06 · Yifan Yang, Peiyao Xiao, Kaiyi Ji

In this paper, we revisit the bilevel optimization problem, in which the upper-level objective function is generally nonconvex and the lower-level objective function is strongly convex. Although this type of problem has …

Bilevel Optimization