Discrete Cosine Transform Based Decorrelated Attention for Vision Transformers
Not on the map. Why?
Abstract (arXiv)
Self-attention is central to the success of Transformer architectures; however, learning the query, key, and value projections from random initialization remains challenging and computationally expensive. In this paper, we propose two complementary methods that leverage the Discrete Cosine Transform (DCT) to enhance the efficiency and performance of Vision Transformers. First, we address the initialization problem by introducing a simple yet effective DCT-based initialization strategy for self-attention, where projection weights are initialized using DCT coefficients. This structure-preserving approach consistently improves classification accuracy on the CIFAR-10 and ImageNet-1K benchmarks. Second, we propose a DCT-based attention compression technique that exploits the decorrelation properties of the frequency domain. By observing that high-frequency DCT coefficients typically correspond to noise, we truncate high-frequency components of the input patches, thereby reducing the dimensionality of the query, key, and value projections without sacrificing accuracy. Experiments on Swin Transformer models demonstrate that the proposed compression method achieves a substantial reduction in computational overhead while maintaining comparable performance.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 31 of its 50 references that are in the map. First posted on arXiv 22 May 2024.
Builds on
31 of 50 references.
References · 31
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2014Microsoft COCO: Common Objects in Contextcited by 17,608
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,884
- 2017Cascade R-CNN: Delving into High Quality Object Detectioncited by 1,276
- 2017Random Erasing Data Augmentationcited by 1,239
19 more
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 763
- 2018AutoAugment: Learning Augmentation Policies from Datacited by 730
- 2021MobileViT: Light-weight, General-purpose, and Mobile-friendly Vision Transformercited by 642
- 2021MetaFormer Is Actually What You Need for Visioncited by 524
- 2018Efficient Attention: Attention with Linear Complexitiescited by 368
- 2020Provable Benefit of Orthogonal Initialization in Optimizing Deep Linear Networkscited by 73
- 2019Improving Deep Transformer with Depth-Scaled Initialization and Merged Attentioncited by 59
- 2022Hydra Attention: Efficient Attention with Many Headscited by 55
- 2023Mimetic Initialization of Self-Attention Layerscited by 54
- 2023SpectFormer: Frequency and Attention is what you need in a Vision Transformercited by 48
- 2023Initializing Models with Larger Onescited by 39
- 2021ZerO Initialization: Initializing Neural Networks with only Zeros and Onescited by 28
- 2018Exploring Weight Symmetry in Deep Neural Networkscited by 12
- 2021Fourier Image Transformercited by 12
- 2022DCT-Former: Efficient Self-Attention with Discrete Cosine Transformcited by 12
- 2023A Hybrid Quantum-Classical Approach based on the Hadamard Transform for the Convolutional Layercited by 12
- 2022gSwin: Gated MLP Vision Model with Hierarchical Structure of Shifted Windowcited by 5
- 2024Structured Initialization for Attention in Vision Transformerscited by 4
- 2021Low-complexity Rounded KLT Approximation for Image Compressioncited by 2
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.