HEART-VIT: Hessian-Guided Efficient Dynamic Attention and Token Pruning in Vision Transformer
On the map: Efficient LLM inference and serving → Token pruning and merging for ViTs
Abstract (arXiv)
Vision Transformers (ViTs) deliver state-of-the-art accuracy but their quadratic attention cost and redundant computations severely hinder deployment on latency and resource-constrained platforms. Existing pruning approaches treat either tokens or heads in isolation, relying on heuristics or first-order signals, which often sacrifice accuracy or fail to generalize across inputs. We introduce HEART-ViT, a Hessian-guided efficient dynamic attention and token pruning framework for vision transformers, which to the best of our knowledge is the first unified, second-order, input-adaptive framework for ViT optimization. HEART-ViT estimates curvature-weighted sensitivities of both tokens and attention heads using efficient Hessian-vector products, enabling principled pruning decisions under explicit loss budgets.This dual-view sensitivity reveals an important structural insight: token pruning dominates computational savings, while head pruning provides fine-grained redundancy removal, and their combination achieves a superior trade-off. On ImageNet-100 and ImageNet-1K with ViT-B/16 and DeiT-B/16, HEART-ViT achieves up to 49.4 percent FLOPs reduction, 36 percent lower latency, and 46 percent higher throughput, while consistently matching or even surpassing baseline accuracy after fine-tuning, for example 4.7 percent recovery at 40 percent token pruning. Beyond theoretical benchmarks, we deploy HEART-ViT on different edge devices such as AGX Orin, demonstrating that our reductions in FLOPs and latency translate directly into real-world gains in inference speed and energy efficiency. HEART-ViT bridges the gap between theory and practice, delivering the first unified, curvature-driven pruning framework that is both accuracy-preserving and edge-efficient.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Placed in Token pruning and merging for ViTs, one of 12 directions in Efficient LLM inference and serving. Builds on 22 of its 32 references that are in the map. First posted on arXiv 23 Dec 2025.
Builds on
22 of 32 references.
Closest ancestors · 2
Same direction, newest first
- 2022Token Merging: Your ViT But Faster17 Oct
- 2021SPViT: Enabling Faster Vision Transformers via Soft Token Pruning27 Dec
Other references · 20
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
- 2021Tokens-to-Token ViT: Training Vision Transformers from Scratch on ImageNetcited by 1,101
- 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 864
- 2019Are Sixteen Heads Really Better than One?cited by 816
- 2021CrossViT: Cross-Attention Multi-Scale Vision Transformer for Image Classificationcited by 806
- 2021Transformer in Transformercited by 633
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
- 2021AdaViT: Adaptive Tokens for Efficient Vision Transformercited by 362
- 2017Variational Dropout Sparsifies Deep Neural Networkscited by 265
- 2021All Tokens Matter: Token Labeling for Training Better Vision Transformerscited by 144
8 more
- 2021Global Vision Transformer Pruning with Hessian-Aware Saliencycited by 70
- 2024LazyLLM: Dynamic Token Pruning for Efficient Long Context LLM Inferencecited by 70
- 2016Pruning Convolutional Neural Networks for Resource Efficient Inferencecited by 48
- 2020WoodFisher: Efficient Second-Order Approximation for Neural Network Compressioncited by 21
- 2024Preserving Deep Representations In One-Shot Pruning: A Hessian-Free Second-Order Optimization Frameworkcited by 11
- 2025Saliency-driven Dynamic Token Pruning for Large Language Modelscited by 5
- 2023Sparse then Prune: Toward Efficient Vision Transformerscited by 4
- 2024Automatic Channel Pruning for Multi-Head Attentioncited by 3
Built on by
Citing papers per year: 2026: 3.
3 papers.
Similar, not cited
Close in wording, no citation either way
- 2023PPT: Token Pruning and Pooling for Efficient Vision Transformers
- 2026ToaSt: Token Channel Selection and Structured Pruning for Efficient ViT
- 2026Scaling Vision Transformers Without Training: Prune-and-Merge Token Compression
- 2025Similarity-Aware Token Pruning: Your VLM but Faster
- 2026ASAP: Attention Sink Anchored Pruning
- 2021Evo-ViT: Slow-Fast Token Evolution for Dynamic Vision Transformer
- 2022Adaptive Sparse ViT: Towards Learnable Adaptive Token Pruning by Fully Exploiting Self-Attention
- 2026ViT-5: Vision Transformers for The Mid-2020s