Methods › General › Attention Mechanisms › TAM

Temporal Adaptive Module

TAM

32 papers tagged archive 2025-07-28

Introduced by Zhao-Yang Liu et al. in TAM: Temporal Adaptive Module for Video Recognition

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

TAM is designed to capture complex temporal relationships both efficiently and flexibly, It adopts an adaptive kernel instead of self-attention to capture global contextual information, with lower time complexity than GLTR.

TAM has two branches, a local branch and a global branch. Given the input feature map X∈ℝ^(C×T×H×W), global spatial average pooling GAP is first applied to the feature map to ensure TAM has a low computational cost. Then the local branch in TAM employs several 1D convolutions with ReLU nonlinearity across the temporal domain to produce location-sensitive importance maps for enhancing frame-wise features. The local branch can be written as s = σ(Conv1D(δ(Conv1D(GAP(X))))) X¹ = s X Unlike the local branch, the global branch is location invariant and focuses on generating a channel-wise adaptive kernel based on global temporal information in each channel. For the c-th channel, the kernel can be written as

Θ_c = Softmax(FC₂(δ(FC₁(GAP(X)_c))))

where Θ_c ∈ℝᴷ and K is the adaptive kernel size. Finally, TAM convolves the adaptive kernel Θ with Xₒᵤₜ¹: Y = Θ⊗X¹

With the help of the local branch and global branch, TAM can capture the complex temporal structures in video and enhance per-frame features at low computational cost. Due to its flexibility and lightweight design, TAM can be added to any existing 2D CNNs.

PaperSource

In Syntology name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.

From the lookup's note on this name: Nothing resolved to this name, but 8 entries in Syntology's graph carry it; the most cited is the paper “TAM: Temporal Adaptive Module for Video Recognition” (arXiv:2005.06803, 380 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach. For arXiv:2005.06803: its page on this site · ask the lookup about it.

Near matches the lookup lists, each a different name: TAM-Chain.

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: 32 · with a code link: 8 · where Syntology ran a sample: 3 (3 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 (3 of 32 tagged: 3 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 32 of 32, 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.

Tasks archive 2025-07-28

20 shown of 60 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
ARC3
Action Recognition3
Semantic Segmentation3
Contrastive Learning2
Domain Adaptation2
Language Modelling2
Object2
Segmentation2
Unsupervised Domain Adaptation2
Anatomy1
Anomaly Detection1
Autonomous Driving1
Classification1
Clustering1
Collaborative Filtering1
Combinatorial Optimization1
Cultural Vocal Bursts Intensity Prediction1
Decoder1
Depth Completion1
Descriptive1

Usage over time archive 2025-07-28

Papers per year tagged with TAM: 2020 to 2025, peak 7 7 0 2020: 5 papers 2020 2021: 6 papers 2021 2022: 5 papers 2022 2023: 7 papers 2023 2024: 6 papers 2024 2025: 3 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (32 dated). Bars are counts, not a trend claim.

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

Attention Mechanisms

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