arXiv · 2203.06589
AugShuffleNet: Communicate More, Compute Less
Abstract
As a remarkable compact model, ShuffleNetV2 offers a good example to design efficient ConvNets but its limit is rarely noticed. In this paper, we rethink the design pattern of ShuffleNetV2 and find that the channel-wise redundancy problem still constrains the efficiency improvement of Shuffle block in the wider ShuffleNetV2. To resolve this issue, we propose another augmented variant of shuffle block in the form of bottleneck-like structure and more implicit short connections. To verify the effectiveness of this building block, we further build a more powerful and efficient model family, termed as AugShuffleNets. Evaluated on the CIFAR-10 and CIFAR-100 datasets, AugShuffleNet consistently outperforms ShuffleNetV2 in terms of accuracy with less computational cost and fewer parameter count.
Explore related subjects
Keep this discovery
Longqing Ye. 2022-03-13. AugShuffleNet: Communicate More, Compute Less. https://arxiv.org/abs/2203.06589
Cite the original work for its findings. Save a collection to share your selection of sources.