CVAILGMar 24, 2023

Sparsifiner: Learning Sparse Instance-Dependent Attention for Efficient Vision Transformers

arXiv:2303.13755v128 citationsh-index: 56
Originality Highly original
AI Analysis

This addresses efficiency issues in Vision Transformers for computer vision applications, offering a novel approach to sparsity that improves upon fixed-pattern methods.

The paper tackles the high computational cost of Vision Transformers by proposing Sparsifiner, a method that learns sparse, instance-dependent attention patterns to reduce FLOPs in multi-head self-attention operations. It achieves a 48% to 69% reduction in FLOPs with an accuracy drop within 0.4% on ImageNet, and combining with token sparsity reduces FLOPs by over 60%.

Vision Transformers (ViT) have shown their competitive advantages performance-wise compared to convolutional neural networks (CNNs) though they often come with high computational costs. To this end, previous methods explore different attention patterns by limiting a fixed number of spatially nearby tokens to accelerate the ViT's multi-head self-attention (MHSA) operations. However, such structured attention patterns limit the token-to-token connections to their spatial relevance, which disregards learned semantic connections from a full attention mask. In this work, we propose a novel approach to learn instance-dependent attention patterns, by devising a lightweight connectivity predictor module to estimate the connectivity score of each pair of tokens. Intuitively, two tokens have high connectivity scores if the features are considered relevant either spatially or semantically. As each token only attends to a small number of other tokens, the binarized connectivity masks are often very sparse by nature and therefore provide the opportunity to accelerate the network via sparse computations. Equipped with the learned unstructured attention pattern, sparse attention ViT (Sparsifiner) produces a superior Pareto-optimal trade-off between FLOPs and top-1 accuracy on ImageNet compared to token sparsity. Our method reduces 48% to 69% FLOPs of MHSA while the accuracy drop is within 0.4%. We also show that combining attention and token sparsity reduces ViT FLOPs by over 60%.

Code Implementations1 repo
Foundations

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

Your Notes