Papers › EffNet: An Efficient Structure for Convolutional Neural Networks

EffNet: An Efficient Structure for Convolutional Neural Networks

19 Jan 2018arXiv:1801.06434archive 2025-07-28

Ido Freeman, Lutz Roese-Koerner, Anton Kummert

With the ever increasing application of Convolutional Neural Networks to customer products the need emerges for models to efficiently run on embedded, mobile hardware. Slimmer models have therefore become a hot research topic with various approaches which vary from binary networks to revised convolution layers. We offer our contribution to the latter and propose a novel convolution block which significantly reduces the computational burden while surpassing the current state-of-the-art. Our model, dubbed EffNet, is optimised for models which are slim to begin with and is created to tackle issues in existing models such as MobileNet and ShuffleNet.

PaperPDFCode

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Code

andrijdavid/EffNet mentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

1x1 ConvolutionAverage PoolingBatch NormalizationChannel ShuffleConvolutionDense ConnectionsDepthwise ConvolutionDepthwise Separable ConvolutionGlobal Average PoolingMax PoolingMobileNetV1Pointwise ConvolutionReLUResidual ConnectionShuffleNetShuffleNet BlockSoftmax

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