ShuffleNet-An-Extremely-Efficient-CNN-for-Mobile-Devices-Caffe-Reimplementation
Caffe re-implementation of ShuffleNet [STILL UNDER TEST]
view repo
We introduce an extremely computation-efficient CNN architecture named ShuffleNet, which is designed specially for mobile devices with very limited computing power (e.g., 10-150 MFLOPs). The new architecture utilizes two new operations, pointwise group convolution and channel shuffle, to greatly reduce computation cost while maintaining accuracy. Experiments on ImageNet classification and MS COCO object detection demonstrate the superior performance of ShuffleNet over other structures, e.g. lower top-1 error (absolute 7.8 the computation budget of 40 MFLOPs. On an ARM-based mobile device, ShuffleNet achieves 13x actual speedup over AlexNet while maintaining comparable accuracy.
READ FULL TEXT VIEW PDF
An increasing need of running Convolutional Neural Network (CNN) models ...
read it
Lightweight convolutional neural networks (e.g., MobileNets) are specifi...
read it
Extremely efficient convolutional neural network architectures are one o...
read it
In this paper, we present a class of extremely efficient CNN models call...
read it
The Winograd or Cook-Toom class of algorithms help to reduce the overall...
read it
Mobile computing is one of the main drivers of innovation, yet the futur...
read it
Convolutional Neural Network (CNN) is the state-of-the-art algorithm of ...
read it
Caffe re-implementation of ShuffleNet [STILL UNDER TEST]
ShuffleNet in PyTorch. Based on https://arxiv.org/abs/1707.01083
Building deeper and larger convolutional neural networks (CNNs) is a primary trend for solving major visual recognition tasks [21, 9, 33, 5, 28, 24]. The most accurate CNNs usually have hundreds of layers and thousands of channels [9, 34, 32, 40], thus requiring computation at billions of FLOPs. This report examines the opposite extreme: pursuing the best accuracy in very limited computational budgets at tens or hundreds of MFLOPs, focusing on common mobile platforms such as drones, robots, and smartphones. Note that many existing works [16, 22, 43, 42, 38, 27] focus on pruning, compressing, or low-bit representing a “basic” network architecture. Here we aim to explore a highly efficient basic architecture specially designed for our desired computing ranges.
We notice that state-of-the-art basic architectures such as Xception [3] and ResNeXt [40] become less efficient in extremely small networks because of the costly dense convolutions. We propose using pointwise group convolutions to reduce computation complexity of convolutions. To overcome the side effects brought by group convolutions, we come up with a novel channel shuffle operation to help the information flowing across feature channels. Based on the two techniques, we build a highly efficient architecture called ShuffleNet. Compared with popular structures like [30, 9, 40], for a given computation complexity budget, our ShuffleNet allows more feature map channels, which helps to encode more information and is especially critical to the performance of very small networks.
We evaluate our models on the challenging ImageNet classification [4, 29] and MS COCO object detection [23] tasks. A series of controlled experiments shows the effectiveness of our design principles and the better performance over other structures. Compared with the state-of-the-art architecture MobileNet [12], ShuffleNet achieves superior performance by a significant margin, e.g. absolute 7.8% lower ImageNet top-1 error at level of 40 MFLOPs.
We also examine the speedup on real hardware, i.e. an off-the-shelf ARM-based computing core. The ShuffleNet model achieves 13 actual speedup (theoretical speedup is 18) over AlexNet [21] while maintaining comparable accuracy.
The last few years have seen the success of deep neural networks in computer vision tasks
[21, 36, 28], in which model designs play an important role. The increasing needs of running high quality deep neural networks on embedded devices encourage the study on efficient model designs [8]. For example, GoogLeNet [33] increases the depth of networks with much lower complexity compared to simply stacking convolution layers. SqueezeNet [14] reduces parameters and computation significantly while maintaining accuracy. ResNet [9, 10] utilizes the efficient bottleneck structure to achieve impressive performance. SENet [13] introduces an architectural unit that boosts performance at slight computation cost. Concurrent with us, a very recent work [46]employs reinforcement learning and model search to explore efficient model designs. The proposed mobile
NASNet model achieves comparable performance with our counterpart ShuffleNet model (26.0% @ 564 MFLOPs vs. 26.3% @ 524 MFLOPs for ImageNet classification error). But [46] do not report results on extremely tiny models (e.g. complexity less than 150 MFLOPs), nor evaluate the actual inference time on mobile devices.The concept of group convolution, which was first introduced in AlexNet [21] for distributing the model over two GPUs, has been well demonstrated its effectiveness in ResNeXt [40]. Depthwise separable convolution proposed in Xception [3] generalizes the ideas of separable convolutions in Inception series [34, 32]. Recently, MobileNet [12] utilizes the depthwise separable convolutions and gains state-of-the-art results among lightweight models. Our work generalizes group convolution and depthwise separable convolution in a novel form.
To the best of our knowledge, the idea of channel shuffle operation is rarely mentioned in previous work on efficient model design, although CNN library cuda-convnet [20] supports “random sparse convolution” layer, which is equivalent to random channel shuffle followed by a group convolutional layer. Such “random shuffle” operation has different purpose and been seldom exploited later. Very recently, another concurrent work [41] also adopt this idea for a two-stage convolution. However, [41] did not specially investigate the effectiveness of channel shuffle itself and its usage in tiny model design.
This direction aims to accelerate inference while preserving accuracy of a pre-trained model. Pruning network connections [6, 7] or channels [38] reduces redundant connections in a pre-trained model while maintaining performance. Quantization [31, 27, 39, 45, 44] and factorization [22, 16, 18, 37] are proposed in literature to reduce redundancy in calculations to speed up inference. Without modifying the parameters, optimized convolution algorithms implemented by FFT [25, 35] and other methods [2] decrease time consumption in practice. Distilling [11] transfers knowledge from large models into small ones, which makes training small models easier.
Modern convolutional neural networks [30, 33, 34, 32, 9, 10] usually consist of repeated building blocks with the same structure. Among them, state-of-the-art networks such as Xception [3] and ResNeXt [40] introduce efficient depthwise separable convolutions or group convolutions into the building blocks to strike an excellent trade-off between representation capability and computational cost. However, we notice that both designs do not fully take the convolutions (also called pointwise convolutions in [12]) into account, which require considerable complexity. For example, in ResNeXt [40] only layers are equipped with group convolutions. As a result, for each residual unit in ResNeXt the pointwise convolutions occupy 93.4% multiplication-adds (cardinality = 32 as suggested in [40]). In tiny networks, expensive pointwise convolutions result in limited number of channels to meet the complexity constraint, which might significantly damage the accuracy.
To address the issue, a straightforward solution is to apply channel sparse connections, for example group convolutions, also on layers. By ensuring that each convolution operates only on the corresponding input channel group, group convolution significantly reduces computation cost. However, if multiple group convolutions stack together, there is one side effect: outputs from a certain channel are only derived from a small fraction of input channels. Fig 1 (a) illustrates a situation of two stacked group convolution layers. It is clear that outputs from a certain group only relate to the inputs within the group. This property blocks information flow between channel groups and weakens representation.
If we allow group convolution to obtain input data from different groups (as shown in Fig 1 (b)), the input and output channels will be fully related. Specifically, for the feature map generated from the previous group layer, we can first divide the channels in each group into several subgroups, then feed each group in the next layer with different subgroups. This can be efficiently and elegantly implemented by a channel shuffle operation (Fig 1 (c)): suppose a convolutional layer with groups whose output has channels; we first reshape the output channel dimension into , transposing and then flattening it back as the input of next layer. Note that the operation still takes effect even if the two convolutions have different numbers of groups. Moreover, channel shuffle is also differentiable, which means it can be embedded into network structures for end-to-end training.
Channel shuffle operation makes it possible to build more powerful structures with multiple group convolutional layers. In the next subsection we will introduce an efficient network unit with channel shuffle and group convolution.
Layer | Output size | KSize | Stride | Repeat | Output channels ( groups) | ||||
Image | 3 | 3 | 3 | 3 | 3 | ||||
Conv1 | 2 | 1 | 24 | 24 | 24 | 24 | 24 | ||
MaxPool | 2 | ||||||||
Stage2 | 2 | 1 | 144 | 200 | 240 | 272 | 384 | ||
1 | 3 | 144 | 200 | 240 | 272 | 384 | |||
Stage3 | 2 | 1 | 288 | 400 | 480 | 544 | 768 | ||
1 | 7 | 288 | 400 | 480 | 544 | 768 | |||
Stage4 | 2 | 1 | 576 | 800 | 960 | 1088 | 1536 | ||
1 | 3 | 576 | 800 | 960 | 1088 | 1536 | |||
GlobalPool | |||||||||
FC | 1000 | 1000 | 1000 | 1000 | 1000 | ||||
Complexity | 143M | 140M | 137M | 133M | 137M |
Model | Complexity | Classification error (%) | ||||
---|---|---|---|---|---|---|
(MFLOPs) | ||||||
ShuffleNet 1 | 140 | 33.6 | 32.7 | 32.6 | 32.8 | 32.4 |
ShuffleNet 0.5 | 38 | 45.1 | 44.4 | 43.2 | 41.6 | 42.3 |
ShuffleNet 0.25 | 13 | 57.1 | 56.8 | 55.0 | 54.2 | 52.7 |
Taking advantage of the channel shuffle operation, we propose a novel ShuffleNet unit specially designed for small networks. We start from the design principle of bottleneck unit [9] in Fig 2 (a). It is a residual block. In its residual branch, for the layer, we apply a computational economical depthwise convolution [3] on the bottleneck feature map. Then, we replace the first layer with pointwise group convolution followed by a channel shuffle operation, to form a ShuffleNet unit, as shown in Fig 2
(b). The purpose of the second pointwise group convolution is to recover the channel dimension to match the shortcut path. For simplicity, we do not apply an extra channel shuffle operation after the second pointwise layer as it results in comparable scores. The usage of batch normalization (BN)
[15] and nonlinearity is similar to [9, 40], except that we do not use ReLU after depthwise convolution as suggested by
[3]. As for the case where ShuffleNet is applied with stride, we simply make two modifications (see Fig 2 (c)): (i) add a average pooling on the shortcut path; (ii) replace the element-wise addition with channel concatenation, which makes it easy to enlarge channel dimension with little extra computation cost.Thanks to pointwise group convolution with channel shuffle, all components in ShuffleNet unit can be computed efficiently. Compared with ResNet [9] (bottleneck design) and ResNeXt [40], our structure has less complexity under the same settings. For example, given the input size and the bottleneck channels , ResNet unit requires FLOPs and ResNeXt has FLOPs, while our ShuffleNet unit requires only FLOPs, where means the number of groups for convolutions. In other words, given a computational budget, ShuffleNet can use wider feature maps. We find this is critical for small networks, as tiny networks usually have an insufficient number of channels to process the information.
In addition, in ShuffleNet depthwise convolution only performs on bottleneck feature maps. Even though depthwise convolution usually has very low theoretical complexity, we find it difficult to efficiently implement on low-power mobile devices, which may result from a worse computation/memory access ratio compared with other dense operations. Such drawback is also referred in [3]
, which has a runtime library based on TensorFlow
[1]. In ShuffleNet units, we intentionally use depthwise convolution only on bottleneck in order to prevent overhead as much as possible.Built on ShuffleNet units, we present the overall ShuffleNet architecture in Table 1. The proposed network is mainly composed of a stack of ShuffleNet units grouped into three stages. The first building block in each stage is applied with stride = 2. Other hyper-parameters within a stage stay the same, and for the next stage the output channels are doubled. Similar to [9], we set the number of bottleneck channels to 1/4 of the output channels for each ShuffleNet unit. Our intent is to provide a reference design as simple as possible, although we find that further hyper-parameter tunning might generate better results.
In ShuffleNet units, group number controls the connection sparsity of pointwise convolutions. Table 1 explores different group numbers and we adapt the output channels to ensure overall computation cost roughly unchanged (140 MFLOPs). Obviously, larger group numbers result in more output channels (thus more convolutional filters) for a given complexity constraint, which helps to encode more information, though it might also lead to degradation for an individual convolutional filter due to limited corresponding input channels. In Sec 4.1.1 we will study the impact of this number subject to different computational constrains.
To customize the network to a desired complexity, we can simply apply a scale factor on the number of channels. For example, we denote the networks in Table 1 as ”ShuffleNet 1”, then ”ShuffleNet ” means scaling the number of filters in ShuffleNet 1 by times thus overall complexity will be roughly times of ShuffleNet 1.
Model | Cls err. (%, no shuffle) | Cls err. (%, shuffle) | err. (%) |
---|---|---|---|
ShuffleNet 1x () | 34.5 | 32.6 | 1.9 |
ShuffleNet 1x () | 37.6 | 32.4 | 5.2 |
ShuffleNet 0.5x () | 45.7 | 43.2 | 2.5 |
ShuffleNet 0.5x () | 48.1 | 42.3 | 5.8 |
ShuffleNet 0.25x () | 56.3 | 55.0 | 1.3 |
ShuffleNet 0.25x () | 56.5 | 52.7 | 3.8 |
We mainly evaluate our models on the ImageNet 2012 classification dataset [29, 4]. We follow most of the training settings and hyper-parameters used in [40], with two exceptions: (i) we set the weight decay to 4e-5 instead of 1e-4 and use linear-decay learning rate policy (decreased from 0.5 to 0); (ii) we use slightly less aggressive scale augmentation for data preprocessing. Similar modifications are also referenced in [12] because such small networks usually suffer from underfitting rather than overfitting. It takes 1 or 2 days to train a model for iterations on 4 GPUs, whose batch size is set to 1024. To benchmark, we compare single crop top-1 performance on ImageNet validation set, i.e. cropping center view from input image and evaluating classification accuracy. We use exactly the same settings for all models to ensure fair comparisons.
The core idea of ShuffleNet lies in pointwise group convolution and channel shuffle operation. In this subsection we evaluate them respectively.
To evaluate the importance of pointwise group convolutions, we compare ShuffleNet models of the same complexity whose numbers of groups range from 1 to 8. If the group number equals 1, no pointwise group convolution is involved and then the ShuffleNet unit becomes an ”Xception-like” [3] structure. For better understanding, we also scale the width of the networks to 3 different complexities and compare their classification performance respectively. Results are shown in Table 2.
From the results, we see that models with group convolutions () consistently perform better than the counterparts without pointwise group convolutions (). Smaller models tend to benefit more from groups. For example, for ShuffleNet 1 the best entry () is 1.2% better than the counterpart, while for ShuffleNet 0.5 and 0.25 the gaps become 3.5% and 4.4% respectively. Note that group convolution allows more feature map channels for a given complexity constraint, so we hypothesize that the performance gain comes from wider feature maps which help to encode more information. In addition, a smaller network involves thinner feature maps, meaning it benefits more from enlarged feature maps.
Table 2 also shows that for some models (e.g. ShuffleNet 0.5) when group numbers become relatively large (e.g. ), the classification score saturates or even drops. With an increase in group number (thus wider feature maps), input channels for each convolutional filter become fewer, which may harm representation capability. Interestingly, we also notice that for smaller models such as ShuffleNet 0.25 larger group numbers tend to better results consistently, which suggests wider feature maps bring more benefits for smaller models.
The purpose of shuffle operation is to enable cross-group information flow for multiple group convolution layers. Table 3 compares the performance of ShuffleNet structures (group number is set to 3 or 8 for instance) with/without channel shuffle. The evaluations are performed under three different scales of complexity. It is clear that channel shuffle consistently boosts classification scores for different settings. Especially, when group number is relatively large (e.g. ), models with channel shuffle outperform the counterparts by a significant margin, which shows the importance of cross-group information interchange.
Complexity (MFLOPs) | VGG-like | ResNet | Xception-like | ResNeXt | ShuffleNet (ours) |
---|---|---|---|---|---|
140 | 50.7 | 37.3 | 33.6 | 33.3 | 32.4 (1, ) |
38 | - | 48.8 | 45.1 | 46.0 | 41.6 (0.5, ) |
13 | - | 63.7 | 57.1 | 65.2 | 52.7 (0.25, ) |
Model | Complexity (MFLOPs) | Cls err. (%) | err. (%) |
---|---|---|---|
1.0 MobileNet-224 | 569 | 29.4 | - |
ShuffleNet 2 () | 524 | 26.3 | 3.1 |
ShuffleNet 2 (with SE[13], ) | 527 | 24.7 | 4.7 |
0.75 MobileNet-224 | 325 | 31.6 | - |
ShuffleNet 1.5 () | 292 | 28.5 | 3.1 |
0.5 MobileNet-224 | 149 | 36.3 | - |
ShuffleNet 1 () | 140 | 32.4 | 3.9 |
0.25 MobileNet-224 | 41 | 49.4 | - |
ShuffleNet 0.5 () | 38 | 41.6 | 7.8 |
ShuffleNet 0.5 (shallow, ) | 40 | 42.8 | 6.6 |
Model | Cls err. (%) | Complexity (MFLOPs) |
---|---|---|
VGG-16 [30] | 28.5 | 15300 |
ShuffleNet 2 () | 26.3 | 524 |
GoogleNet [33]* | 31.3 | 1500 |
ShuffleNet 1 () | 32.4 | 140 |
AlexNet [21] | 42.8 | 720 |
SqueezeNet [14] | 42.5 | 833 |
ShuffleNet 0.5 () | 41.6 | 38 |
Recent leading convolutional units in VGG [30], ResNet [9], GoogleNet [33], ResNeXt [40] and Xception [3] have pursued state-of-the-art results with large models (e.g. GFLOPs), but do not fully explore low-complexity conditions. In this section we survey a variety of building blocks and make comparisons with ShuffleNet under the same complexity constraint.
For fair comparison, we use the overall network architecture as shown in Table 1. We replace the ShuffleNet units in Stage 2-4 with other structures, then adapt the number of channels to ensure the complexity remains unchanged. The structures we explored include:
ResNet. We adopt the ”bottleneck” design in our experiment, which has been demonstrated more efficient in [9] . Same as [9], the bottleneck ratio^{1}^{1}1In the bottleneck-like units (like ResNet, ResNeXt or ShuffleNet) bottleneck ratio implies the ratio of bottleneck channels to output channels. For example, bottleneck ratio = means the output feature map is 4 times the width of the bottleneck feature map. is also .
Xception-like. The original structure proposed in [3] involves fancy designs or hyper-parameters for different stages, which we find difficult for fair comparison on small models. Instead, we remove the pointwise group convolutions and channel shuffle operation from ShuffleNet (also equivalent to ShuffleNet with ). The derived structure shares the same idea of “depthwise separable convolution” as in [3], which is called an Xception-like structure here.
ResNeXt. We use the settings of cardinality and bottleneck ratio as suggested in [40]. We also explore other settings, e.g. bottleneck ratio , and get similar results.
Model | mAP (300 image) | mAP (600 image) |
---|---|---|
ShuffleNet 2 () | 18.7% | 25.0% |
ShuffleNet 1 () | 14.5% | 19.8% |
1.0 MobileNet-224 [12] | 16.4% | 19.8% |
1.0 MobileNet-224 (our impl.) | 14.9% | 19.3% |
Model | Cls err. (%) | FLOPs | |||
---|---|---|---|---|---|
ShuffleNet 0.5 () | 43.2 | 38M | 15.2ms | 87.4ms | 260.1ms |
ShuffleNet 1 () | 32.6 | 140M | 37.8ms | 222.2ms | 684.5ms |
ShuffleNet 2 () | 26.3 | 524M | 108.8ms | 617.0ms | 1857.6ms |
AlexNet [21] | 42.8 | 720M | 184.0ms | 1156.7ms | 3633.9ms |
1.0 MobileNet-224 [12] | 29.4 | 569M | 110.0ms | 612.0ms | 1879.2ms |
We use exactly the same settings to train these models. Results are shown in Table 4. Our ShuffleNet models outperform most others by a significant margin under different complexities. Interestingly, we find an empirical relationship between feature map channels and classification accuracy. For example, under the complexity of 38 MFLOPs, output channels of Stage 4 (see Table 1) for VGG-like, ResNet, ResNeXt, Xception-like, ShuffleNet models are 50, 192, 192, 288, 576 respectively, which is consistent with the increase of accuracy. Since the efficient design of ShuffleNet, we can use more channels for a given computation budget, thus usually resulting in better performance.
Note that the above comparisons do not include GoogleNet or Inception series [33, 34, 32]
. We find it nontrivial to generate such Inception structures to small networks because the original design of Inception module involves too many hyper-parameters. As a reference, the first GoogleNet version
[33] has 31.3% top-1 error at the cost of 1.5 GFLOPs (See Table 6). More sophisticated Inception versions [34, 32] are more accurate, however, involve significantly increased complexity. Recently, Kim et al. propose a lightweight network structure named PVANET [19] which adopts Inception units. Our reimplemented PVANET (with 224224 input size) has 29.7% classification error with a computation complexity of 557 MFLOPs, while our ShuffleNet 2x model () gets 26.3% with 524 MFLOPs (see Table 6).Recently Howard et al. have proposed MobileNets [12] which mainly focus on efficient network architecture for mobile devices. MobileNet takes the idea of depthwise separable convolution from [3] and achieves state-of-the-art results on small models.
Table 5 compares classification scores under a variety of complexity levels. It is clear that our ShuffleNet models are superior to MobileNet for all the complexities. Though our ShuffleNet network is specially designed for small models ( MFLOPs), we find it is still better than MobileNet for higher computation cost, e.g. 3.1% more accurate than MobileNet 1 at the cost of 500 MFLOPs. For smaller networks (40 MFLOPs) ShuffleNet surpasses MobileNet by 7.8%. Note that our ShuffleNet architecture contains 50 layers while MobileNet only has 28 layers. For better understanding, we also try ShuffleNet on a 26-layer architecture by removing half of the blocks in Stage 2-4 (see ”ShuffleNet 0.5 shallow ()” in Table 5). Results show that the shallower model is still significantly better than the corresponding MobileNet, which implies that the effectiveness of ShuffleNet mainly results from its efficient structure, not the depth.
Table 6 compares our ShuffleNet with a few popular models. Results show that with similar accuracy ShuffleNet is much more efficient than others. For example, ShuffleNet 0.5 is theoretically 18 faster than AlexNet [21] with comparable classification score. We will evaluate the actual running time in Sec 4.5.
It is also worth noting that the simple architecture design makes it easy to equip ShuffeNets with the latest advances such as [13, 26]. For example, in [13] the authors propose Squeeze-and-Excitation (SE) blocks which achieve state-of-the-art results on large ImageNet models. We find SE modules also take effect in combination with the backbone ShuffleNets, for instance, boosting the top-1 error of ShuffleNet 2 to 24.7% (shown in Table 5). Interestingly, though negligible increase of theoretical complexity, we find ShuffleNets with SE modules are usually slower than the “raw” ShuffleNets on mobile devices, which implies that actual speedup evaluation is critical on low-cost architecture design. In Sec 4.5 we will make further discussion.
To evaluate the generalization ability for transfer learning, we test our ShuffleNet model on the task of MS COCO object detection
[23]. We adopt Faster-RCNN [28]as the detection framework and use the publicly released Caffe code
[28, 17] for training with default settings. Similar to [12], the models are trained on the COCO train+val dataset excluding 5000 minival images and we conduct testing on the minival set. Table 7 shows the comparison of results trained and evaluated on two input resolutions. Comparing ShuffleNet 2 with MobileNet whose complexity are comparable (524 vs. 569 MFLOPs), our ShuffleNet 2 surpasses MobileNet by a significant margin on both resolutions; our ShuffleNet 1 also achieves comparable results with MobileNet on 600 resolution, but has 4 complexity reduction. We conjecture that this significant gain is partly due to ShuffleNet’s simple design of architecture without bells and whistles.Finally, we evaluate the actual inference speed of ShuffleNet models on a mobile device with an ARM platform. Though ShuffleNets with larger group numbers (e.g. or ) usually have better performance, we find it less efficient in our current implementation. Empirically usually has a proper trade-off between accuracy and actual inference time. As shown in Table 8, three input resolutions are exploited for the test. Due to memory access and other overheads, we find every 4 theoretical complexity reduction usually results in 2.6 actual speedup in our implementation. Nevertheless, compared with AlexNet [21] our ShuffleNet 0.5 model still achieves 13 actual speedup under comparable classification accuracy (the theoretical speedup is 18), which is much faster than previous AlexNet-level models or speedup approaches such as [14, 16, 22, 42, 43, 38].
Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on
, pages 248–255. IEEE, 2009.Expectation backpropagation: Parameter-free training of multilayer neural networks with continuous or discrete weights.
In Advances in Neural Information Processing Systems, pages 963–971, 2014.
Comments
There are no comments yet.