PaCa-ViT: Learning Patch-to-Cluster Attention in Vision Transformers

TL;DR

This paper introduces PaCa-ViT, a novel vision transformer that learns patch-to-cluster attention, reducing complexity and improving interpretability and performance across multiple vision tasks.

Contribution

It proposes a patch-to-cluster attention mechanism that replaces patch-to-patch attention, enabling linear complexity and better interpretability in Vision Transformers.

Findings

Outperforms prior models on ImageNet-1k, MS-COCO, and MIT-ADE20k benchmarks.

Achieves significant efficiency gains with linear complexity.

Produces semantically meaningful learned clusters.

Abstract

Vision Transformers (ViTs) are built on the assumption of treating image patches as ``visual tokens" and learn patch-to-patch attention. The patch embedding based tokenizer has a semantic gap with respect to its counterpart, the textual tokenizer. The patch-to-patch attention suffers from the quadratic complexity issue, and also makes it non-trivial to explain learned ViTs. To address these issues in ViT, this paper proposes to learn Patch-to-Cluster attention (PaCa) in ViT. Queries in our PaCa-ViT starts with patches, while keys and values are directly based on clustering (with a predefined small number of clusters). The clusters are learned end-to-end, leading to better tokenizers and inducing joint clustering-for-attention and attention-for-clustering for better and interpretable models. The quadratic complexity is relaxed to linear complexity. The proposed PaCa module is used in designing efficient and interpretable ViT backbones and semantic segmentation head networks. In experiments, the proposed methods are tested on ImageNet-1k image classification, MS-COCO object detection and instance segmentation and MIT-ADE20k semantic segmentation. Compared with the prior art, it obtains better performance in all the three benchmarks than the SWin and the PVTs by significant margins in ImageNet-1k and MIT-ADE20k. It is also significantly more efficient than PVT models in MS-COCO and MIT-ADE20k due to the linear complexity. The learned clusters are semantically meaningful. Code and model checkpoints are available at https://github.com/iVMCL/PaCaViT.