Pith. sign in

REVIEW 1 cited by

Inception Convolution with Efficient Dilation Search

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 2012.13587 v2 pith:XI22TJNN submitted 2020-12-25 cs.CV

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

As a variant of standard convolution, a dilated convolution can control effective receptive fields and handle large scale variance of objects without introducing additional computational costs. To fully explore the potential of dilated convolution, we proposed a new type of dilated convolution (referred to as inception convolution), where the convolution operations have independent dilation patterns among different axes, channels and layers. To develop a practical method for learning complex inception convolution based on the data, a simple but effective search algorithm, referred to as efficient dilation optimization (EDO), is developed. Based on statistical optimization, the EDO method operates in a low-cost manner and is extremely fast when it is applied on large scale datasets. Empirical results validate that our method achieves consistent performance gains for image recognition, object detection, instance segmentation, human detection, and human pose estimation. For instance, by simply replacing the 3x3 standard convolution in the ResNet-50 backbone with inception convolution, we significantly improve the AP of Faster R-CNN from 36.4% to 39.2% on MS COCO.

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. SHeRL-FL: When Representation Learning Meets Split Learning in Hierarchical Federated Learning

    cs.LG 2025-08 unverdicted novelty 2.0 of 10

    The submitted body is an unrelated survey, not the SHeRL-FL method claimed in the metadata.

Pith tools