HiLRP alone preserves conservation across windowed, spatial-reduction, multi-axis, and linear-attention models, where naive extensions can produce zero or inflated relevance, and localizes attribution failures in class activation mapping.
Abstract
Vision Transformer (ViT) design has become increasingly diverse, with backbones combining convolutional stems, windowed, linear, or multi-axis attention, patch merging, and spatial reduction in various configurations. This diversity poses challenges for existing attribution methods, whose assumptions often do not hold across ViT variants: Grad-CAM requires a terminal spatial feature map, attention rollout assumes global softmax attention, and layer-wise relevance propagation (LRP) requires module-specific rules. To the best of our knowledge, no existing method provides a unified attribution framework across this architectural space. We show that this architectural diversity can be captured by a simpler underlying structure. The attention and resolution-reduction operators in current ViTs can be decomposed into four operation types: linear maps, bilinear mixing, normalization or gating, and reindexing. Each operation admits a relevance rule that satisfies conservation. Based on these rules, HiLRP supports new backbones by construction rather than by architecture-specific derivation, and its attribution maps decompose the prediction rather than relying on heuristic assumptions. We prove conservation and conditional equivariance and verify both to machine precision. Across 14 attribution methods and 10 architectures, we find that no prior method remains reliable across ViT families, while Faithfulness Correlation becomes uninformative for backbones robust to spatial masking. HiLRP alone preserves conservation across windowed, spatial-reduction, multi-axis, and linear-attention models, where naive extensions can produce zero or inflated relevance. It also localizes attribution failures in class activation mapping, achieving 0.97 Pointing compared with 0.55 for competing methods on EfficientViT.
While Mamba-based models have shown strong potential for long sequence modeling, adapting them to vision is challenging due to the requirement of local neighborhood correlations and multi-directional spatial contexts for visual understanding. In this paper, we present LiAuto-MindViT, a novel hybrid vision backbone that...
Residual-aware Layer-wise Relevance Propagation (ResLRP) is introduced, a simple extension of LRP whose propagation rules explicitly account for cancellations in residual branches, are exactly conservative, and provably bound relevance explosion.
Jim Berend, Reduan Achtibat, Daniel Schäffer et al.· 0 citations
CoViT consistently achieves stable performance gains of over 2 AP points across multiple instance-level perception tasks by using ViT as backbone architecture, demonstrating that a pure ViT can learn instance-aware representations via inherent attention priors and targeted contrastive constraints.
This work proposes a task-specific pruning pipeline, named Cut-ViT, which first construct gram anchoring matrices from both spatial and semantic perspectives, and performs the subspace decomposition to extract the corresponding subspace bases.
Jianjian Yin, Liulei Li, Tao Chen et al.· 1 citation
Extensive experiments demonstrate that SiConMo achieves a state-of-the-art accuracy-efficiency trade-off among lightweight semantic segmentation models, highlighting simplicity as a powerful design principle.
Mian Muhammad Naeem Abid, Nancy Mehta, Zong-Wei Wu et al.· International Conference on...· 0 citations
Learning reliable two-view correspondences is essential for geometric computer vision applications. Existing graph-based pruning methods typically aggregate information unidirectionally, capturing only whether a correspondence receives neighborhood support while ignoring its structural contribution during aggregation....
Le-Yi Wang, Hao Chen, Chang-Cai Yang· Proceedings of the Thirty-Fi...· 0 citations
Known for his clear and elegant writing style, Bertsekas shaped fields from control and optimization to large-scale computation and artificial intelligence.