Papers › DAT++: Spatially Dynamic Vision Transformer with Deformable Attention

DAT++: Spatially Dynamic Vision Transformer with Deformable Attention

4 Sep 2023arXiv:2309.01430archive 2025-07-28

Zhuofan Xia, Xuran Pan, Shiji Song, Li Erran Li, Gao Huang

Transformers have shown superior performance on various vision tasks. Their large receptive field endows Transformer models with higher representation power than their CNN counterparts. Nevertheless, simply enlarging the receptive field also raises several concerns. On the one hand, using dense attention in ViT leads to excessive memory and computational cost, and features can be influenced by irrelevant parts that are beyond the region of interests. On the other hand, the handcrafted attention adopted in PVT or Swin Transformer is data agnostic and may limit the ability to model long-range relations. To solve this dilemma, we propose a novel deformable multi-head attention module, where the positions of key and value pairs in self-attention are adaptively allocated in a data-dependent way. This flexible scheme enables the proposed deformable attention to dynamically focus on relevant regions while maintains the representation power of global attention. On this basis, we present Deformable Attention Transformer (DAT), a general vision backbone efficient and effective for visual recognition. We further build an enhanced version DAT++. Extensive experiments show that our DAT++ achieves state-of-the-art results on various visual recognition benchmarks, with 85.9% ImageNet accuracy, 54.5 and 47.0 MS-COCO instance segmentation mAP, and 51.5 ADE20K semantic segmentation mIoU.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 10 code samples harvested from 1 repository linked to this paper: 8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 1 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified. Where Syntology's instrument failed: 2 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 10 samples from 1 repository, 8 ran (6 with no instrument failure; 2 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

leaplabthu/dat officialmentioned in papermentioned on GitHubpytorchApache-2.0Syntology: 10 samples, 8 ran (2 instrument-failed) · 2 unverified 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

10 samples harvested: 8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 1 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

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

Licence: 6 of the 10 samples are pointer only, meaning Syntology does not serve that copy's text. For 6 of them, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from leaplabthu/dat. “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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

leaplabthu/dat official repository 10 samples, 8 ran (2 instrument-failed) · 2 unverified
auto_resume_helper in 27 papers utils.py ran · our draft was wrong Apache-2.0 (permissive) here; the stored copy is pointer only · 0c32459bef92ff8c · report fixture: signature output_dir:str/0/str · returned str · level recorded 2026-09-25
build_optimizer in 83 papers optimizer.py ran Apache-2.0 (permissive) here; the stored copy is pointer only · fcf2d41dd445a70b · report fixture: signature config:Config/0/?, model:callable/0/? · returned AdamW · level recorded 2026-09-25
build_scheduler in 56 papers lr_scheduler.py ran · our draft was wrong Apache-2.0 (permissive) here; the stored copy is pointer only · 07e8b4b487c0abb6 · report fixture: signature config:SimpleNamespace/0/?, optimizer:SGD/0/?, n_iter_per_epoch:int/0/int · returned LinearLRScheduler · level recorded 2026-09-25
check_keywords_in_name in 32 papers optimizer.py ran · violated contract Apache-2.0 (permissive) here; the stored copy is pointer only · b0a5beb34716d5a6 · report fixture: signature name:str/0/str, keywords:tuple/1/str · returned bool · level recorded 2026-09-25
create_logger in 172 papers logger.py ran Apache-2.0 (permissive) here; the stored copy is pointer only · 82e52feafbf040bb · report fixture: signature output_dir:str/0/str, dist_rank:int/0/int, name:str/0/str · returned Logger · level recorded 2026-09-25
get_grad_norm in 45 papers utils.py ran · honoured contract Apache-2.0 (permissive) · eec1e7cba51d5e8e · report fixture: signature parameters:list/1/Tensor, norm_type:int/0/int · returned float · level recorded 2026-09-22
load_checkpoint in 277 papers utils.py ran Apache-2.0 (permissive) · 7ee38b80fc4e6b88 · report fixture: signature config:Config/0/?, model:callable/0/?, optimizer:SGD/0/?, lr_scheduler:StepLR/0/?, logger:Logger/0/? · returned float · level recorded 2026-09-24
set_weight_decay_and_lr in 5 papers optimizer.py ran Apache-2.0 (permissive) here; the stored copy is pointer only · 104af48a94364f24 · report fixture: signature model:callable/0/?, skip_list:tuple/1/str, skip_keywords:tuple/1/str, lower_lr_kvs:dict/0/?, base_lr:float/0/float · returned list · level recorded 2026-09-25
build_model in 469 papers models/build.py unverified Apache-2.0 (permissive) · 376b1ee5cd01affe · report
get_config in 203 papers config.py unverified Apache-2.0 (permissive) · 5a38783eb3898fcc · report

Tasks

Image ClassificationInstance SegmentationObject DetectionSemantic Segmentation

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Image Classification ImageNet DAT-B++ (384x384) GFLOPs 49.7 #187 of 1060 Archive leaderboard report
Image Classification ImageNet DAT-B++ (384x384) Number of params 94M #187 of 1060 Archive leaderboard report
Image Classification ImageNet DAT-B++ (384x384) Top 1 Accuracy 85.9% #187 of 1060 Archive leaderboard report
Image Classification ImageNet DAT-B++ (224x224) GFLOPs 16.6 #280 of 1060 Archive leaderboard report
Image Classification ImageNet DAT-B++ (224x224) Number of params 93M #280 of 1060 Archive leaderboard report
Image Classification ImageNet DAT-B++ (224x224) Top 1 Accuracy 84.9% #280 of 1060 Archive leaderboard report
Image Classification ImageNet DAT-S++ GFLOPs 9.4 #302 of 1060 Archive leaderboard report
Image Classification ImageNet DAT-S++ Number of params 53M #302 of 1060 Archive leaderboard report
Image Classification ImageNet DAT-S++ Top 1 Accuracy 84.6% #302 of 1060 Archive leaderboard report
Image Classification ImageNet DAT-T++ GFLOPs 4.3 #377 of 1060 Archive leaderboard report
Image Classification ImageNet DAT-T++ Number of params 24M #377 of 1060 Archive leaderboard report
Image Classification ImageNet DAT-T++ Top 1 Accuracy 83.9% #377 of 1060 Archive leaderboard report
Object Detection COCO 2017 DAT-S++ AP 50.2 #4 of 24 Archive leaderboard report
Object Detection COCO 2017 DAT-T++ AP 49.2 #5 of 24 Archive leaderboard report
Semantic Segmentation ADE20K DAT-B++ Validation mIoU 51.5 #96 of 235 Archive leaderboard report
Semantic Segmentation ADE20K DAT-S++ Validation mIoU 51.2 #99 of 235 Archive leaderboard report
Semantic Segmentation ADE20K DAT-T++ Validation mIoU 50.3 #115 of 235 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

Absolute Position EncodingsAdamAttentionBPEDense ConnectionsDropoutFocusLabel SmoothingLayer NormalizationLinear LayerMulti-Head AttentionPVTPosition-Wise Feed-Forward LayerResidual ConnectionSoftmaxSpatial-Reduction AttentionStochastic DepthSwin TransformerTransformer

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