当前位置:网站首页>【MobileNet V3】《Searching for MobileNetV3》
【MobileNet V3】《Searching for MobileNetV3》
2022-07-02 07:48:00 【bryant_ meng】


ICCV-2019
List of articles
1 Background and Motivation
【MobileNet】《MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications》(CVPR-2017)
【MobileNet V2】《MobileNetV2:Inverted Residuals and Linear Bottlenecks》(CVPR-2018)
deliver the next generation of high accuracy efficient neural network models to power on-device computer vision
2 Related Work
Manually design the network
reducing the number of parameters -> reducing the number of operations (MAdds) -> reducing the actual measured latencyNAS
cell level -> block levelQuantization
knowledge distillation
3 Advantages / Contributions
NAS + Manually design and assemble mobilenet v3 backbone, Put forward hard swish Activation function (swish Improved version ), Put forward Lite R-ASPP Split head (R-ASPP Improved version ), In the classification 、 object detection 、 The speed and accuracy of segmented data sets are improved
4 Method
1)Network Search
Platform-Aware NAS for Blockwise Search( come from MnastNet, A little modification reward design The weight of )
NetAdapt for Layerwise Search
search per layer for the number of filters
maximizes △ A c c △ l a t e n c y \frac{\bigtriangleup Acc}{\bigtriangleup latency} △latency△Acc
2)Network Improvements
Redesigning Expensive Layers
search The back of the network is heavy , optimized
Head
channels 32 + ReLU or swish Reduced to channels 16 + hard swish
The tail

Nonlinearities

s w i s h ( x ) = x ⋅ σ ( x ) swish(x) = x \cdot \sigma(x) swish(x)=x⋅σ(x)
swish activation function Although it improves the accuracy of the network , But it is not friendly to hardware deployment , Increased computing time , The author adopts the following improvements (piece-wise linear)
h − s w i s h ( x ) = x R e L U 6 ( x + 3 ) 6 h-swish(x) = x \frac{ReLU6(x+3)}{6} h−swish(x)=x6ReLU6(x+3)
Than relu Slow
only use h-swish at the second half of the model(we find that most of the benefits swish are realized by using them only in the deeper layers)
Large squeeze-and-excite

v3 Compared with v2, Adopted SE modular ,SE Inside sigmoid It's also used hard form , That is to say R e L U 6 ( x + 3 ) 6 \frac{ReLU6(x+3)}{6} 6ReLU6(x+3)

The author put SE Module squeeze fc Fixed to block in expand Of channels 1/4( chart 4 red √ It's about )
no discernible latency cost
MobileNetV3 Definitions

The picture is from Lightweight skeleton preferred :MobileNetV3 Complete resolution 

5 Experiments
use single-threaded large core in all our measurements
5.1 Datasets
- ImageNet
- COCO
- Cityscapes
5.2 Classification


The upper left corner is best




1)Impact of non-linearities
there 112 What you read is not particularly understood ,N The bigger it is, the more reasonable it is h-swish The more , It's slower , How fast
2)Impact of other components
5.3 Detection

mAP Out of line , ha-ha
5.4 Segmentation
R-ASPP Improve on the basis of 


6 Conclusion(own) / Future work
Pareto-optimal, Pareto is the best ( From Baidu Encyclopedia )
Pareto is the best (Pareto Optimality), Also known as Pareto efficiency (Pareto efficiency), It refers to an ideal state of resource allocation , Suppose there is an inherent group of people and distributable resources , The change from one allocation state to another , Without making anyone worse , Make at least one person better , This is Pareto improvement or Pareto optimization .
Pareto optimal state It is impossible to have more room for Pareto improvement ; let me put it another way , Pareto improvement is the path and method to achieve Pareto optimality . Pareto optimality is fair and efficient “ Ideal kingdom ”. It was proposed by Pareto .MobileNet V3 = MobileNet v2 + SE + hard-swish activation + half initial layers channel & last block do global average pooling first( come from Gai Rou is in a panic )
边栏推荐
- 【深度学习系列(八)】:Transoform原理及实战之原理篇
- Faster-ILOD、maskrcnn_ Benchmark trains its own VOC data set and problem summary
- Timeout docking video generation
- PointNet理解(PointNet实现第4步)
- win10解决IE浏览器安装不上的问题
- Using MATLAB to realize: power method, inverse power method (origin displacement)
- Conversion of numerical amount into capital figures in PHP
- How to clean up logs on notebook computers to improve the response speed of web pages
- Handwritten call, apply, bind
- 使用百度网盘上传数据到服务器上
猜你喜欢

ModuleNotFoundError: No module named ‘pytest‘
![[in depth learning series (8)]: principles of transform and actual combat](/img/2e/89920de2273b6f1bc3b21a19c2ecbe.png)
[in depth learning series (8)]: principles of transform and actual combat

【Programming】

Using compose to realize visible scrollbar

How to clean up logs on notebook computers to improve the response speed of web pages

程序的内存模型
![[Bert, gpt+kg research] collection of papers on the integration of Pretrain model with knowledge](/img/2e/e74d7a9efbf9fe617f4d7b46867c0a.png)
[Bert, gpt+kg research] collection of papers on the integration of Pretrain model with knowledge

Faster-ILOD、maskrcnn_benchmark训练自己的voc数据集及问题汇总

【DIoU】《Distance-IoU Loss:Faster and Better Learning for Bounding Box Regression》

《Handwritten Mathematical Expression Recognition with Bidirectionally Trained Transformer》论文翻译
随机推荐
【AutoAugment】《AutoAugment:Learning Augmentation Policies from Data》
Implementation of yolov5 single image detection based on pytorch
Open failed: enoent (no such file or directory) / (operation not permitted)
PointNet原理证明与理解
Translation of the paper "written mathematical expression recognition with bidirectionally trained transformer"
win10解决IE浏览器安装不上的问题
parser. parse_ Args boolean type resolves false to true
Interpretation of ernie1.0 and ernie2.0 papers
程序的内存模型
Mmdetection model fine tuning
Faster-ILOD、maskrcnn_ Benchmark training coco data set and problem summary
【DIoU】《Distance-IoU Loss:Faster and Better Learning for Bounding Box Regression》
TimeCLR: A self-supervised contrastive learning framework for univariate time series representation
【TCDCN】《Facial landmark detection by deep multi-task learning》
Ppt skills
【双目视觉】双目立体匹配
conda常用命令
CONDA creates, replicates, and shares virtual environments
[introduction to information retrieval] Chapter 7 scoring calculation in search system
Semi supervised mixpatch