Methods › General › Attention Mechanisms › GCT
Gated Channel Transformation
GCT
Introduced by Zongxin Yang et al. in Gated Channel Transformation for Visual Recognition
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
GCT first collects global information by computing the l2-norm of each channel. Next, a learnable vector α is applied to scale the feature. Then a competition mechanism is adopted by channel normalization to interact between channels.
Unlike previous methods, GCT first collects global information by computing the l₂-norm of each channel. Next, a learnable vector α is applied to scale the feature. Then a competition mechanism is adopted by channel normalization to interact between channels. Like other common normalization methods, a learnable scale parameter γ and bias β are applied to rescale the normalization. However, unlike previous methods, GCT adopts tanh activation to control the attention vector. Finally, it not only multiplies the input by the attention vector but also adds an identity connection. GCT can be written as: s = F_(gct)(X, θ) = tanh(γCN(αNorm(X)) + β) Y = s X + X
where α, β and γ are trainable parameters. Norm(·) indicates the L2-norm of each channel. CN is channel normalization.
A GCT block has fewer parameters than an SE block, and as it is lightweight, can be added after each convolutional layer of a CNN.
In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.
Near matches the lookup lists, each a different name: GCT-MARL.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 8 · with a code link: 2 · where Syntology ran a sample: 2 (2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (2 of 8 tagged: 2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 8 of 8, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
STEAM: Squeeze and Transform Enhanced Attention Module 12 Dec 2024 · 0 repositories · arXiv:2412.09023
-
Generative causal testing to bridge data-driven models and scientific theories in language neuroscience 1 Oct 2024 · 1 repository · arXiv:2410.00812Syntology official (archive's flag): 8 ran · 8 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified (of 11 harvested samples)
-
TelTrans: Applying Multi-Type Telecom Data to Transportation Evaluation and Prediction via Multifaceted Graph Modeling 6 Jan 2024 · 0 repositories · arXiv:2401.03138Syntology 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified (of 7 harvested samples) · 7 pointer-only (licence)
-
Granger Causality for Predictability in Dynamic Mode Decomposition 23 Oct 2022 · 0 repositories · arXiv:2210.12737
-
Generalised Co-Salient Object Detection 20 Aug 2022 · 0 repositories · arXiv:2208.09668
-
GCT: Graph Co-Training for Semi-Supervised Few-Shot Learning 15 Mar 2022 · 0 repositories · arXiv:2203.07738
-
Integrating Fréchet distance and AI reveals the evolutionary trajectory and origin of SARS-CoV-2 14 Oct 2021 · 0 repositories · arXiv:2110.07696
-
Gated Channel Transformation for Visual Recognition 25 Sep 2019 · 3 repositories · arXiv:1909.11519
Tasks archive 2025-07-28
19 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
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