ViG: Linear-complexity Visual Sequence Learning with Gated Linear Attention
<|reference_start|>ViG: Linear-complexity Visual Sequence Learning with Gated Linear Attention: Recently, linear complexity sequence modeling networks have achieved modeling capabilities similar to Vision Transformers on a variety of computer vision tasks, while using fewer FLOPs and less memory. However, their advantage in terms of actual runtime speed is not significant. To address this issue, we introduce Gated Linear Attention (GLA) for vision, leveraging its superior hardware-awareness and efficiency. We propose direction-wise gating to capture 1D global context through bidirectional modeling and a 2D gating locality injection to adaptively inject 2D local details into 1D global context. Our hardware-aware implementation further merges forward and backward scanning into a single kernel, enhancing parallelism and reducing memory cost and latency. The proposed model, ViG, offers a favorable trade-off in accuracy, parameters, and FLOPs on ImageNet and downstream tasks, outperforming popular Transformer and CNN-based models. Notably, ViG-S matches DeiT-B's accuracy while using only 27% of the parameters and 20% of the FLOPs, running 2$\times$ faster on $224\times224$ images. At $1024\times1024$ resolution, ViG-T uses 5.2$\times$ fewer FLOPs, saves 90% GPU memory, runs 4.8$\times$ faster, and achieves 20.7% higher top-1 accuracy than DeiT-T. These results position ViG as an efficient and scalable solution for visual representation learning. Code is available at \url{https://github.com/hustvl/ViG}.<|reference_end|>
@article{liao2024vig:,
    title={ViG: Linear-complexity Visual Sequence Learning with Gated Linear
  Attention},
    author={Bencheng Liao, Xinggang Wang, Lianghui Zhu, Qian Zhang, Chang Huang},
    journal={arXiv preprint arXiv:2405.18425},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.18425},
    primaryClass={cs.CV cs.AI}
}