Papers › DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsification
DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsification
Yongming Rao, Wenliang Zhao, Benlin Liu, Jiwen Lu, Jie zhou, Cho-Jui Hsieh
Attention is sparse in vision transformers. We observe the final prediction in vision transformers is only based on a subset of most informative tokens, which is sufficient for accurate image recognition. Based on this observation, we propose a dynamic token sparsification framework to prune redundant tokens progressively and dynamically based on the input. Specifically, we devise a lightweight prediction module to estimate the importance score of each token given the current features. The module is added to different layers to prune redundant tokens hierarchically. To optimize the prediction module in an end-to-end manner, we propose an attention masking strategy to differentiably prune a token by blocking its interactions with other tokens. Benefiting from the nature of self-attention, the unstructured sparse tokens are still hardware friendly, which makes our framework easy to achieve actual speed-up. By hierarchically pruning 66% of the input tokens, our method greatly reduces 31%~37% FLOPs and improves the throughput by over 40% while the drop of accuracy is within 0.5% for various vision transformers. Equipped with the dynamic token sparsification framework, DynamicViT models can achieve very competitive complexity/accuracy trade-offs compared to state-of-the-art CNNs and vision transformers on ImageNet. Code is available at https://github.com/raoyongming/DynamicViT
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="2106.02034")
Code
Syntology Ran 6 of 9 code samples harvested from 2 repositories linked to this paper; 3 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 2 ran · fixture could not drive it; 3 ran with no contract checked.
By repository: official repository: 7 samples from 1 repository, 5 ran; community (archive-listed): 1 sample from 1 repository, 0 ran; 1 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
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
9 samples harvested; 6 ran; 0 honoured the contract we drafted; 3 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: 1 of the 9 samples is 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 2 repositories linked to this paper, official or community; each sample names its own and says which. Some samples are identical code Syntology first harvested from another repository; for those, this paper's copy is not located and its licence is not recorded. “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.
a559e910dfa91050 · report
d033f4bb9f95a41d · report
58b57ebe8cc76422 · report
908619be92da9903 · report
31e761629295b753 · report
575ff52688baea94 · report
641fc76ec2423f31 · report
c2f59e9256846dc1 · report
b0f936d4d6ae3b8c · report
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Efficient ViTs | ImageNet-1K (With LV-ViT-S) | DynamicViT (90%) | GFLOPs | 5.8 | #4 of 19 | Archive leaderboard | report |
| Efficient ViTs | ImageNet-1K (With LV-ViT-S) | DynamicViT (90%) | Top 1 Accuracy | 83.3 | #4 of 19 | Archive leaderboard | report |
| Efficient ViTs | ImageNet-1K (With LV-ViT-S) | DynamicViT (80%) | GFLOPs | 5.1 | #5 of 19 | Archive leaderboard | report |
| Efficient ViTs | ImageNet-1K (With LV-ViT-S) | DynamicViT (80%) | Top 1 Accuracy | 83.2 | #5 of 19 | Archive leaderboard | report |
| Efficient ViTs | ImageNet-1K (With LV-ViT-S) | DynamicViT (70%) | GFLOPs | 4.6 | #11 of 19 | Archive leaderboard | report |
| Efficient ViTs | ImageNet-1K (With LV-ViT-S) | DynamicViT (70%) | Top 1 Accuracy | 83.0 | #11 of 19 | Archive leaderboard | report |
| Efficient ViTs | ImageNet-1K (with DeiT-S) | DynamicViT (80%) | GFLOPs | 3.4 | #6 of 41 | Archive leaderboard | report |
| Efficient ViTs | ImageNet-1K (with DeiT-S) | DynamicViT (80%) | Top 1 Accuracy | 79.8 | #6 of 41 | Archive leaderboard | report |
| Efficient ViTs | ImageNet-1K (with DeiT-S) | DynamicViT (90%) | GFLOPs | 4.0 | #11 of 41 | Archive leaderboard | report |
| Efficient ViTs | ImageNet-1K (with DeiT-S) | DynamicViT (90%) | Top 1 Accuracy | 79.8 | #11 of 41 | Archive leaderboard | report |
| Efficient ViTs | ImageNet-1K (with DeiT-S) | DynamicViT (70%) | GFLOPs | 2.9 | #27 of 41 | Archive leaderboard | report |
| Efficient ViTs | ImageNet-1K (with DeiT-S) | DynamicViT (70%) | Top 1 Accuracy | 79.3 | #27 of 41 | Archive leaderboard | report |
| Image Classification | ImageNet | DynamicViT-LV-M/0.8 | Number of params | 57.1M | #379 of 1060 | Archive leaderboard | report |
| Image Classification | ImageNet | DynamicViT-LV-M/0.8 | Top 1 Accuracy | 83.9 | #379 of 1060 | Archive leaderboard | report |
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.
Methods
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