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.
Abstract
Pruning visual foundation models has attracted considerable attention. However, existing methods focus on rigid point-to-point token alignment on a single dataset for pruning, suffering from two limitations: i) robustness degradation, and ii) task-specificity deficiency. To address these limitations, we propose a task-specific pruning pipeline, named Cut-ViT. Specifically, we first construct gram anchoring matrices from both spatial and semantic perspectives, and perform the subspace decomposition to extract the corresponding subspace bases. Basis-agnostic and residual constraints are then adopted to align the gram subspaces between the native and pruned DINOv3 models along spatial and channel dimensions, enabling subnetworks to inherit robust feature representations of native DINOv3. Furthermore, we design spectral entropy adaptation, which quantifies the information density of feature manifolds along spatial and channel dimensions, thereby adapting the pruning objective to specific downstream tasks. Experiments show that Cut-ViT requires approximately one minute on a single A100 GPU to obtain subnetworks at various sparsity levels, using only 20.9% of the time and 45.5% of the GPU memory compared with previous methods, while achieving SOTA performance on six tasks across nine datasets.
TASSO, a new paradigm that efficiently preserves the latent space geometry while ensuring network plasticity, is introduced with two complementary techniques: subspace learning and geometry-aware knowledge distillation.
Chang-Ming Sun, Francesco Barbato, Matteo Caligiuri et al.· 0 citations
Constraint-Aligned Subspace Transformation (CAST), a novel framework that restricts metric adaptation to a low dimensional subspace strictly induced by pairwise constraints, is proposed, and an implicit update formulation that enables distance evaluation in O (r) time, effectively reducing memory complexity to O (nr).
Fei Wang, Le Li, P. Fränti· Proceedings of the 32nd ACM...· 0 citations
Structural Parameter-free Affinity Regularization (SPARE), a regularizer that matches the pairwise affinities of intermediate tokens to those of the clean latents across images, is proposed, a regularizer that attains the lowest FID among parameter-free regularizers in every tested setting.
Zong-Wei Hong, Jinglun Li, Shen Zhang et al.· 1 citation
SnapViT: single-shot network approximation for pruned Vision Transformers is introduced, a new post-pretraining structured pruning method that enables elastic inference across a continuum of compute budgets, and a self-supervised importance scoring mechanism that maintains strong performance without requiring retrainin...
Walter Simoncini, Michael Dorkenwald, Tijmen Blankevoort et al.· 0 citations
This work proposes a saliency-driven distillation framework that constructs class-discriminative latent prototypes to enhance representativeness and generalization and demonstrates consistent performance improvements over strong baselines.
Yawen Zou, Wenqi Cai, Guang Li et al.· arXiv.org· 0 citations
This work introduces Orthonormal Prototype Alignment Learning (OPAL), a single-stage, end-to-end framework that simplifies interpretable classification by framing classification as a direct representation alignment task, and eliminates the need for auxiliary losses.
I. Carretero, G. Angulo, R. del Amor et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.