Papers › FD-MobileNet: Improved MobileNet with a Fast Downsampling Strategy

FD-MobileNet: Improved MobileNet with a Fast Downsampling Strategy

11 Feb 2018arXiv:1802.03750archive 2025-07-28

Zheng Qin, Zhaoning Zhang, Xiaotao Chen, Yuxing Peng

We present Fast-Downsampling MobileNet (FD-MobileNet), an efficient and accurate network for very limited computational budgets (e.g., 10-140 MFLOPs). Our key idea is applying an aggressive downsampling strategy to MobileNet framework. In FD-MobileNet, we perform 32× downsampling within 12 layers, only half the layers in the original MobileNet. This design brings three advantages: (i) It remarkably reduces the computational cost. (ii) It increases the information capacity and achieves significant performance improvements. (iii) It is engineering-friendly and provides fast actual inference speed. Experiments on ILSVRC 2012 and PASCAL VOC 2007 datasets demonstrate that FD-MobileNet consistently outperforms MobileNet and achieves comparable results with ShuffleNet under different computational budgets, for instance, surpassing MobileNet by 5.5% on the ILSVRC 2012 top-1 accuracy and 3.6% on the VOC 2007 mAP under a complexity of 12 MFLOPs. On an ARM-based device, FD-MobileNet achieves 1.11× inference speedup over MobileNet and 1.82× over ShuffleNet under the same complexity.

PaperPDFCode

Syntology This paper's arXiv id is not in Syntology's Atlas id list (549,449 ids, as this build read them; the read time is in the build record), so this page links to no Syntology page for it. The list is not the whole graph; Syntology's feed shows papers as they enter the graph.

Code

ARM-software/DeepFreeze mentioned on GitHubtfSyntology: not harvested report
osmr/imgclsmob mentioned on GitHubmxnetMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to ResNeSt: Split-Attention Networks (arXiv:2004.08955; that paper's own run record: 28 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 0 violated, 21 with no contract checked; 7 where Syntology's instrument failed) · 20 unverified); nothing checks that they implement this paper's method. report
code-implementation1/Code5 mindsporeSyntology: not harvested 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.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

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

Average PoolingBatch NormalizationChannel ShuffleConvolutionDense ConnectionsDepthwise ConvolutionGlobal Average PoolingMax PoolingPointwise 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