Pith. sign in

REVIEW 2 cited by

DyNet: Dynamic Convolution for Accelerating Convolutional Neural Networks

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 2004.10694 v1 pith:Q7LMMOYN submitted 2020-04-22 cs.CV cs.LG

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

Convolution operator is the core of convolutional neural networks (CNNs) and occupies the most computation cost. To make CNNs more efficient, many methods have been proposed to either design lightweight networks or compress models. Although some efficient network structures have been proposed, such as MobileNet or ShuffleNet, we find that there still exists redundant information between convolution kernels. To address this issue, we propose a novel dynamic convolution method to adaptively generate convolution kernels based on image contents. To demonstrate the effectiveness, we apply dynamic convolution on multiple state-of-the-art CNNs. On one hand, we can reduce the computation cost remarkably while maintaining the performance. For ShuffleNetV2/MobileNetV2/ResNet18/ResNet50, DyNet can reduce 37.0/54.7/67.2/71.3% FLOPs without loss of accuracy. On the other hand, the performance can be largely boosted if the computation cost is maintained. Based on the architecture MobileNetV3-Small/Large, DyNet achieves 70.3/77.1% Top-1 accuracy on ImageNet with an improvement of 2.9/1.9%. To verify the scalability, we also apply DyNet on segmentation task, the results show that DyNet can reduce 69.3% FLOPs while maintaining Mean IoU on segmentation task.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Adaptive Blind Super-Resolution Network for Spatial-Specific and Spatial-Agnostic Degradations

    cs.CV 2025-06 conditional novelty 5.0 of 10

    GLDFN, a dual-branch network with global and local dynamic filters, slightly improves blind super-resolution on several synthetic and real benchmarks, but its two-class degradation taxonomy is only partially confirmed...

  2. cMoLLM at Scale: Horizontal Scaling Laws for Mixture-of-LLMs

    cs.AI 2026-06 reject novelty 4.0 of 10

    A pipeline-level soft mixture of LLM streams implemented as dynamic convolution improves GPT-2-scale perplexity/GLUE/SQuAD, but only at substantially higher compute and without reported ParaScale/AltUp comparisons.

Pith tools