Papers › Robustifying Token Attention for Vision Transformers

Robustifying Token Attention for Vision Transformers

20 Mar 2023ICCV 2023 1arXiv:2303.11126archive 2025-07-28

Yong Guo, David Stutz, Bernt Schiele

Despite the success of vision transformers (ViTs), they still suffer from significant drops in accuracy in the presence of common corruptions, such as noise or blur. Interestingly, we observe that the attention mechanism of ViTs tends to rely on few important tokens, a phenomenon we call token overfocusing. More critically, these tokens are not robust to corruptions, often leading to highly diverging attention patterns. In this paper, we intend to alleviate this overfocusing issue and make attention more stable through two general techniques: First, our Token-aware Average Pooling (TAP) module encourages the local neighborhood of each token to take part in the attention mechanism. Specifically, TAP learns average pooling schemes for each token such that the information of potentially important tokens in the neighborhood can adaptively be taken into account. Second, we force the output tokens to aggregate information from a diverse set of input tokens rather than focusing on just a few by using our Attention Diversification Loss (ADL). We achieve this by penalizing high cosine similarity between the attention vectors of different tokens. In experiments, we apply our methods to a wide range of transformer architectures and improve robustness significantly. For example, we improve corruption robustness on ImageNet-C by 2.4% while improving accuracy by 0.4% based on state-of-the-art robust architecture FAN. Also, when fine-tuning on semantic segmentation tasks, we improve robustness on CityScapes-C by 2.4% and ACDC by 3.0%. Our code is available at https://github.com/guoyongcs/TAPADL.

PaperPDFConference PDFCodeCode 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="2303.11126")

Code

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

By repository: official repository: 7 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.

guoyongcs/tapadl officialmentioned in papermentioned on GitHubpytorch 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

7 samples harvested; 5 ran; 0 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.

5ran
2unverified

Licence: 0 of the 7 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 guoyongcs/TAPADL. “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.

ChannelProcessing guoyongcs/TAPADL/TAPADL_FAN/models/tap_fan.py official repository ran MIT (permissive) · 9e1829144120e239 · report
DilatedAvgPooling guoyongcs/TAPADL/TAPADL_FAN/models/tap_fan.py official repository ran fingerprinted MIT (permissive) · e94906613584059a · report
DilationPredictor guoyongcs/TAPADL/TAPADL_FAN/models/tap_fan.py official repository ran fingerprinted MIT (permissive) · 73a195cbb21090ca · report
Mlp guoyongcs/TAPADL/TAPADL_FAN/models/tap_fan.py official repository ran MIT (permissive) · 2c0905736daa9f4b · report
TokenMixing guoyongcs/TAPADL/TAPADL_FAN/models/tap_fan.py official repository ran MIT (permissive) · 7f3ab405b18fed04 · report
DWConv guoyongcs/TAPADL/TAPADL_FAN/models/tap_fan.py official repository unverified MIT (permissive) · c50e9bde24e3ede2 · report
TAPFANBlock guoyongcs/TAPADL/TAPADL_FAN/models/tap_fan.py official repository unverified MIT (permissive) · 35a38249939b549d · report

Tasks

Semantic Segmentation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Average Pooling

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