REVIEW 4 cited by
Searching for MobileNetV3
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
read the original abstract
We present the next generation of MobileNets based on a combination of complementary search techniques as well as a novel architecture design. MobileNetV3 is tuned to mobile phone CPUs through a combination of hardware-aware network architecture search (NAS) complemented by the NetAdapt algorithm and then subsequently improved through novel architecture advances. This paper starts the exploration of how automated search algorithms and network design can work together to harness complementary approaches improving the overall state of the art. Through this process we create two new MobileNet models for release: MobileNetV3-Large and MobileNetV3-Small which are targeted for high and low resource use cases. These models are then adapted and applied to the tasks of object detection and semantic segmentation. For the task of semantic segmentation (or any dense pixel prediction), we propose a new efficient segmentation decoder Lite Reduced Atrous Spatial Pyramid Pooling (LR-ASPP). We achieve new state of the art results for mobile classification, detection and segmentation. MobileNetV3-Large is 3.2\% more accurate on ImageNet classification while reducing latency by 15\% compared to MobileNetV2. MobileNetV3-Small is 4.6\% more accurate while reducing latency by 5\% compared to MobileNetV2. MobileNetV3-Large detection is 25\% faster at roughly the same accuracy as MobileNetV2 on COCO detection. MobileNetV3-Large LR-ASPP is 30\% faster than MobileNetV2 R-ASPP at similar accuracy for Cityscapes segmentation.
Forward citations
Cited by 4 Pith papers
-
MSQ: Memory-Efficient Bit Sparsification Quantization
MSQ computes and prunes least significant bits of weights directly from the full-precision parameters, cutting training memory and time for mixed-precision quantization compared with bit-splitting methods.
-
StixelNExT++: Lightweight Monocular Scene Segmentation and Representation for Collective Perception
A monocular neural network predicts 3D Stixels directly from RGB images in about 10 ms, with a self-defined Waymo evaluation showing competitive performance within 30 m.
-
Latent Sensor Fusion: Multimedia Learning of Physiological Signals for Resource-Constrained Devices
A single image-pretrained VQ-VAE encoder, applied to spectrograms of six physiological signals, matches a modality-specific fusion baseline on WESAD stress classification while using less compute and memory.
-
Finding Optimal Kernel Size and Dimension in Convolutional Neural Networks An Architecture Optimization Approach
A proposed BKSEF heuristic for layer-wise CNN kernel sizes is presented, but the formula is ad hoc and the reported validation is missing from the paper.
Discussion (0). Sign in to comment.