Methods › General › Attention Modules › Attention-augmented Convolution

Attention-augmented Convolution

3 papers tagged archive 2025-07-28

Introduced by Irwan Bello et al. in Attention Augmented Convolutional Networks

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

Attention-augmented Convolution is a type of convolution with a two-dimensional relative self-attention mechanism that can replace convolutions as a stand-alone computational primitive for image classification. It employs scaled-dot product attention and multi-head attention as with Transformers.

It works by concatenating convolutional and attentional feature map. To see this, consider an original convolution operator with kernel size k, Fᵢₙ input filters and Fₒᵤₜ output filters. The corresponding attention augmented convolution can be written as"

AAConv(X) = Concat[Conv(X), MHA(X)]

X originates from an input tensor of shape (H, W, Fᵢₙ). This is flattened to become X ∈ℝ^(HW ×Fᵢₙ) which is passed into a multi-head attention module, as well as a convolution (see above).

Similarly to the convolution, the attention augmented convolution 1) is equivariant to translation and 2) can readily operate on inputs of different spatial dimensions.

PaperSourceSee Code · leaderj1001/Attention-Augmented-Conv2d

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: L1-augmented attention; Graph Convolutional Attention; Convolutional Attention (ConvAttn); Convolutional Temporal Attention Networks; Emulating Self-attention with Convolution (ESC); Learnable Graph Convolutional Attention Network (L-CAT); Bi-attention AugmenTed (BAT) graph neural network (GNN); Attention-Based Neural-Augmented Kalman Filter (AttenNKF).

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: 3 · 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 3 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 3 of 3, 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

9 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
3D Point Cloud Classification1
General Classification1
Image Classification1
Music Modeling1
Music Tagging1
Object Detection1
Point Cloud Classification1
image-classification1
object-detection1

Usage over time archive 2025-07-28

Papers per year tagged with Attention-augmented Convolution: 2019 to 2024, peak 1 1 0 2019: 1 paper 2019 2020: 0 papers 2020 2021: 1 paper 2021 2022: 0 papers 2022 2023: 0 papers 2023 2024: 1 paper 2024
Papers per year the archive tags with this method, by the paper's archive date (3 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 ModulesConvolutions

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