Quick ViTs: Speeding up Vision Transformers Through Equivariance
Paper i proceeding, 2026

Natural images exhibit strong geometric regularities: local structures, such as edges, corners, and textures, appear in many orientations and mirror configurations. Since Vision Transformers (ViTs) operate on square image patches, these transformations naturally correspond to the dihedral symmetry group D8, also known as the octic group. Recent work has shown that ViTs can be made reflection equivariant and more efficient than standard ViTs simultaneously by implementing the linear layers in the Fourier domain of the reflection group. In this work, we extend the equivariance to reflections and rotations and analyze the scalability of the resulting networks. Our Quick ViTs, based on octic equivariant linear layers, achieve 5.33x reductions in FLOPs and up to 8x reductions in memory compared to ordinary linear layers. By analyzing the arithmetic intensity of these layers, we identify theoretical limits on how much the FLOP savings translate into throughput improvements on modern GPUs. However, these limitations disappear as the embedding dimensions increase. Enabled by their computational efficiency, we conduct a broader empirical evaluation of equivariant ViTs than in previous work. Upon training supervised (DeiT-III) and self-supervised (DINOv2) on ImageNet-1K, we find that our Quick ViTs match or exceed baseline accuracy while at the same time providing substantial efficiency gains.

Equivariance

Vision Transformer

Efficiency

Författare

David Nordström

Chalmers, Elektroteknik, Signalbehandling och medicinsk teknik

Johan Edstedt

Linköpings universitet

Fredrik Kahl

Chalmers, Elektroteknik, Signalbehandling och medicinsk teknik

Georg Bokman

Universiteit Van Amsterdam

Lecture Notes in Computer Science

0302-9743 (ISSN) 1611-3349 (eISSN)

Vol. 17012 579-597
9783032370433 (ISBN)

19th European Conference on Computer Vision, ECCV 2026
Malmö, Sweden,

Ämneskategorier (SSIF 2025)

Datavetenskap (datalogi)

DOI

10.1007/978-3-032-37044-0_32

Mer information

Senast uppdaterat

2026-10-09