GvT: A Graph-based Vision Transformer with Talking-Heads Utilizing Sparsity, Trained from Scratch on Small Datasets
Not on the map. Why?
Abstract (arXiv)
Vision Transformers (ViTs) have achieved impressive results in large-scale image classification. However, when training from scratch on small datasets, there is still a significant performance gap between ViTs and Convolutional Neural Networks (CNNs), which is attributed to the lack of inductive bias. To address this issue, we propose a Graph-based Vision Transformer (GvT) that utilizes graph convolutional projection and graph-pooling. In each block, queries and keys are calculated through graph convolutional projection based on the spatial adjacency matrix, while dot-product attention is used in another graph convolution to generate values. When using more attention heads, the queries and keys become lower-dimensional, making their dot product an uninformative matching function. To overcome this low-rank bottleneck in attention heads, we employ talking-heads technology based on bilinear pooled features and sparse selection of attention tensors. This allows interaction among filtered attention scores and enables each attention mechanism to depend on all queries and keys. Additionally, we apply graph-pooling between two intermediate blocks to reduce the number of tokens and aggregate semantic information more effectively. Our experimental results show that GvT produces comparable or superior outcomes to deep convolutional networks and surpasses vision transformers without pre-training on large datasets. The code for our proposed model is publicly available on the website.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 28 of its 38 references that are in the map. First posted on arXiv 7 Apr 2024.
Builds on
28 of 38 references.
References · 28
- 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
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2020End-to-End Object Detection with Transformerscited by 7,414
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2018An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modelingcited by 1,476
- 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,331
- 2021CvT: Introducing Convolutions to Vision Transformerscited by 947
- 2021Do Vision Transformers See Like Convolutional Neural Networks?cited by 675
16 more
- 2020End-to-End Video Instance Segmentation with Transformerscited by 443
- 2018Generating Wikipedia by Summarizing Long Sequencescited by 335
- 2021Escaping the Big Data Paradigm with Compact Transformerscited by 264
- 2022Representing Long-Range Context for Graph Neural Networks with Global Attentioncited by 195
- 2020Rethinking Transformer-based Set Prediction for Object Detectioncited by 156
- 2017Breaking the Softmax Bottleneck: A High-Rank RNN Language Modelcited by 152
- 2021Efficient Training of Visual Transformers with Small Datasetscited by 108
- 2020COVID-CT-Dataset: A CT Scan Dataset about COVID-19cited by 94
- 2020Low-Rank Bottleneck in Multi-head Attention Modelscited by 89
- 2020Human-centric Spatio-Temporal Video Grounding With Visual Transformerscited by 85
- 2020Talking-Heads Attentioncited by 62
- 2020Second-Order Pooling for Graph Neural Networkscited by 33
- 2022Bridging the Gap Between Vision Transformers and Convolutional Neural Networks on Small Datasetscited by 29
- 2021Hierarchical Graph Convolutional Skeleton Transformer for Action Recognitioncited by 12
- 2021Investigating the Vision Transformer Model for Image Retrieval Taskscited by 11
- 2017Interleaved Group Convolutions for Deep Neural Networkscited by 7
Built on by
Not cited yet.