Methods › Computer Vision › Convolutions › DCLS
Dilated convolution with learnable spacings
DCLS
Introduced by Ismail Khalfaoui-Hassani et al. in Dilated convolution with learnable spacings
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Dilated convolution with learnable spacings (DCLS) is a type of convolution that allows the spacings between the non-zero elements of the kernel to be learned during training. This makes it possible to increase the receptive field of the convolution without increasing the number of parameters, which can improve the performance of the network on tasks that require long-range dependencies.
A dilated convolution is a type of convolution that allows the kernel to be skipped over some of the input features. This is done by inserting zeros between the non-zero elements of the kernel. The effect of this is to increase the receptive field of the convolution without increasing the number of parameters.
DCLS takes this idea one step further by allowing the spacings between the non-zero elements of the kernel to be learned during training. This means that the network can learn to skip over different input features depending on the task at hand. This can be particularly helpful for tasks that require long-range dependencies, such as image segmentation and object detection.
DCLS has been shown to be effective for a variety of tasks, including image classification, object detection, and semantic segmentation. It is a promising new technique that has the potential to improve the performance of convolutional neural networks on a variety of tasks.
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 1 entry in Syntology's graph carry it; the most cited is “Deep Constrained Least Squares (DCLS)”, a method in the paper “Deep Constrained Least Squares for Blind Image Super-Resolution” (arXiv:2202.07508, 135 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:2202.07508: its page on this site · ask the lookup about it.
Near matches the lookup lists, each a different name: Deep Constrained Least Squares (DCLS); Dilated Convolution with Learnable Spacings (DCLS) with Gaussian interpolation.
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: 6 · with a code link: 5 · where Syntology ran a sample: 0 (0 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: none of the 6 tagged papers has a Syntology run on record
Page 1 of 1: papers 1 to 6 of 6, 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.
-
Dilated Convolution with Learnable Spacings 10 Aug 2024 · 0 repositories · arXiv:2408.06383
-
Dilated Convolution with Learnable Spacings makes visual models more aligned with humans: a Grad-CAM study 6 Aug 2024 · 1 repository · arXiv:2408.03164
-
Audio classification with Dilated Convolution with Learnable Spacings 25 Sep 2023 · 2 repositories · arXiv:2309.13972
-
Learning Delays in Spiking Neural Networks using Dilated Convolutions with Learnable Spacings 30 Jun 2023 · 1 repository · arXiv:2306.17670
-
Dilated Convolution with Learnable Spacings: beyond bilinear interpolation 1 Jun 2023 · 1 repository · arXiv:2306.00817
-
Dilated convolution with learnable spacings 7 Dec 2021 · 3 repositories · arXiv:2112.03740Syntology official: harvested, nothing ran · 0 ran · 3 unverified (of 3 harvested samples)
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.
| Task | Papers |
|---|---|
| Audio Classification | 3 |
| Object Detection | 2 |
| Semantic Segmentation | 2 |
| Audio Tagging | 1 |
| Classification | 1 |
| Image Classification | 1 |
| Speech Recognition | 1 |
| object-detection | 1 |
| speech-recognition | 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