1 Introduction and Motivation
The success of deep neural networks (DNNs) encourages extensive applications on various types of platforms,e.g., self-driving cars and VR headsets. To overcome the hardware constraints, DNN model compression techniques, from learning based [1, 2, 3] to network architecture design [4, 5, 6], recently attracted a lot of attention. Interestingly, most of these extremely compact DNN models do not show accuracy drop on image classification. A critical question emerges, however, other than classifying images on a single dataset, whether the compression methods hurt DNN’s learning ability.
In this work, we attempt to bridge the gap between compressed DNN architecture and its domain adaptation (DA) ability. The DA ability is to evaluate whether a machine learning model can capture thecovariate shift  between source and target domains, and adapt itself to remove the divergence. A model with outstanding semi-supervised or unsupervised DA ability can greatly reduce the requirement of manually labeled examples for real-world applications.
|AlexNet ||61 M||57.2||73.0||96.4||99.2|
|FaConvNet ||2.8 M||70.1||71.8||94.3||98.1|
|SqueezeNet ||1.2 M||57.5||64.4||92.8||96.4|
We observe DA accuracy degradation from model compression methods based on architecture design, e.g., a DNN with GoogLeNet-level  classification accuracy only obtains AlexNet-level  DA accuracy. Table 1 shows our experimental results. SqueezeNet  and FaConvNet 
are used to compare with AlexNet as they are respectively the smallest DNN model achieving AlexNet-level and GoogLeNet-level accuracy on image classification, to our best knowledge. The popular dataset ImageNet’12 is adopted as image classification benchmark. Three standard DA tasks on Office-31  dataset are adopted, and the unsupervised DA method used for all DNNs in Table 1 is GRL . The DNNs are pre-trained on ImageNet’12, and then fine-tuned for all DA tasks. There is a big DA accuracy difference between AlexNet and SqueezeNet though the two networks have almost the same classification accuracy. FaConvNet, which outperforms AlexNet by 12.9% on classification, also slightly lags behind AlexNet on DA.
Intuitively, increasing parameters will lead to better accuracy. Our following experiment shows that the DA accuracy of SqueezeNet and FaConvNet can be improved, but can not reach the same level as their classification by solely boosting parameter numbers. Specifically, without changing the structure of the two models, we increase the parameters of FaConvNet and SqueezeNet. The basic modules respectively adopted in FaConvNet and SqueezeNet are first compared, as shown in Figure 1. The shared feature of these two modules is the “bottleneck” layer conv 11 as denoted in bold. We hence gradually increase parameters of all “bottleneck” layers in FaConvNet and SqueezeNet until no DA accuracy benefit could be obtained. The parameters in other layers (e.g., the first convolutional layer in FaConvNet and SqueezeNet) are then increased until no accuracy gain. The final DA accuracy of the adapted models Rev-FaConvNet and Rev-SqueezeNet are respectively shown in Table 1. Our expectation is that Rev-FaConvNet’s accuracy can be much higher than AlexNet. Rev-FaConvNet, however, only slightly outperforms AlexNet, with almost 70% more parameters.
The objective of this work is to develop a compact DNN architecture which can achieve the same level accuracy on classification and DA. Our solution offers four important features. First, our DNN has 4.1M parameters, which is only 6.7% of AlexNet or 59% of GoogLeNet. The compactness of our network can be attributed to the use of a new module Conv-M which is a parameter-saving module, while extract more details based on multi-scale convolution and deconvolution, inspired by GoogLeNet’s Inception. Second, our DA method consists of three components: Learning invariance across domains, reducing discrepancy of feature representations, and predicting labels. Third, experiments show that our DNN obtains GoogLeNet-level accuracy both on classification and DA. The DA accuracy gap between GoogLeNet and other compact DNNs (FaConvNet and Rev-FaConvNet) is much larger. Fourth, the unified framework of our DA method slightly outperforms previous competitive methods, and our DA method based on our DNN network achieves state-of-the-art on sixteen of total eighteen DA tasks on the popular Office-31 and Office-Caltech  datasets.
2 Related Work
DNN model compression with little accuracy drop on image classification traditionally are learning based. Liu et al.  zero out more than 90% of AlexNet’s parameters using a sparse decomposition, while Wen et al.  regularize a DNN model with structured sparsity based on group Lasso. Han et al.  prune the small-weight connections and retrain the DNN with the remaining connections. More recent research began to shrink a model directly based on network architecture design. SqueezeNet  is built on the fire module which feeds “squeeze” layer (11 convoluton) into “expand” layer (a combination of 11 and 33 convoluton). The basic structure of FaConvNet  is Convolutional Layer as Stacked Single Basis Layer. A popular design methodology of compact architectures extensively uses small convolutional kernels (11 and 33), especially the linear projection as the conv 11 layer shown in bold in Figure 1. Based on the preliminary experimental result in Table 1, we argue that it is necessary to redesign the basic module of these extremely shrunk DNNs, e.g.
, FaConvNet and SqueezeNet, by introducing more diverse operations of feature extraction, in order to achieve high accuracy on both classification and DA. The challenge lies in that more complex feature extraction methods,e.g., multi-scale convolution, often result in the steep increase of parameters, as the basic module will be used reapeatedly. The shortcut connection used in ResNet , for instance, can be understood as a parameter-saving solution of multi-scale feature integration. We will adopt methods other than this bypass structure.
Unsupervised DA. Following the early attempt of re-weighting samples from source domain , Shekhar et al.  learn dictionary based representations by minimizing the divergence between the source and target domains. The subspace based methods, on the other hand, evaluate the distance between domains in a low-dimensional manifold  or in terms of Frobenius norm . DNN based methods have been proposed recently. Glorot et al.  and Chopra et al.  learn cross-domain features using auto-encoders, followed by the label prediction. A more popular strategy is to combine feature adaptation with label prediction as s unified framework. DDC  introduces adaptation layers and domain confusion metric into a CNN architecture, while GRL  combines classifiers of label and domain using a gradient reverse layer. DAN  and RTN  focus on effectively measuring feature representations in kernel spaces. TRANSDUCTION  jointly optimizes the target label and domain transformation parameters. Our DA method adopts a unified framework, which can simultaneously learn invariance across domains, reduce divergence of feature representations and adapt label prediction.
DNN based image segmentation.
The DNNs of segmentation and classification mainly differ in the use of up-sampling layers to recover resolution. Various up-scaling methods have been proposed and adopted, such as straightforward bicubic interpolation, learning based deconvolution , and unpooling [26, 27]. We improve the deconvolution  to remove artifacts that will be described in Section 3.1, and use it as a type of shape feature extractor in the basic module of our DNN. With the consideration of training convergence speed, the unpooling with fewer parameters is a better choice, compared to deconvolution, especially for small-scale and medium-scale problems. So we adopt unpooling for sample reconstruction in our DA method. In addition, different strategies have been presented to train segmentation networks. SegNet-Basic  is directly trained as a whole. Long et al. , on the other hand, adapt a popular classification network into a fully convolutional network (FCN), and fine-tune it for segmentation tasks. Yu et al.  show that accuracy can be further improved by plugging their context module into existing segmentation model. Our decoder design for sample reconstruction is inspired by FCN, while our structure is simpler than the multi-stream structure in FCN.
|#Feature maps (Conv-M)||#Parameters|
|(If not Conv-M)||C1||C2||C3||C4||DiC1||DiC2||C5||DeC1||DeC2|
3 Proposed Method
Motivated by the observation described in Section 1, we propose a compact DNN architecture with a new basic module Conv-M. Our DA method gradually tunes the feature adaptation and label prediction.
3.1 DNN Architecture with Conv-M
Figure 2 shows a Conv-M module used in our DNN. According to the preliminary experiment and our analysis in Section 1, the design idea is to capture more diverse details at different levels, while using fewer parameters. To achieve this goal, the dilated convolution  for multi-resolution and deconvolution  are introduced. The dilated convolution can extract features with a larger receptive field without increasing the kernel size, e.g., extracting features from a 55 window with a 33 kernel. The deconvolution is to reconstruct shapes of the input, providing distinct features from regular convolution. In addition, to decrease redundant parameters, we implement the separable convolution inspired by separable wavelet filters  for all types of convolution, including deconvolution, in Conv-M.
We visualize activations of convolution (middle) and deconvolution (right) in the same Conv-M module in our network in Figure 3. Appearance details are extracted by convolution, while deconvolution tends to describe the completed shapes. Therefore, the features extracted by convolution and deconvolution are complementary so as to benefit DA. In addition, the shapes captured by deconvolution are more generic for a class of object compared to the appearance details extracted by convolution, which facilitates our DA strategy to explore divergence between classes for knowledge transfer.
The detailed design of Conv-M in Figure 2 shows that the input feature maps from the previous layer are respectively processed by regular convolution (conv), dilated convolution (dilated conv) and deconvolution (deconv) in three branches. Their outputs will be concatenated together. The pipelines of these three branches are: C1-C2-C3-dropout, C4-DiC1-DiC2-dropout, and C5-DeC1-DeC2-dropout. All of the three branches start with a 11 convolution as linear projection. The parameters k and s are kernel size and stride. The dilation factor d indicates that the receptive field is . The group number g for separable convolution indicates that feature maps between two adjacent layers are separated into g groups. The dropout ratio r is fixed to 0.2. The output of deconvolution is cropped to its input size. ReLU is adopted for all nine convolutions, which is not shown in Figure 2. The parameter number of Conv-M is computed as follows. Let , , , , , , , , and denote the feature map numbers of C1, C2, C3, C4, DiC1, DiC2, C5, DeC1 and DeC2. The parameter number of the first branch in Conv-M is:
The parameter number of the second branch is:
The parameter number of the third branch is:
Our DNN architecture is shown in Table 2, which generally consists of convolution, alternating max-pooling and Conv-M, avg-pooling and linear, as listed in the second column Types/Module. Note that the last linear layer is for image classification only and will be removed when conducting DA tasks. To fairly compare with other DA methods in Section 4
, we include this layer into the estimation of total parameters as shown in the table. TheOutput size in the third column is multiplication of height, width and number of feature maps at each layer. Specific parameters of a non Conv-M layer are listed in the fourth column Filter size/Stride, while those of Conv-M are in the fifth column #Feature maps (Conv-M). As the basic settings of Conv-M are represented in Figure 2, the fifth column only shows the feature map number of all nine convolutions: C1, C2, C3, C4, DiC1, DiC2, C5, DeC1 and DeC2. For each of these nine convolutions, the feature map numbers between two max-pooling layers are same, and generally increased with the model depth. The raw pixels of input images are processed by a regular convolution with a kernel size of 77 which is much larger than the 11 and 33 kernels used in Conv-M. Our preliminary experiment shows that for input image data, convolution with a smaller kernel (e.g., 33) will degrade the classification accuracy by 1.5%2.5%. For Conv-M, on the other hand, using larger kernels (e.g., 55) can only improve the performance by slightly 0.3%0.8%. The final column #Parameters in Table 2 lists the parameter numbers at each layer. Dominant parameter consumers are the two Conv-M modules (39%) between the fourth max-pooling and the avg-pooling. The total number of parameters of our DNN is 4.1M.
3.2 Unsupervised Domain Alignment
Our DA method simultaneously adapts feature representations and source label prediction as shown in Figure 4
, given input data sampled from both source and target domains. The sampling ratio of target domain will be gradually increased during training. Formally, three terms are minimized in the unified framework: The reconstruction error of source and target samples (blue) for invariance learning, the discrepancy of hidden representations on layers between domains (red), and the prediction error of source labels (orange). For our DNN shown in Table2
, the last linear layer with 1000 neurons will be removed in DA tasks. Extra layers, as shown in orange and blue in Figure4, are added during domain alignment training, while only the layers related to label prediction (orange) will be kept for testing.
Invariance learning. The error minimization of reconstructing input source and target samples is to force the DNN to learn more cross-domain features. The asymmetrical encoder-decoder architecture is adopted for sample reconstruction, as shown in Figure 4. The encoder is our pre-trained DNN without the avg-pooling and last linear layers, while the decoder (blue) with fewer layers (compared to the encoder) consists of alternating un-pooling and regular convolution. The un-pooling in the decoder is to up-sample input feature maps using indexes obtained from the corresponding max-pooling layer in the encoder. The encoder is responsible for feature extraction, while the decoder is for restoring resolution. Our preliminary experiment shows that the asymmetrical structure only slightly decreases the final accuracy (averagely 0.4%) but significantly accelerates the training speed, compared to symmetrical design. In addition, two decoders on different scales are introduced.
Representation discrepancy reduction. Instead of using parametric criteria such as Kullback-Leibler divergence to further reduce the cross-domain divergence, we adopt a non-parametric method to estimate the feature distribution distance between domains. Specifically, we minimize the maximum mean discrepancies (MMD) by Gretton et al. . The MMD is defined as:
where and are respectively input source and target, and and denote corresponding sample numbers. The function is a non-linear feature mapping. is a universal reproducing kernel Hilbert space. The MMD criteria is denoted as G-MMD in our method, as we adopt the Gaussian kernel. As shown in Figure 4, the G-MMD loss (red) is added to the last three Conv-M layers in our DNN.
Source label prediction. As shown in Figure 4, we add two linear layers (orange), and the neuron numbers of the second one is specified for the dataset. No significant accuracy benefit is observed by adding linear layers more than two in our preliminary experiment.
Our DNN is trained on the benchmark dataset ImageNet’12  and compared with well-known models on total parameter numbers and classification accuracy. Following the standard pipeline, we then fine-tune our trained model for unsupervised DA tasks on two popular datasets according to our DA method. The DA accuracy is compared with competitive methods.
|AlexNet ||61 M||57.2||80.3|
|GoogLeNet ||7 M||68.7||88.9|
|VGG16 ||134 M||71.9||90.6|
|Our network||4.1 M||68.9||89.0|
4.1 ImageNet Classification
We train our DNN on ImageNet’12 dataset, and set the parameters of our training solver according to the quick_solver.prototxt
in Caffe. The batch size is 64. Table 3 compares the classification accuracy (Top-1, Top-5) and parameter numbers (#Parameters) of our DNN and AlexNet , GoogLeNet , and VGG16 . For AlexNet and GoogLeNet, we directly use the trained models provided by Caffe. The VGG16’s result is obtained from the original paper . Our DNN achieves GoogLeNet-level accuracy, while the total parameter numbers (4.1M) is only 59% of GoogLeNet.
|DAN ||61 M||68.5||96.0||99.0||53.1||67.0||54.0|
|GRL ||61 M||73.0||96.4||99.2||53.6||72.8||54.4|
|TRANSDUCTION ||61 M||80.4||96.2||98.9||62.5||83.9||56.7|
|GRL (Rev-FaConvNet)||4.8 M||74.1||96.5||99.2||54.3||73.4||55.3|
|Our DA (Rev-FaConvNet)||4.8 M||77.0||96.5||99.2||58.4||75.9||58.1|
|GRL (Our net)||4.1 M||80.1||96.7||99.2||64.1||78.0||65.4|
|Our DA (Our net)||4.1 M||82.6||97.0||99.4||67.4||80.1||67.3|
|Baseline: Our DA (GoogLeNet)||7 M||83.0||96.9||99.5||67.7||80.5||67.5|
|Baseline: Our DA (FaConvNet)||2.8 M||73.9||96.3||99.1||54.1||73.2||55.2|
Most of methods will remove the last linear layer of a pre-trained network, and add extra layers for DA. According to Section 4.2, our DNN will be smaller after the change. The size of other models will also be slightly different, but the actual size is not reported in [21, 23]. We hence directly report the total parameter numbers of the pre-trained network for fair comparison.
|DAN ||61 M||93.8||99.0||100.0||92.4||92.0||92.1||85.1||84.3||82.4||92.0||90.6||90.5|
|RTN ||61 M||97.0||98.8||100.0||94.6||95.5||93.1||88.5||88.4||84.3||94.4||96.6||92.9|
|DAN (Rev-FaConvNet)||4.8 M||94.0||99.1||100.0||92.7||92.3||92.2||85.5||84.6||82.6||92.3||90.9||90.8|
|Our DA (Rev-FaConvNet)||4.8 M||94.9||99.2||100.0||93.3||93.3||92.5||86.5||85.9||83.1||93.0||93.0||91.5|
|DAN (Our net)||4.1 M||95.0||99.2||100.0||96.0||94.8||95.2||91.6||90.4||90.7||94.4||95.0||94.3|
|Our DA (Our net)||4.1 M||95.6||99.7||100.0||96.8||96.0||95.6||92.5||91.6||91.4||95.3||97.2||95.3|
|Baseline: Our DA (GoogLeNet)||7 M||95.9||99.7||100.0||97.1||96.2||95.9||92.9||92.0||91.5||95.6||97.4||95.7|
|Baseline: Our DA (FaConvNet)||2.8 M||94.5||99.1||99.8||92.0||91.8||91.0||83.7||83.4||80.1||92.8||91.1||89.8|
Please see the footnote of Table 4 for the explanation of parameter numbers.
|Our DA (Our net1)||4.1 M||62.2||74.2||96.5||99.2||56.2||74.1||56.0|
|Our DA (Our net)||4.1 M||68.9||82.6||97.0||99.4||67.4||80.1||67.3|
4.2 Unsupervised DA
Office-31. This standard benchmark consists of 4,652 images of 31 categories collected from three distinct domains : AMAZON (A), WEBCAM (W) and DSLR (D). The samples of these three domains are respectively downloaded from amazon.com, taken by web camera and taken by digital SLR camera in an office environment with different photographic settings. All six DA tasks between the three domains will be adopted for completeness: AW, DW, WD, WA, AD and DA.
Office-Caltech. It is a popular dataset  composed of 10 overlapping categories from the Office-31 and Caltech-256 (C)  datasets. All twelve DA tasks are used: AW, DW, WD, AD, DA, WA, AC, WC, DC, CA, CW and CD. The Office-31 dataset is more challenging as it has more categories of images, while Office-Caltech provides more DA tasks to observe the dataset bias .
Methods. We compare our method with the nine previous competitive DA methods: TCA , GFK , SA , DLID , DDC , DAN , GRL , TRANSDUCTION  and RTN . TCA and GFK are conventional methods, while the others are DNN based.
Networks. Five DNNs are used in our experiments: AlexNet (61M), Rev-FaConvNet (4.8M), our DNN (4.1M), GoogLeNet (7M) and FaConvNet (2.8M). DA methods DAN, GRL, TRANSDUCTION and RTN originally use pre-trained AlexNet, according to their papers. Rev-FaConvNet achieves much better DA accuracy compared to SqueezeNet, Rev-SqueezeNet and FaConvNet as shown in our preliminary experiments in Table 1. FaConvNet, Rev-FaConvNet and our DNN all reach GoogLeNet-level classification accuracy. In this work, we use GoogLeNet and FaConvNet as baselines for comparison.
Besides running previous DA methods on AlexNet, we also run the following eight experiments to quantize the contribution of our DNN and our DA method:
(1) GRL (Rev-FaConvNet): Running GRL on Rev-FaConvNet;
(2) GRL (Our net): Running GRL on our DNN;
(3) DAN (Rev-FaConvNet): Running DAN on Rev-FaConvNet;
(4) DAN (Our net): Running DAN on our DNN;
(5) Our DA (Rev-FaConvNet): Running our DA method on Rev-FaConvNet;
(6) Our DA (FaConvNet): Running our DA method on FaConvNet, and the result is used as a baseline;
(7) Our DA (GoogLeNet): Running our DA method on GoogLeNet, and the result is used as a baseline;
(8) Our DA (Our net): Running our DA method on our DNN, and this is our final result.
Parameter settings. We follow the specific description of all previous DA methods in their papers. The hyper-parameter of SA is selected based on cross-validation, which is consistent with other papers [12, 23]. For our DA method that is based on our pre-trained network on ImageNet’12, the convolution and the first three Conv-M shown in Table 2 are frozen, as the Office-31 and Office-Caltech datasets are rather small-scale. For all newly added layers as shown in orange and blue in Figure 4 which are trained from scratch, their learning rate is ten times higher. The learning rate policy we adopt is poly as described in Caffe, and the initial value is 0.0009 with the power fixed to 0.5. The batch size is 64, and the sampling ratio of target domains is uniformly increased from 30% to 70% during training. In the testing stage, the new layers for sample reconstruction are removed, as aforementioned in Section 3.2. For the remaining new layers for label prediction (orange) in Figure 4, the neuron numbers of the first linear layer is 256, while those of the second one is 31 for Office-31 dataset and 10 for Office-Caltech dataset. The G-MMD loss is added to the last three Conv-M layers of our DNN. The regularization hyper-parameter of G-MMD loss is fixed to 0.3 across all datasets, and the bandwidth of the Gaussian kernel is the median pairwise distance  on training set.
Based on NVIDIA GTX TITAN X, the inference speed of SqueezeNet and Rev-SqueezeNet is faster than that of FaConvNet, Rev-FaConvNet and our network, though they cannot obtain GoogLeNet-level classification and DA. Specifically, Rev-SqueezeNet is 22% slower than that of SqueezeNet, and Rev-FaConvNet decreases the speed of FaConvNet by 12%. Our network consumes 11% less time compared to FaConvNet.
Table 4 and Table 5 respectively summarize the DA accuracy on Office-31 and Office-Caltech datasets. Both tables are separated into four groups by rows. The first group is the previous DA methods based on AlexNet. The second group compares previous and our DA methods on Rev-FaConvNet, while the third group compares DA methods on our DNN. The fourth group provides result of our DA method on GoogLeNet and FaConvNet as baselines. The results in the two tables are analyzed from the following three aspects:
First, our DNN approaches GoogLeNet’s DA accuracy on the same DA method, while the gap between GoogLeNet and previous compact DNNs (FaConvNet and Rev-FaConvNet) is much larger, according to the four observations: Our DA (Our net), Our DA (GoogLeNet), Our DA (FaConvNet) and Our DA (Rev-FaConvNet) in Table 4 and Table 5. Though FaConvNet, Rev-FaConvNet and our DNN all obtain GoogLeNet-Level classification accuracy, only our DNN has matched accuracy on both classification and DA. Moreover, our DNN (4.1M) is smaller than Rev-FaConvNet (4.8M). Our DNN also outperforms AlexNet using the same DA method, as the comparison of GRL and GRL (Our net) in Table 4 shows.
Second, our DA method outperforms GRL and DAN, based on the same DNN, according to the four comparisons: GRL (Rev-FaConvNet) and Our DA (Rev-FaConvNet) in Table 4, GRL (Our net) and Our DA (Our net) in Table 4, DAN (Rev-FaConvNet) and Our DA (Rev-FaConvNet) in Table 5, and DAN (Our net) and Our DA (Our net) in Table 5.
Third, put all together, our DA method based on our DNN achieves state-of-the-art on sixteen of total eighteen DA tasks on two datasets, as shown on the last row of these two tables (Our DA (Our net)). The other two is AD in Table 4 and AW in Table 5. We boost the accuracy of task DA by 10.6% compared to TRANSDUCTION, as shown in Table 4. On Office-31 dataset, the accuracy gap between the tasks DW and WD is 2.4%, while the gap between AW and WA greatly increases to 15.2%, indicating larger appearance difference between domains A and W. The domain difference between A and D is also larger than that between D and W. In other words, on Office-31 dataset, transfer (in two directions) between D and W is relatively easier for our DA method, while other two are more difficult, which is consistent with the results from previous DA methods. On Office-Caltech dataset, the bilateral transfer between C and W gets the largest accuracy gap (5.6%) in our DA method, as shown in Table 5.
4.3 Sensitivity Analysis
Convolution in Conv-M. To validate the contribution of non-regular convolution (dilated convolution and improved deconvolution) in our Conv-M module, we replace all non-regular convolution with regular ones and keep the 33 kernel size unchanged. The first row Our DA (Our net1) in Table 6 shows the result, and the second row Our DA (Our net) is our original solution. Significant accuracy drop can be observed on classification and almost all DA tasks. The comparison in Table 6 indicates the importance of features extracted by dilated convolution and improved deconvolution in our Conv-M.
Reconstrution and G-MMD. Based on our DNN, Table 7 and Table 8 respectively show the contribution of two components of our DA methods (sample reconstruction and G-MMD) on Office-31 and Office-Caltech datasets. The row No G-MMD in two tables shows the result obtained by removing G-MMD from our DA method, while the row No recons. corresponds to our method without including sample reconstruction. For these two rows, lower accuracy indicates more contribution of the component. The row All is the regular result without removing any component, which is the same as the respective row Our DA (Our net) in Table 4 and Table 5. For Office-31 dataset shown in Table 7, reconstruction is more important for the transfers DW and DA, while AW and WA rely more on G-MMD. Table 8 demonstrates that the contributions of reconstruction and G-MMD are almost the same.
In this paper, we present a compact DNN architecture and unsupervised DA method, based on our observation that current small DNNs (SqueezeNet and FaConvNet) have unmatched accuracy on classification and DA, e.g., a DNN with GoogLeNet-level classification accuracy only obtains AlexNet-level DA accuracy.
The basic module used in our DNN, Conv-M, introduces multi-scale convolution and deconvolution without using kernels larger than 33.
The unified framework of our DA method learns cross-domain features by sample reconstruction and G-MMD, and simultaneously tunes label prediction.
The parameter numbers of our DNN is only 59% of GoogLeNet, while experiments show that our DNN obtains GoogLeNet-level accuracy both on classification and DA.
Our DA method slightly outperforms previous competitive GRL and DA.
In addition, our method based on our DNN achieves state-of-the-art on sixteen of total eighteen DA tasks on the popular Office-31 and Office-Caltech datasets.
Acknowledgments. This work is in part supported by NSF CCF-1615475 and DOE SC0017030. Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of grant agencies or their contractors.
Liu et al. 
B. Liu, M. Wang, H. Foroosh, M. Tappen, and M. Pensky.
Sparse Convolutional Neural Networks., 2015.
- Han et al.  S. Han, H. Mao, and W. J. Dally. Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding. International Conference on Learning Representations (ICLR), 2016.
- Wen et al.  W. Wen, C. Wu, Y. Wang, Y. Chen, and H. Li. Learning Structured Sparsity in Deep Neural Networks. Advances in Neural Information Processing Systems (NIPS), 2016.
- Iandola et al.  F. N. Iandola, S. Han, M. W. Moskewicz, K. Ashraf, W. J. Dally, and K. Keutzer. SqueezeNet: AlexNet-level Accuracy with 50x Fewer Parameters and 0.5MB Model Size. arXiv preprint arXiv:1602.07360, 2016.
- Wang et al.  M. Wang, B. Liu, and H. Foroosh. Factorized Convolutional Neural Networks. arXiv preprint arXiv:1508.04337, 2016.
- Paszke et al.  A. Paszke, A. Chaurasia, S. Kim, and E. Culurciello. ENet: A Deep Neural Network Architecture for Real-Time Semantic Segmentation. arXiv preprint arXiv:1606.02147, 2016.
- Shimodaira  H. Shimodaira. Improving Predictive Inference under Convriate Shift by Weighting the Log-Likelihood Function. Journal of Statistical Planning and Inference, 2000.
- Krizhevsky et al.  A. Krizhevsky, I. Sutskever, and G. E. Hinton. ImageNet Classification with Deep Convolutional Neural Network. Advances in Neural Information Processing Systems (NIPS), 2012.
- Szegedy et al.  C. Szegedy, W. Liu, Y. Jia, P. Sermanet, and S. Reed. Going Deeper with Convolutions. International Conference on Computer Vision and Pattern Recognition (CVPR), 2015.
- Russakovsky et al.  O. Russakovsky, J. Deng, H. Su, J. Krause, S. Satheesh, S. Ma, Z. Huang, A. Karpathy, A. Khosla, M. Bernstein, A. C. Berg, and F. F. Li. ImageNet Large Scale Visual Recognition Challenge. International Journal of Computer Vision (IJCV), 2015.
- Saenko et al.  K. Saenko, B. Kulis, M. Fritz, and T. Darrell. Adapting Visual Category Models to New Domains. European Conference on Computer Vision (ECCV), 2010.
Ganin and Lempitsky 
Y. Ganin and V. Lempitsky.
Unsupervised Domain Adaptation by Backpropagation.International Conference on Machine Learning (ICML), 2015.
- Gong et al.  B. Gong, Y. Shi, F. Sha, and K. Grauman. Geodesic Flow Kernel for Unsupervised Domain Adaptation. International Conference on Computer Vision and Pattern Recognition (CVPR), 2012.
- He et al.  K. He, X. Zhang, S. Ren, and J. Sun. Deep Residual Learning for Image Recognition. arXiv preprint arXiv:1512.03385, 2015.
- Huang et al.  J. Huang, A. J. Smola, A. Gretton, K. M. Borgwardt, and B. Scholkopf. Correcting Sample Selection Bias by Unlabeled Data. Advances in Neural Information Processing Systems (NIPS), 2006.
- Shekhar et al.  S. Shekhar, V. M. Patel, H. V. Nguyen, and R. Chellappa. Generalized Domain-Adaptive Dictionaries. International Conference on Computer Vision and Pattern Recognition (CVPR), 2013.
- Fernando et al.  B. Fernando, A. Habrard, M. Sebban, and T. Tuytelaars. Unsupervised Visual Domain Adaptation Using Subspace Alignment. International Conference on Computer Vision (ICCV), 2013.
Glorot et al. 
X. Glorot, A. Bordes, and Y. Bengio.
Domain adaptation for large-scale sentiment classification: A deep learning approach.International Conference on Machine Learning (ICML), 2011.
- Chopra et al.  S. Chopra, S. Balakrishnan, and R. Gopalan. DLID: Deep Learning for Domain Adaptation by Interpolating between Domains. International Conference on Machine Learning Workshop (ICMLW), 2013.
- Tzeng et al.  E. Tzeng, J. Hoffman, N. Zhang, K. Saenko, and T. Darrell. Deep Domain Confusion: Maximizing for Domain Invariance. arXiv preprint arXiv:1412.3474, 2014.
- Long et al. [2015a] M. Long, Y. Cao, J. Wang, and M. I. Jordan. Learning Transferrable Features with Deep Adaptation Networks. International Conference on Machine Learning (ICML), 2015a.
- Long et al.  M. Long, J. Wang, and M. I. Jordan. Unsupervised Domain Adaptation with Residual Transfer Networks. Advances in Neural Information Processing Systems (NIPS), 2016.
- Sener et al.  O. Sener, H. O. Song, A. Saxena, and S. Savarese. Learning Transferrable Representations for Unsupervised Domain Adaptation. Advances in Neural Information Processing Systems (NIPS), 2016.
- Dong et al.  C. Dong, C. C. Loy, K. He, and X. Tang. Image Super-Resolution Using Deep Convolutional Networks. arXiv preprint arXiv:1501.00092, 2015.
- Noh et al.  H. Noh, S. Hong, and B. Han. Learning Deconvolution Network for Semantic Segmentation. International Conference on Computer Vision (ICCV), 2015.
- Hong et al.  S. Hong, H. Noh, and B. Han. Decoupled Deep Network for Semi-Supervised Semantic Segmentation. Advances in Neural Information Processing Systems (NIPS), 2015.
- Badrinarayanan et al.  V. Badrinarayanan, A. Kendall, and R. Cipolla. SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentation. arXiv preprint arXiv:1511.00561, 2015.
- Long et al. [2015b] J. Long, E. Shelhamer, and T. Darrell. Fully Convolutional Networks for Semantic Segmentation. International Conference on Computer Vision and Pattern Recognition (CVPR), 2015b.
- Yu and Koltun  F. Yu and V. Koltun. Multi-scale Context Aggregation by Dilated Convolutions. International Conference on Learning Representations (ICLR), 2016.
- Sifre and Mallat  L. Sifre and S. Mallat. Rotation, Scaling and Deformation Invariant Scattering for Texture Discrimination. International Conference on Computer Vision and Pattern Recognition (CVPR), 2013.
- Gretton et al.  A. Gretton, K. M. Borgwardt, M. Rasch, B. Scholkopf, and A. J. Smola. A Kernel Method for the Two-Sample-Problem. Advances in Neural Information Processing Systems (NIPS), 2006.
- Simonyan and Zisserman  K. Simonyan and A. Zisserman. Very Deep Convolutional Networks for Large-Scale Image Recognition. International Conference on Learning Representations (ICLR), 2015.
- Jia et al.  Y. Jia, E. Shelhamer, J. Donahue, S. Karayev, J. Long, R. Girshick, S. Guadarrama, and T. Darrell. Caffe: Convolutional Architecture for Fast Feature Embedding. ACM International Conference on Multimedia, 2014.
- Gong et al.  B. Gong, K. Grauman, and F. Sha. Connecting the DOTs with Landmarks: Discriminatively Learning Domain-Invariant Features for Unsupervised Domain Adaptation. International Conference on Machine Learning (ICML), 2013.
- Pan et al.  S. J. Pan, I. W. Tsang, J. T. Kwok, and Q. Yang. Domain Adaptation via Transfer Component Analysis. IEEE Transactions on Neural Networks and Learning Systems (TNNLS), 2011.
- Griffin et al.  G. Griffin, A. Holub, and P. Perona. Caltech-256 Object Category Dataset. Technical Report, California Institute of Technology, 2007.
- Torralba and Efros  A. Torralba and A. Efros. Unbiased look at dataset bias. International Conference on Computer Vision and Pattern Recognition (CVPR), 2011.
- Gretton et al.  A. Gretton, B. Sriperumbudur, D. Sejdinovic, H. Strathmann, S. Balakrishnan, M. Pontil, and K. Fukumizu. Optimal Kernel Choice for Large-Scale Two-Sample Tests. Advances in Neural Information Processing Systems (NIPS), 2012.