Papers › CAS-ViT: Convolutional Additive Self-attention Vision Transformers for Efficient...

CAS-ViT: Convolutional Additive Self-attention Vision Transformers for Efficient Mobile Applications

7 Aug 2024arXiv:2408.03703archive 2025-07-28

Tianfang Zhang, Lei LI, Yang Zhou, Wentao Liu, Chen Qian, Jenq-Neng Hwang, Xiangyang Ji

Vision Transformers (ViTs) mark a revolutionary advance in neural networks with their token mixer's powerful global context capability. However, the pairwise token affinity and complex matrix operations limit its deployment on resource-constrained scenarios and real-time applications, such as mobile devices, although considerable efforts have been made in previous works. In this paper, we introduce CAS-ViT: Convolutional Additive Self-attention Vision Transformers, to achieve a balance between efficiency and performance in mobile applications. Firstly, we argue that the capability of token mixers to obtain global contextual information hinges on multiple information interactions, such as spatial and channel domains. Subsequently, we propose Convolutional Additive Token Mixer (CATM) employing underlying spatial and channel attention as novel interaction forms. This module eliminates troublesome complex operations such as matrix multiplication and Softmax. We introduce Convolutional Additive Self-attention(CAS) block hybrid architecture and utilize CATM for each block. And further, we build a family of lightweight networks, which can be easily extended to various downstream tasks. Finally, we evaluate CAS-ViT across a variety of vision tasks, including image classification, object detection, instance segmentation, and semantic segmentation. Our M and T model achieves 83.0\%/84.1\% top-1 with only 12M/21M parameters on ImageNet-1K. Meanwhile, throughput evaluations on GPUs, ONNX, and iPhones also demonstrate superior results compared to other state-of-the-art backbones. Extensive experiments demonstrate that our approach achieves a better balance of performance, efficient inference and easy-to-deploy. Our code and model are available at: \url{https://github.com/Tianfang-Zhang/CAS-ViT}

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

Code

Syntology Ran 4 of 6 code samples harvested from 1 repository linked to this paper; 2 have no recorded run. Of those that ran: 1 ran · honoured contract; 1 ran · our draft was wrong; 2 ran with no contract checked.

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

tianfang-zhang/cas-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

6 samples harvested; 4 ran; 1 honoured the contract we drafted; 2 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.

1ran · honoured contract
1ran · our draft was wrong
2ran
2unverified

Licence: 0 of the 6 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 tianfang-zhang/cas-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.

Stage tianfang-zhang/cas-vit/classification/model/rcvit.py official repository ran MIT (permissive) · a4cb506c560f097d · report
count_parameters tianfang-zhang/cas-vit/classification/model/rcvit.py official repository ran · honoured contract MIT (permissive) · f6b944f50d3f15ae · report
get_parameter_groups tianfang-zhang/cas-vit/classification/optim_factory.py official repository ran MIT (permissive) · 979fc7d0ba424da1 · report
stem tianfang-zhang/cas-vit/classification/model/rcvit.py official repository ran · our draft was wrong MIT (permissive) · b72ba06382340c08 · report
cosine_scheduler tianfang-zhang/cas-vit/classification/utils.py official repository unverified MIT (permissive) · b700fb0a3496b255 · report
get_num_layer_for_convnext tianfang-zhang/cas-vit/classification/optim_factory.py official repository unverified MIT (permissive) · 199223de2f9704cf · report

Tasks

Image ClassificationInstance SegmentationObject DetectionSemantic Segmentationimage-classificationobject-detection

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Image Classification ImageNet CAS-ViT-T GFLOPs 3.597 #352 of 1060 Archive leaderboard report
Image Classification ImageNet CAS-ViT-T Number of params 21.76M #352 of 1060 Archive leaderboard report
Image Classification ImageNet CAS-ViT-T Top 1 Accuracy 84.1% #352 of 1060 Archive leaderboard report
Image Classification ImageNet CAS-ViT-M GFLOPs 1.887 #475 of 1060 Archive leaderboard report
Image Classification ImageNet CAS-ViT-M Number of params 12.42M #475 of 1060 Archive leaderboard report
Image Classification ImageNet CAS-ViT-M Top 1 Accuracy 83.0% #475 of 1060 Archive leaderboard report
Image Classification ImageNet CAS-ViT-S GFLOPs 0.932 #662 of 1060 Archive leaderboard report
Image Classification ImageNet CAS-ViT-S Number of params 5.76M #662 of 1060 Archive leaderboard report
Image Classification ImageNet CAS-ViT-S Top 1 Accuracy 81.1% #662 of 1060 Archive leaderboard report
Image Classification ImageNet CAS-ViT-XS GFLOPs 0.56 #811 of 1060 Archive leaderboard report
Image Classification ImageNet CAS-ViT-XS Number of params 3.2M #811 of 1060 Archive leaderboard report
Image Classification ImageNet CAS-ViT-XS Top 1 Accuracy 78.7% #811 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

AttentionSoftmax

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