Methods › Computer Vision › Convolutions › CondConv
CondConv
Introduced by Brandon Yang et al. in CondConv: Conditionally Parameterized Convolutions for Efficient Inference
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
CondConv, or Conditionally Parameterized Convolutions, are a type of convolution which learn specialized convolutional kernels for each example. In particular, we parameterize the convolutional kernels in a CondConv layer as a linear combination of n experts (α₁ W₁ + …+ αₙ Wₙ) * x, where α₁, …, αₙ are functions of the input learned through gradient descent. To efficiently increase the capacity of a CondConv layer, developers can increase the number of experts. This can be more computationally efficient than increasing the size of the convolutional kernel itself, because the convolutional kernel is applied at many different positions within the input, while the experts are combined only once per input.
In Syntology repository known, no verified implementation (declared_code; repositories: 9 listed of 9 in the graph, strongest link: official). The lookup matched a paper by its title, arXiv:1904.04971, not a method entry. This answer is about arXiv:1904.04971, the paper the archive credits with this method.
Origin paper of this answer, arXiv:1904.04971 (its page on this site · its page on Syntology).
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: 5 · with a code link: 4 · where Syntology ran a sample: 2 (1 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (2 of 5 tagged: 1 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 5 of 5, 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.
-
Frequency Dynamic Convolution for Dense Image Prediction 24 Mar 2025 · 1 repository · arXiv:2503.18783Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 2 harvested samples)
-
Collaboration of Experts: Achieving 80% Top-1 Accuracy on ImageNet with 100M FLOPs 8 Jul 2021 · 0 repositories · arXiv:2107.03815
-
EXTENDING CONDITIONAL CONVOLUTION STRUCTURES FOR ENHANCING MULTITASKING CONTINUAL LEARNING 7 Dec 2020 · 1 repository
-
WeightNet: Revisiting the Design Space of Weight Networks 23 Jul 2020 · 2 repositories · arXiv:2007.11823Syntology community repositories only · 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample)
-
CondConv: Conditionally Parameterized Convolutions for Efficient Inference 10 Apr 2019 · 9 repositories · arXiv:1904.04971
Tasks archive 2025-07-28
8 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Image Classification | 2 |
| Object Detection | 2 |
| Computational Efficiency | 1 |
| Continual Learning | 1 |
| General Classification | 1 |
| Multi-Task Learning | 1 |
| Prediction | 1 |
| object-detection | 1 |
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