Methods › Sequential › Temporal Convolutions › DynamicConv

Dynamic Convolution

DynamicConv

11 papers tagged archive 2025-07-28

Introduced by Felix Wu et al. in Pay Less Attention with Lightweight and Dynamic Convolutions

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

DynamicConv is a type of convolution for sequential modelling where it has kernels that vary over time as a learned function of the individual time steps. It builds upon LightConv and takes the same form but uses a time-step dependent kernel:

DynamicConv(X, i, c) = LightConv(X, f(Xᵢ)_(h,:), i, c)

PaperSourceSee Code · pytorch/fairseq

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.

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: 11 · with a code link: 6 · where Syntology ran a sample: 1 (1 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 (1 of 11 tagged: 1 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 11 of 11, 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 29 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
Machine Translation4
Translation4
Language Modeling2
Language Modelling2
Object Detection2
object-detection2
Abstractive Text Summarization1
Automatic Speech Recognition1
Automatic Speech Recognition (ASR)1
Bias Detection1
Data Augmentation1
Drug Discovery1
Image Classification1
Instance Segmentation1
Misinformation1
Natural Language Understanding1
Object1
Punctuation Restoration1
RGB Salient Object Detection1
Salient Object Detection1

Usage over time archive 2025-07-28

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

Temporal ConvolutionsConvolutions

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