I Introduction
As one of the most fascinating techniques when we are entering the era of Artificial Intelligent (AI), Deep Neural Networks (DNNs) are penetrating the real world in many exciting applications such as image processing, face recognition, selfdriving cars, robotics and machine translations etc. Nonetheless, all this success, to great extent, is enabled by introducing the powerful data analysis capability of stateoftheart largescale DNNs with deep and complex structures and huge volume of model parameters, significantly exacerbating the demand for computing resource and data storage of hardware platforms. As an example, the largescale image classification implementation of famous deep convolutional neural network (CNN) “AlextNet” involves 61 million parameters offchip memory accesses and 1.5 billion high precision floatingpoint operations
[1].Fortunately, recent hardware engine innovation enables the implementations of those once “conceptual” DNN software systems in both highperformance computing and resourcelimited embedded platforms for performing various intelligent tasks [2, 3, 4]. Many hardwarefavorable DNN architectures along with various DNN model optimization techniques are developed to accelerate dedicated computations on generalpurpose platforms like GPU [5] and CPU [6], domainspecific hardware like FPGA [7]
, and customized ASIC, e.g. recent Google Tensor Processing Unit (TPU)
[8, 9, 10].While DNN’s broad and positive impacts along with its impressive hardware advancement excite multiple industries in myriad ways, it also brings about everincreasing security challenges. Since the classification results of DNN systems are usually derived from the probabilities
[11, 12], the attackers can easily compromise system security by exploiting specific vulnerabilities of learning algorithms or classifiers through a careful manipulation of the input data samples, namely
adversarial examples, i.e. circumvent anomaly detection, misclassify the adversarial images at testing time
[13] or adversarially manipulate the perceptual systems of autonomous vehicles to the misreading of road signs, thus causing potential disastrous consequences [14]. Hence, safeguarding the security of DNN systems has become an urgent task.Many DNN adversarial researches have been conducted, including adversarial example generating [13, 15], robustness analysis [16] and mitigation techniques [13, 17, 18]. However, existing adversarial studies focus only on softwarelevel DNN models by (over) simply assuming that the input perturbations are the only uncertain factor under unchanged softwarelevel DNN models. The additional DNN model change, e.g. nonlinear weights reshaping to largely compress DNN scale [19, 20, 21, 22], which is inevitable because of the hardware resource constraints during DNN deployment, is often neglected. As we shall present in section III, the adversarial attack to practical DNN systems will be a multifactor problem rather than the ideal singlefactor problem from crafted adversarial inputs. Since the realistic tasks often need to be executed in DNN hardware systems with extra efforts on model compression, discovering the nature of more realistic adversarial attacks, as well as developing effective countermeasures to protect such practical learning systems will be of critical importance at the early stage of DNN applications.
In this work, we for the first time formulate the multifactor adversarial attacks tailored for the practical deep learning systems by integrating the mathematical modeled DNN model reshaping (take hashbased DNN weight compression as an example) and the input perturbations. We then for the first attempt to systematically analyze the interplays among the hash compression ratio, the amplitude of input perturbations, adversarial attack successful rate and accuracy through extensive experimental and theoretical studies. Interestingly, we discover that the hashbased deep compressed DNN models can be somewhat less vulnerable to adversarial attacks because of the reshaped weight distribution when compared to the uncompressed softwareDNN models. Inspired by this observation, a defense technique named “gradient inhibition” is further proposed to suppress the generating of input perturbations thus to effectively prevent the adversarial attacks for deep learning systems. Experimental results show that “gradient inhibition” can reduce the success rate of adversarial attacks from 87.99% to 4.77% (from 86.74% to 4.64%) on average on MNIST [23] (CIFAR10 [24]) benchmark while maintaining the same level of accuracy across various DNNs.
Ii Preliminary
Iia Basics of Deep Neural Networks
Deep Neural Network (DNN) introduces multiple layers with complex structures to model a highlevel abstraction of the data [25], and exhibits high effectiveness in cognitive applications by leveraging the deep cascaded layer structure [1, 26, 27]
. For example, a typical modern DNN often consists of following types of layers: The convolutional layer extracts sufficient feature maps from the last layer by applying kernelbased convolutions, the pooling layer performs a downsampling operation (max or average pooling) along the spatial dimensions for a volume reduction, and the fullyconnected layer further computes the class score based on the final weighted results and the nonlinear activation functions.
IiB Model Reshaping
As modern DNNs become more powerful with an everincreasing model size, i.e. 60M to even 10B parameters to represent the weight connections [28, 29, 22], reducing their storage and computational costs becomes critical to meet the requirement of practical applications in hardwareoriented DNNs with limited resources, i.e. ASIC or FPGA. Therefore, removing the redundancy of DNN models has become a “musthave” step in deep learning system design [22].
Many studies are preformed to reshape the DNN models towards affordable hardware implementations, including network pruning [21, 22], HashNet [19, 20]
, etc. Those solutions can effectively compress the weights through some nonlinear transformations. Take the HashNet adopted in this work as an example, a hash function is selected to randomly group connection weights into hash buckets. All connections within the same hash bucket share a single parameter value. Therefore, the needed memory to store the weights can be significantly reduced. Figure
1 demonstrates the idea of an example HashNet for achieving significant storage reduction with limited accuracy loss. The original weights are converted to real weights by a random hash procedure. The real weights together with the hash index which are physically stored in the DNN hardware only cost memory space compared to that of original (virtual) weights.IiC Adversarial Examples
Adversarial examples are maliciously crafted inputs dedicated to mislead the DNN classification by introducing small input perturbations. The generating of adversarial examples can be modeled as an optimization problem:
(1) 
Here represents the function of target DNN model, and is usually determined by the detailed DNN configurations such as the architecture and the weight. is the distorted output which is different from the correct output . denotes the adversarial example perturbed by . Hence the question becomes how to solve the optimization problem to find the minimized . The common approach to derive adversarial examples is to extract adversarial perturbations
from the gradient information, since the gradient is a good measurement for the output response difference with respect to variations introduced in each dimension of an input vector. Hence, there are two gradientbased methods to generate adversarial examples from software DNN models:
Fast Gradient Sign Method (FGSM) [13] and Jacobianbased Saliency Map Approach (JSMA) [15]. The former adds a small perturbation in the direction of the sign of the gradient of the loss function with respect to the input of the DNN to all input dimensions, while the latter only distorts the most significant input features based on the salience map extracted from gradient of model function w.r.t. inputs–Jacobian matrix.
Figure 2 shows a conceptual view of FGSM based adversary on a representative DNN model–“AlexNet” with perturbation parameter . The image originally correctly classified as “Dog” by the “AlexNet” (65% confidence) is now misclassified as “Bear” with a much higher confidence (95%) due to the slightly polluted input. However, such an adversarial example is so close to the original image that the differences are indistinguishable to human eyes.
Iii Attack Design
To analyze the vulnerabilities of practical deep learning systems under adversarial attacks, we first present the threat model, followed by an attack methodology developed for conducting adversarial attacks over the hashbased deep compressed DNN models.
Iiia Threat Model
In this work, we adopt a whitebox adversarial attack model. We assume that the attacker has full access to all target compressed /noncompressed DNNs, training and testing dataset. The objective of adversarial attack is to mislead the classification of an original class to a different target, i.e. original target. To conduct the attack, the attacker first acquires the DNN model information such as weights, cost function, hash compression, gradient with normal input etc. Then the imperceptible perturbations are calculated through derived adversarial crafting algorithms and injected into normal inputs to generate adversarial examples. Finally, the adversarial examples will be sent to compressed/noncompressed DNN models, fooling the deep learning systems with adversarial classification results.
IiiB Adversarial Attack Design
To exert effective adversarial attacks to practical deep learning systems, our first step is to extend the singlefactor adversarial examples generating algorithm to the multifactor version based on the augmentation of softwaremodel oriented FGSM and JSMA approaches by taking mathematical characterized hashbased deep compression into consideration. Then a synthesized attack methodology is presented as our basis for security analysis and robustness evaluation.
IiiB1 Multifactor Adversarial Example Generating
To better illustrate how the adversary generating will be altered by the input perturbation and model reshaping in deep learning systems, the adversarial attack is again modeled as an optimization problem:
(2) 
where represents the hardwareoriented hashed DNN model derived from its software version (or uncompressed DNN model) with marginal accuracy reduction. is the distorted output which is different from the correct output . Apparently, the minimum input perturbations of () will be less likely to be equal to that of ideal software DNN model, i.e. (), even for the same adversarial target : because of the model reshaping (). If we define and as the weight matrix of DNN model and , the activation output will be and , respectively, where denotes a hardwareoriented weight transformation–hashing in HashNet. Since the hardwareoriented model reshaping should always minimize the accuracy loss, the corresponding results after activation should be . However, the DNN output perturbations will be changed from to accordingly. Even for the same adversarial example (), the responses from the two models will be quite different. Different from the single uncertainty factor assumption, i.e. input perturbations, adopted in the software DNN models, the compressed version of adversarial attacks will be more complicated and become a multifactor problem due to the additional weight transformations.
As the foundation for hardwareoriented adversarial example generating, we first mathematically model the deep compressed DNN model–HashNet. In HashNet, the derived classification output
for neuron
in layer and the gradient () of loss function over activation in layer can be presented as:(3) 
(4) 
where is the hash function associated with the weights in layer and is the second hash function independent of for sign function to remove the bias of hashed innerproducts caused by collisions [30]. represents the first derivative of activation function , and is the result before activation function. The weight transformation function will be modeled as by introducing the two hash functions and . Here denotes the elementary multiplication and the compression rate can be set by tuning . Accordingly, augmented from the FGSM, we can derive the Hardwareoriented Fast Gradient Sign Method (HFGSM) dedicated to HashNet as:
(5) 
where, the gradient can be calculated as:
(6) 
where is the amplitude coefficient of perturbations, is the gradient of loss function w.r.t. input .
Similarly, the Hardwareoriented Jacobianbased Saliency Map Approach (HJSMA) for HashNet can be further developed with the same weight transformation but forward derivative gradient that can be obtained from the result of output layer. Thus an “adversarial saliency map” that indicates the correlation between inputs and outputs can be calculated from the gradient :
(7) 
where each element of saliency map for a false target class is obtained based on the rule of rejecting input components with negative target derivative or an overall positive derivative on other classes , otherwise accepting input components based on synthetic results of positive target derivative and all the other forward derivative components together. Therefore, only the input features corresponding to large values of in saliency map can be identified for adding adversarial perturbations, thus to efficiently mislead the classification result to a certain target.
IiiB2 Attack Methodology
To facilitate comprehensive adversarial attacks for the deep compressed DNN model, we develop a synthesized attack methodology by integrating the derived HFGSM and HJSMA approaches. As Algorithm 1 shows, an upperbound of the perturbation amplitude coefficient in HFGSM (see Eq. 6) or the number of perturbation elements in HJSMA (see Eq. 7) will be predefined to guarantee that the crafted adversarial perturbations can be maintained at an imperceptible level, which is more desirable in practical attacks. A randomly selected original inputoutput pair (, ) will be recorded and compared with the adversarial inputoutput pair (, ). The adversarial example generating process will be terminated once a successful adversarial attack happens, i.e. , otherwise or will be increased until reaching the respective upperbound. The success rate of adversarial attacks will be adopted as a measurement in our following security analysis.
Iv Security Analysis
We conduct the multifactor adversarial attacks on the following tailored DNN model (i.e. 784C64C128F51210) applied with HashNet model reshaping by following the proposed attack methodology. A full MNIST database is adopted as our benchmark for a comprehensive analysis of attacking effectiveness in deep compressed/noncompressed deep learning systems.
Iva Effectiveness of Multifactor Adversarial Attacks
We first designed several hash compressed DNN models–HashNets with different compression rates (from to ) based on the aforementioned uncompressed DNN model. To make a fair adversarial attack analysis, our HashNets minimize the testing accuracy degradation (with normal input data without adversarial perturbations) introduced by weight compression. As shown in Fig. 3, the testing accuracy on HashNets is only slightly decreased as the compression rate increases (i.e. 99.25% at rate v.s. 99.13% at ) but still very close to the uncompressed model (99.29%).
Fig. 4 shows the success rate of multifactor adversarial attacks implemented with HFGSM method at various compression rates (i.e. HashNet() HashNet() over different perturbation amplitude coefficients. For comparison purpose, the results of the uncompressed DNN model–the common basis of different HashNets, under the original singlefactor based FGSM attacks are also presented. As expected, the attack success rates of both uncompressed DNN model and various compressed models are increased monotonically along with the growing perturbation amplitude coefficient, i.e. . This is because the attacking capability of crafted adversarial examples can be significantly enhanced by larger input perturbations (see ) for all DNN models regardless of the model reshaping. However, for each individual , the attack success rates of any HashNet models are always lower than that of uncompressed model. Moreover, the higher the compression rate is, the lower the attack success rate will be at each . We also conduct the same set of experiments under HJSMA based adversarial attacks. Again, our results in Fig. 5 demonstrate the similar trend at different combinations of compression rate and the number of perturbation elements, i.e. the attack success rates are decreased when increasing compression rate on HashNet at each selected number of perturbation elements. Surprisingly, these results indicate that the hash compressed DNN model, which have significantly reduced number of model parameters for affordable hardware implementation (see Fig. 1), exhibits better resistance to adversarial attacks than that of its uncompressed or less compressed version. This is in contrast to the empirical intuition that the more compressed DNN models should be more susceptible to the input perturbations.
Since the compressed DNN models maintain the similar level of the stability (or testing accuracy in Fig. 3) as that of uncompressed model, a reasonable explanation for the attack success rate reduction is that the destructiveness of crafted adversaries may be alleviated in HashNets when compare with those generated in uncompressed DNN model. That is being said, the effectiveness of multifactor adversary attacks depends on the perturbation amplitude coefficient in HFGSM (or the number of perturbation elements in HJSMA) and the compression rate, as we shall discuss in the following section.
IvB Theoretical Analysis of Adversarial Attacks on Hashed DNNs
To validate our hypothesis and deeply understand the relationship between adversary and model reshaping, we characterize the two critical components for adversary example generating in compressed models: weight and gradient amplitude under various compression rates. Fig. 6 compares the distributions of weights for uncompressed and two compressed DNNs–HashNet () and HashNet (). As Fig. 6 shows, the model with a higher compression rate yields a larger range of weights (i.e. and in HashNet () and HashNet () w.r.t. uncompressed model). Given significantly decreased number of unique weights (or increased compression rate) introduced by hashbased weight sharing mechanism, the weight distribution in compressed DNN model shall be much broader since such model has to rebalance the activations through enlarged weights during training to achieve an accuracy close to that of uncompressed model. However, such weight transformation can directly impact the gradient, thus the strength of generated adversaries.
Without loss of generality, we use the output layer with softmax activation to roughly explain the underlying principle. The final activation of output layer can be calculated through the following Softmax function:
(8) 
where the input of Softmax function can be expressed as:
(9) 
Note that we omit the bias because it can be included in weight by adding an additional connection with weight as the bias and a constant input 1. Since the Softmax function increases monotonically as the input grows, the enlarged weights in highly compressed models can possibly augment the desired activations but suppress the others, thus a possible stronger confidence for the final decision.
If we use FGSM based adversarial example generating algorithm as an example, the crossentropy loss function and its gradient w.r.t. input can be obtained as:
(10) 
(11) 
where is the input and is the target for class. Consider the is an exponential function of , the absolute gradient amplitude will be dominated by term . With the enlarged weights in compressed models, the activation may be closer to , thus a possible reduced gradient and perturbation amplitude, meaning alleviated adversarial severity. Fig. 7 shows the distributions of absolute value of mean gradient over uncompressed and compression DNNs with different compression rates. The proportion of large gradients () is reduced from (uncompressed model) to (HashNet()) as compression rate grows, while that of small gradients () is increased from to , which is in excellent agreement with our theoretical analysis and validates the degraded attack capability of compressed DNNs compared with the uncompressed version.
V Mitigation Approach
Candidate Models  DNN1  DNN2  DNN3  VGG16 

Relu Convolutional  4 layers  6 layers  9 layers  13 layers 
Relu Fully Connected  2 layers  2 layers  2 layers  3 layers 
Max Pooling  2 layers  3 layers  3 layers  5 layers 
In our security analysis, we show that the magnitude of weights in DNNs becomes a new factor that can significantly impact the the severity of adversarial attacks. Hashbased weight compression enlarges the magnitude of weights, thus to prevent the generating of stronger adversarial examples. However, its effectiveness is very limited, e.g. success rate reduction at any perturbation amplitude coefficient in Fig. 4, because the weight enlargement, introduced by nonlinear weight transformation, can only be guaranteed at a certain probability (see Fig.6). Inspired by this observation, a novel mitigation technique named Gradient Inhibition is further proposed to effectively mitigate the adversarial attacks.
Va Gradient Inhibition method
Our proposed Gradient Inhibition intends to control the weights linearly with enlarged magnitude guarantee for each weight:
(12) 
where is the inhibition coefficient. Different levels of weight enlargement can be achieved by a finegrained control parameter for both positive and negative weights, thus to minimize the gradient needed for adversarial perturbations generating and effectively mitigate or even eliminate the threats of adversarial attacks for DNNs.
Another advantage of Gradient Inhibition method is its low implementation cost applicable to both software or hardwareoriented compressed DNN models. Gradient Inhibition can be applied at any layer after the training process. Our practice is to deploy this method at the layers close to the output layer (i.e. the last fully connected layer) for higher attack rate reduction but lowest accuracy loss due to the usually moderate number of weights and strongest impacts on decision making.
VB Evaluation of Gradient Inhibition
VB1 Experiment Setup
Various HashNets and MNIST benchmark [23], which are used in section IV, are adopted in our experiment to evaluate efficiency of Gradient Inhibition. Additionally, the CIFAR10 database [24] is selected as a new benchmark in our evaluation, including 60K 3232 color images in 10 classes, 50K for training and 10K for testing. As shown in Table. I, four representative DNN models with different architectures, including stateofart VGG16 [26], are chosen to verify the feasibility and scalability of Gradient Inhibition across various types of DNN models. We assume the adversarial examples are generated through the FGSM and HFGSM for uncompressed and compressed models, respectively.
VB2 Inference Accuracy
An effective mitigate technique against adversarial attacks should not impact the functionality of the DNN models integrated with mitigate techniques. Before we evaluate the effectiveness, we first verify the inference accuracy changes introduced by Gradient Inhibition. As shown in 8, the inference accuracy on CIFAR10 database for each DNN model implemented with Gradient Inhibition is always at the same level as that of its corresponding model without such technique at different inhibition coefficients. We also find the similar accuracy trend in Hash compressed DNNs with different compression rates for the MNIST dataset. Note that the adopted inhibition coefficient can introduce flexible weight adjustments, i.e. , with very minor accuracy change.
VB3 Gradient Inhibition Efficiency
Fig. 9 shows the statistics of suppressed gradients across various inhibition coefficients for an uncompressed DNN model testing the MNIST dataset. As shown in Fig. 9, even with a very small adjustment on original weights, i.e. inhibition coefficient = 0.01, the gradient amplitude can be much lower than the one generated on HashNet() in Fig. 7, which is the best case in compressed DNN models. Note that in HashNet(), the range of weights has been enlarged from to (see Fig. 6), which is far exceed that of in Gradient Inhibition. Therefore, our proposed method can significantly suppress the gradients with much lighter weight transformation. Moreover, as shown in Fig. 9, most of gradients are approaching to “0” along with the increased inhibition coefficient, indicating the possible elimination of adversarial perturbations, thus to prevent the adversarial attacks remarkably.
VB4 Mitigation Measures
Adversarial attacks are conducted by following the proposed attack methodology, on both DNN and compressed HashNet models with the Gradient Inhibition method. Fig. 10 (a) and (b) show the success rates of adversarial attacks under Gradient Inhibition over HashNets (for MNIST) and four DNNs (for CIFAR10), respectively. As Fig. 9(a) shows, the average success rate of adversarial attacks (HashNets, perturbations crafted through HFGSM with ) can be reduced from 87.99% to 4.77% by increasing the inhibition coefficient from 0 to 0.1. Specifically, the uncompressed model presents the best efficiency () while all compressed HashNets exhibit some resistance to Gradient Inhibition and eventually reduce the adversarial success rate to less then 10% at all selected compression rates. Fig. 9(b) evaluate the efficiency of proposed Gradient Inhibition on DNNs with CIFAR10 database. The average success rate is dropped from 86.74% to 4.64% across various DNNs, demonstrating effective mitigations for adversarial attacks.
Vi Conclusion
The emerging adversarial attacks leave the prevalent hardware accelerated Deep Neural Networks (DNNs) exposed to hackers. However, existing DNN security researches solely focus on the input perturbations but neglect the impacts of modelreshaping essential for DNN hardware deployment. In this work, the multifactor adversarial attack problem is for the first time modeled and studied through extensive experimental and theoretical analysis. Based on the explorations of modelreshaping and adversarial examples generating, a novel mitigation technique – “Gradient Inhibition” is further proposed to effectively alleviate the severity of adversarial attacks for various DNNs. Our simulations demonstrate that “Gradient Inhibition” can significantly reduce the success rate of adversarial attacks while maintaining the desired inference accuracy without additional trainings. We hope that our results enable the community to examine the emerging security issues of hardwareoriented DNNs.
References

[1]
A. Krizhevsky et al.
, “Imagenet classification with deep convolutional neural networks,” in
Advances in neural information processing systems, 2012, pp. 1097–1105.  [2] https://cloudplatform.googleblog.com/2016/05/Googlesuperchargesmachinelearningtaskswithcustomchip.html.
 [3] https://research.fb.com/category/facebookairesearchfair/.
 [4] https://www.microsoft.com/enus/research/researcharea/artificialintelligence/.
 [5] D.C. Ciresan et al., “Flexible, high performance convolutional neural networks for image classification,” in IJCAI ProceedingsInternational Joint Conference on Artificial Intelligence, vol. 22, no. 1. Barcelona, Spain, 2011, p. 1237.
 [6] V. Vanhoucke et al., “Improving the speed of neural networks on cpus,” in Proc. Deep Learning and Unsupervised Feature Learning NIPS Workshop, vol. 1, 2011, p. 4.
 [7] C. Farabet et al., “Largescale fpgabased convolutional networks,” Scaling up Machine Learning: Parallel and Distributed Approaches, pp. 399–419, 2011.
 [8] https://www.perspectiveapi.com/.
 [9] N.P. Jouppi et al., “Indatacenter performance analysis of a tensor processing unit,” arXiv preprint arXiv:1704.04760, 2017.
 [10] https://cloud.google.com/blog/bigdata/2017/05/anindepthlookatgooglesfirsttensorprocessingunittpu.
 [11] Z. Ghahramani, “Probabilistic machine learning and artificial intelligence,” Nature, vol. 521, no. 7553, p. 452, 2015.
 [12] M. Barreno et al., “The security of machine learning,” Machine Learning, vol. 81, no. 2, pp. 121–148, 2010.
 [13] I.J. Goodfellow et al., “Explaining and harnessing adversarial examples,” arXiv preprint arXiv:1412.6572, 2014.
 [14] N. Papernot et al., “Practical blackbox attacks against deep learning systems using adversarial examples,” arXiv preprint arXiv:1602.02697, 2016.
 [15] N. Papernot et al., “The limitations of deep learning in adversarial settings,” in Security and Privacy (EuroS&P), 2016 IEEE European Symposium on. IEEE, 2016, pp. 372–387.
 [16] A. Fawzi et al., “Analysis of classifiers’ robustness to adversarial perturbations,” arXiv preprint arXiv:1502.02590, 2015.
 [17] S. Gu et al., “Towards deep neural network architectures robust to adversarial examples,” arXiv preprint arXiv:1412.5068, 2014.
 [18] N. Papernot et al., “Distillation as a defense to adversarial perturbations against deep neural networks,” in Security and Privacy (SP), 2016 IEEE Symposium on. IEEE, 2016, pp. 582–597.
 [19] W. Chen et al., “Compressing neural networks with the hashing trick,” in International Conference on Machine Learning, 2015, pp. 2285–2294.
 [20] Z. Cao et al., “Hashnet: Deep learning to hash by continuation,” arXiv preprint arXiv:1702.00758, 2017.
 [21] S. Han et al., “Learning both weights and connections for efficient neural network,” in Advances in Neural Information Processing Systems, 2015, pp. 1135–1143.
 [22] S. Han et al., “Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding,” arXiv preprint arXiv:1510.00149, 2015.
 [23] Y. LeCun, “The mnist database of handwritten digits,” http://yann. lecun. com/exdb/mnist/, 1998.
 [24] A. Krizhevsky et al., “Learning multiple layers of features from tiny images,” 2009.
 [25] G.E. Hinton et al., “Reducing the dimensionality of data with neural networks,” science, vol. 313, no. 5786, pp. 504–507, 2006.
 [26] K. Simonyan et al., “Very deep convolutional networks for largescale image recognition,” arXiv preprint arXiv:1409.1556, 2014.

[27]
C. Szegedy et al., “Going deeper with convolutions,” in
Proceedings of the IEEE conference on computer vision and pattern recognition
, 2015, pp. 1–9.  [28] Y. Cheng et al., “An exploration of parameter redundancy in deep networks with circulant projections,” in Proceedings of the IEEE International Conference on Computer Vision, 2015, pp. 2857–2865.
 [29] S. Han et al., “Eie: efficient inference engine on compressed deep neural network,” in Proceedings of the 43rd International Symposium on Computer Architecture. IEEE Press, 2016, pp. 243–254.
 [30] K. Weinberger et al., “Feature hashing for large scale multitask learning,” in Proceedings of the 26th Annual International Conference on Machine Learning. ACM, 2009, pp. 1113–1120.
Comments
There are no comments yet.