Papers › Evo-ViT: Slow-Fast Token Evolution for Dynamic Vision Transformer

Evo-ViT: Slow-Fast Token Evolution for Dynamic Vision Transformer

3 Aug 2021arXiv:2108.01390archive 2025-07-28

Yifan Xu, Zhijie Zhang, Mengdan Zhang, Kekai Sheng, Ke Li, WeiMing Dong, Liqing Zhang, Changsheng Xu, Xing Sun

Vision transformers (ViTs) have recently received explosive popularity, but the huge computational cost is still a severe issue. Since the computation complexity of ViT is quadratic with respect to the input sequence length, a mainstream paradigm for computation reduction is to reduce the number of tokens. Existing designs include structured spatial compression that uses a progressive shrinking pyramid to reduce the computations of large feature maps, and unstructured token pruning that dynamically drops redundant tokens. However, the limitation of existing token pruning lies in two folds: 1) the incomplete spatial structure caused by pruning is not compatible with structured spatial compression that is commonly used in modern deep-narrow transformers; 2) it usually requires a time-consuming pre-training procedure. To tackle the limitations and expand the applicable scenario of token pruning, we present Evo-ViT, a self-motivated slow-fast token evolution approach for vision transformers. Specifically, we conduct unstructured instance-wise token selection by taking advantage of the simple and effective global class attention that is native to vision transformers. Then, we propose to update the selected informative tokens and uninformative tokens with different computation paths, namely, slow-fast updating. Since slow-fast updating mechanism maintains the spatial structure and information flow, Evo-ViT can accelerate vanilla transformers of both flat and deep-narrow structures from the very beginning of the training process. Experimental results demonstrate that our method significantly reduces the computational cost of vision transformers while maintaining comparable performance on image classification.

PaperPDFCodeCode Syntology ran

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="2108.01390")

Code

Syntology Ran 5 of 9 code samples harvested from 1 repository linked to this paper; 4 have no recorded run. Of those that ran: 3 ran · honoured contract; 2 ran with no contract checked.

By repository: official repository: 9 samples from 1 repository, 5 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

YifanXu74/Evo-ViT officialmentioned in papermentioned on GitHubpytorchMIT report

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; 5 ran; 3 honoured the contract we drafted; 4 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.

3ran · honoured contract
2ran
4unverified

Licence: 0 of the 9 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 YifanXu74/Evo-ViT. “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.

count_params YifanXu74/Evo-ViT/benchmark.py official repository ran · honoured contract MIT (permissive) · 410bffb8a07b52e3 · report
checkpoint_filter_fn YifanXu74/Evo-ViT/deit/evo_deit.py official repository ran MIT (permissive) · 0b3795f9775ce118 · report
cuda_timestamp YifanXu74/Evo-ViT/benchmark.py official repository ran · honoured contract fingerprinted MIT (permissive) · 50d653ee6a59955c · report
resize_pos_embed YifanXu74/Evo-ViT/deit/evo_deit.py official repository ran MIT (permissive) · 109c74bc1997c975 · report
timestamp YifanXu74/Evo-ViT/benchmark.py official repository ran · honoured contract fingerprinted MIT (permissive) · 475160c5a1a1225a · report
build_dataset YifanXu74/Evo-ViT/datasets.py official repository unverified MIT (permissive) · 9153241c4331eb1a · report
build_dataset2 YifanXu74/Evo-ViT/datasets.py official repository unverified MIT (permissive) · b6679d5755485cf9 · report
build_transform YifanXu74/Evo-ViT/datasets.py official repository unverified MIT (permissive) · 3bc74137ab36aa79 · report
easy_gather YifanXu74/Evo-ViT/deit/evo_deit.py official repository unverified MIT (permissive) · a402be7c553f216c · report

Tasks

Efficient ViTsImage Classificationimage-classification

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Efficient ViTs ImageNet-1K (with DeiT-S) EvoViT GFLOPs 3.0 #24 of 41 Archive leaderboard report
Efficient ViTs ImageNet-1K (with DeiT-S) EvoViT Top 1 Accuracy 79.4 #24 of 41 Archive leaderboard report
Efficient ViTs ImageNet-1K (with DeiT-T) EvoViT GFLOPs 0.8 #12 of 22 Archive leaderboard report
Efficient ViTs ImageNet-1K (with DeiT-T) EvoViT Top 1 Accuracy 72.0 #12 of 22 Archive leaderboard report
Image Classification ImageNet Evo-LeViT-384* Number of params 39.6M #563 of 1060 Archive leaderboard report
Image Classification ImageNet Evo-LeViT-384* Top 1 Accuracy 82.2% #563 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

Class AttentionPruning

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