Dual Path Transformer with Partition Attention

Zhengkai Jiang, Liang Liu, Jiangning Zhang, Yabiao Wang, Mingang Chen +1 more
5/24/2023
cs.CV

No confident code implementation found for this paper.

Abstract

This paper introduces a novel attention mechanism, called dual attention, which is both efficient and effective. The dual attention mechanism consists of two parallel components: local attention generated by Convolutional Neural Networks (CNNs) and long-range attention generated by Vision Transformers (ViTs). To address the high computational complexity and memory footprint of vanilla Multi-Head Self-Attention (MHSA), we introduce a novel Multi-Head Partition-wise Attention (MHPA) mechanism. The partition-wise attention approach models both intra-partition and inter-partition attention simultaneously. Building on the dual attention block and partition-wise attention mechanism, we present a hierarchical vision backbone called DualFormer. We evaluate the effectiveness of our model on several computer vision tasks, including image classification on ImageNet, object detection on COCO, and semantic segmentation on Cityscapes. Specifically, the proposed DualFormer-XS achieves 81.5\% top-1 accuracy on ImageNet, outperforming the recent state-of-the-art MPViT-XS by 0.6\% top-1 accuracy with much higher throughput.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{jiang2023dual,
  title  = {Dual Path Transformer with Partition Attention},
  author = {Zhengkai Jiang and Liang Liu and Jiangning Zhang and Yabiao Wang and Mingang Chen and Chengjie Wang},
  year   = {2023},
  eprint = {2305.14768},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.14768v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.14768.svg)](https://codeofpaper.com/paper/2305.14768)

Discussion