Pith. sign in

REVIEW 1 cited by

FlexConv: Continuous Kernel Convolutions with Differentiable Kernel Sizes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2110.08059 v3 pith:C6JXFUFS submitted 2021-10-15 cs.CV cs.LG

classification cs.CVcs.LG
keywords kernelconvolutionalkernelssizenovelsizestrainingworks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

When designing Convolutional Neural Networks (CNNs), one must select the size\break of the convolutional kernels before training. Recent works show CNNs benefit from different kernel sizes at different layers, but exploring all possible combinations is unfeasible in practice. A more efficient approach is to learn the kernel size during training. However, existing works that learn the kernel size have a limited bandwidth. These approaches scale kernels by dilation, and thus the detail they can describe is limited. In this work, we propose FlexConv, a novel convolutional operation with which high bandwidth convolutional kernels of learnable kernel size can be learned at a fixed parameter cost. FlexNets model long-term dependencies without the use of pooling, achieve state-of-the-art performance on several sequential datasets, outperform recent works with learned kernel sizes, and are competitive with much deeper ResNets on image benchmark datasets. Additionally, FlexNets can be deployed at higher resolutions than those seen during training. To avoid aliasing, we propose a novel kernel parameterization with which the frequency of the kernels can be analytically controlled. Our novel kernel parameterization shows higher descriptive power and faster convergence speed than existing parameterizations. This leads to important improvements in classification accuracy.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Deep Loss Convexification for Learning Iterative Models

    cs.CV 2024-11 conditional novelty 5.0 of 10

    Adding star-convexity hinge losses during training makes a model's loss landscape bowl-shaped around the ground truth and improves iterative predictions on RNN, point cloud registration, and image alignment tasks.

Pith tools