CVMar 26

HeSS: Head Sensitivity Score for Sparsity Redistribution in VGGT

arXiv:2603.2533648.01 citationsh-index: 4Has Code
AI Analysis

This addresses computational scalability issues in 3D vision models for researchers and practitioners, though it appears incremental as it builds on existing sparsification methods.

The paper tackles the problem of accuracy degradation in sparsification-based acceleration techniques for Visual Geometry Grounded Transformers (VGGT) by proposing a two-stage pipeline that quantifies and exploits head-wise sparsification sensitivity using a novel Head Sensitivity Score (HeSS), demonstrating strong robustness across varying sparsity levels.

Visual Geometry Grounded Transformer (VGGT) has advanced 3D vision, yet its global attention layers suffer from quadratic computational costs that hinder scalability. Several sparsification-based acceleration techniques have been proposed to alleviate this issue, but they often suffer from substantial accuracy degradation. We hypothesize that the accuracy degradation stems from the heterogeneity in head-wise sparsification sensitivity, as the existing methods apply a uniform sparsity pattern across all heads. Motivated by this hypothesis, we present a two-stage sparsification pipeline that effectively quantifies and exploits headwise sparsification sensitivity. In the first stage, we measure head-wise sparsification sensitivity using a novel metric, the Head Sensitivity Score (HeSS), which approximates the Hessian with respect to two distinct error terms on a small calibration set. In the inference stage, we perform HeSS-Guided Sparsification, leveraging the pre-computed HeSS to reallocate the total attention budget-assigning denser attention to sensitive heads and sparser attention to more robust ones. We demonstrate that HeSS effectively captures head-wise sparsification sensitivity and empirically confirm that attention heads in the global attention layers exhibit heterogeneous sensitivity characteristics. Extensive experiments further show that our method effectively mitigates performance degradation under high sparsity, demonstrating strong robustness across varying sparsification levels. Code is available at https://github.com/libary753/HeSS.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes