Papers › MaxViT: Multi-Axis Vision Transformer
MaxViT: Multi-Axis Vision Transformer
Zhengzhong Tu, Hossein Talebi, Han Zhang, Feng Yang, Peyman Milanfar, Alan Bovik, Yinxiao Li
Transformers have recently gained significant attention in the computer vision community. However, the lack of scalability of self-attention mechanisms with respect to image size has limited their wide adoption in state-of-the-art vision backbones. In this paper we introduce an efficient and scalable attention model we call multi-axis attention, which consists of two aspects: blocked local and dilated global attention. These design choices allow global-local spatial interactions on arbitrary input resolutions with only linear complexity. We also present a new architectural element by effectively blending our proposed attention model with convolutions, and accordingly propose a simple hierarchical vision backbone, dubbed MaxViT, by simply repeating the basic building block over multiple stages. Notably, MaxViT is able to ''see'' globally throughout the entire network, even in earlier, high-resolution stages. We demonstrate the effectiveness of our model on a broad spectrum of vision tasks. On image classification, MaxViT achieves state-of-the-art performance under various settings: without extra data, MaxViT attains 86.5% ImageNet-1K top-1 accuracy; with ImageNet-21K pre-training, our model achieves 88.7% top-1 accuracy. For downstream tasks, MaxViT as a backbone delivers favorable performance on object detection as well as visual aesthetic assessment. We also show that our proposed model expresses strong generative modeling capability on ImageNet, demonstrating the superior potential of MaxViT blocks as a universal vision module. The source code and trained models will be available at https://github.com/google-research/maxvit.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2204.01697")
Code
Syntology Ran 33 of 53 code samples harvested from 7 repositories linked to this paper; 20 have no recorded run. Of those that ran: 2 ran · honoured contract; 2 ran · our draft was wrong; 11 ran · fixture could not drive it; 18 ran with no contract checked.
By repository: official repository: 11 samples from 1 repository, 4 ran; community (archive-listed): 42 samples from 6 repositories, 29 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
15 repositories listed; official and paper-mentioned ones first.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
53 samples harvested; 33 ran; 2 honoured the contract we drafted; 20 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.
Licence: 9 of the 53 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from 7 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
2bc733f08e821139 · report
e2718d640d43e769 · report
839c67588aa822e2 · report
5ecfa57092a8cecc · report
f50211588bf5be8b · report
2d7a9595c2215efd · report
c99919623d98cd27 · report
ee80113a460390fe · report
d237bfe09ec44cfd · report
20213f171bc1c7e9 · report
256b0e25fa8d8cee · report
0ff4fe4361d49089 · report
d227ba24d7d8d855 · report
d8da107e27ecbe28 · report
325b31d5363dae7d · report
b3be1bfa6f51c051 · report
32bd4f3abdceaefe · report
86d6d05360b6903b · report
8fa30deee34804c0 · report
6b918699878401db · report
f4987984f431cfd0 · report
7e1c7833684c337a · report
08082022ac2c6e65 · report
c72be25671079b1b · report
636a208dabc2a711 · report
b15b0232b5e08a9c · report
8a67f23552a44d61 · report
971ae8d2d8313e30 · report
48de7cab87cd24fa · report
9d7347fa5b820e84 · report
2e62acbb2e8ec0a9 · report
702e2dca4d951046 · report
f41c6472d974b50b · report
3b95c931d4a4355d · report
80cee5fcd8a9952b · report
627ea4c76565d927 · report
ab7995b8493f8bd3 · report
ae8a9a667b5d42f9 · report
10fe1fb26b9e9e9d · report
c72f01470606b887 · report
bcddd7996b51db67 · report
2df10618a97ad3c5 · report
f6a21a6318030b5d · report
04bab611e8e60c1e · report
1aad85bb6748a80a · report
da9db733c947bc49 · report
641d6f2b8dbc0745 · report
e7fa9568a4a28913 · report
5d26f1a66e6a15e4 · report
bbc5501012bdee68 · report
6eaf2972dbdcacc3 · report
20f2f90659c203e1 · report
cd52f54038e59852 · report
Tasks
Results from the paper archive 2025-07-28
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections