CACU
This is a deep learning framework for cnn which using xnor method to accelerate calculating convolution layer on cpu.
view repo
We propose two efficient approximations to standard convolutional neural networks: BinaryWeightNetworks and XNORNetworks. In BinaryWeightNetworks, the filters are approximated with binary values resulting in 32x memory saving. In XNORNetworks, both the filters and the input to convolutional layers are binary. XNORNetworks approximate convolutions using primarily binary operations. This results in 58x faster convolutional operations and 32x memory savings. XNORNets offer the possibility of running stateoftheart networks on CPUs (rather than GPUs) in realtime. Our binary networks are simple, accurate, efficient, and work on challenging visual tasks. We evaluate our approach on the ImageNet classification task. The classification accuracy with a BinaryWeightNetwork version of AlexNet is only 2.9 fullprecision AlexNet (in top1 measure). We compare our method with recent network binarization methods, BinaryConnect and BinaryNets, and outperform these methods by large margins on ImageNet, more than 16
READ FULL TEXT VIEW PDF
We introduce a novel scheme to train binary convolutional neural network...
read it
We trained Binarized Neural Networks (BNNs) on the high resolution Image...
read it
Modern deep neural networks are powerful and widely applicable models th...
read it
We propose and study a new projection formula for training binary weight...
read it
Recent efforts on training lightweight binary neural networks offer
pro...
read it
Current deep learning methods are based on the repeated, expensive
appli...
read it
We introduce Larq Compute Engine, the world's fastest Binarized Neural
N...
read it
This is a deep learning framework for cnn which using xnor method to accelerate calculating convolution layer on cpu.
Distributed training of Binary Neural Networks using Evolutionary Strategies
None
Deep neural networks (DNN) have shown significant improvements in several application domains including computer vision and speech recognition. In computer vision, a particular type of DNN, known as Convolutional Neural Networks (CNN), have demonstrated stateoftheart results in object recognition
[1, 2, 3, 4] and detection [5, 6, 7].Convolutional neural networks show reliable results on object recognition and detection that are useful in real world applications. Concurrent to the recent progress in recognition, interesting advancements have been happening in virtual reality (VR by Oculus) [8], augmented reality (AR by HoloLens) [9], and smart wearable devices. Putting these two pieces together, we argue that it is the right time to equip smart portable devices with the power of stateoftheart recognition systems. However, CNNbased recognition systems need large amounts of memory and computational power. While they perform well on expensive, GPUbased machines, they are often unsuitable for smaller devices like cell phones and embedded electronics.
For example, AlexNet[1]
has 61M parameters (249MB of memory) and performs 1.5B high precision operations to classify one image. These numbers are even higher for deeper CNNs
e.g.,VGG [2] (see section 4.1). These models quickly overtax the limited storage, battery power, and compute capabilities of smaller devices like cell phones.In this paper, we introduce simple, efficient, and accurate approximations to CNNs by binarizing the weights and even the intermediate representations in convolutional neural networks. Our binarization method aims at finding the best approximations of the convolutions using binary operations. We demonstrate that our way of binarizing neural networks results in ImageNet classification accuracy numbers that are comparable to standard full precision networks while requiring a significantly less memory and fewer floating point operations.
We study two approximations: Neural networks with binary weights and XNORNetworks. In BinaryWeightNetworks all the weight values are approximated with binary values. A convolutional neural network with binary weights is significantly smaller (
) than an equivalent network with singleprecision weight values. In addition, when weight values are binary, convolutions can be estimated by only addition and subtraction (without multiplication), resulting in
speed up. Binaryweight approximations of large CNNs can fit into the memory of even small, portable devices while maintaining the same level of accuracy (See Section 4.1 and 4.2).To take this idea further, we introduce XNORNetworks where both the weights and the inputs to the convolutional and fully connected layers are approximated with binary values^{1}^{1}1fully connected layers can be implemented by convolution, therefore, in the rest of the paper, we refer to them also as convolutional layers [10].. Binary weights and binary inputs allow an efficient way of implementing convolutional operations. If all of the operands of the convolutions are binary, then the convolutions can be estimated by XNOR and bitcounting operations [11]. XNORNets result in accurate approximation of CNNs while offering speed up in CPUs (in terms of number of the high precision operations). This means that XNORNets can enable realtime inference in devices with small memory and no GPUs (Inference in XNORNets can be done very efficiently on CPUs).
To the best of our knowledge this paper is the first attempt to present an evaluation of binary neural networks on largescale datasets like ImageNet. Our experimental results show that our proposed method for binarizing convolutional neural networks outperforms the stateoftheart network binarization method of [11] by a large margin () on top1 image classification in the ImageNet challenge ILSVRC2012. Our contribution is twofold: First, we introduce a new way of binarizing the weight values in convolutional neural networks and show the advantage of our solution compared to stateoftheart solutions. Second, we introduce XNORNets, a deep neural network model with binary weights and binary inputs and show that XNORNets can obtain similar classification accuracies compared to standard networks while being significantly more efficient. Our code is available at: http://allenai.org/plato/xnornet
Deep neural networks often suffer from overparametrization and large amounts of redundancy in their models. This typically results in inefficient computation and memory usage[12]. Several methods have been proposed to address efficient training and inference in deep neural networks.
Shallow networks: Estimating a deep neural network with a shallower model reduces the size of a network. Early theoretical work by Cybenko shows that a network with a large enough single hidden layer of sigmoid units can approximate any decision boundary [13]. In several areas (e.g.,vision and speech), however, shallow networks cannot compete with deep models [14]. [15] trains a shallow network on SIFT features to classify the ImageNet dataset. They show it is difficult to train shallow networks with large number of parameters. [16] provides empirical evidence on small datasets (e.g.,CIFAR10) that shallow nets are capable of learning the same functions as deep nets. In order to get the similar accuracy, the number of parameters in the shallow network must be close to the number of parameters in the deep network. They do this by first training a stateoftheart deep model, and then training a shallow model to mimic the deep model. These methods are different from our approach because we use the standard deep architectures not the shallow estimations.
Compressing pretrained deep networks: Pruning redundant, noninformative weights in a previously trained network reduces the size of the network at inference time. Weight decay [17] was an early method for pruning a network. Optimal Brain Damage [18] and Optimal Brain Surgeon [19]
use the Hessian of the loss function to prune a network by reducing the number of connections. Recently
[20] reduced the number of parameters by an order of magnitude in several stateoftheart neural networks by pruning. [21] proposed to reduce the number of activations for compression and acceleration. Deep compression [22] reduces the storage and energy required to run inference on large networks so they can be deployed on mobile devices. They remove the redundant connections and quantize weights so that multiple connections share the same weight, and then they use Huffman coding to compress the weights. HashedNets [23] uses a hash function to reduce model size by randomly grouping the weights, such that connections in a hash bucket use a single parameter value. Matrix factorization has been used by [24, 25]. We are different from these approaches because we do not use a pretrained network. We train binary networks from scratch.Designing compact layers: Designing compact blocks at each layer of a deep network can help to save memory and computational costs. Replacing the fully connected layer with global average pooling was examined in the Network in Network architecture [26], GoogLenet[3] and ResidualNet[4], which achieved stateoftheart results on several benchmarks. The bottleneck structure in ResidualNet [4] has been proposed to reduce the number of parameters and improve speed. Decomposing convolutions with two is used in [27] and resulted in stateoftheart performance on object recognition. Replacing convolutions with convolutions is used in [28] to create a very compact neural network that can achieve reduction in the number of parameters while obtaining high accuracy. Our method is different from this line of work because we use the full network (not the compact version) but with binary parameters.
Quantizing parameters: High precision parameters are not very important in achieving high performance in deep networks. [29]
proposed to quantize the weights of fully connected layers in a deep network by vector quantization techniques. They showed just thresholding the weight values at zero only decreases the top1 accuracy on ILSVRC2012 by less than
10. [30] proposed a provably polynomial time algorithm for training a sparse networks with +1/0/1 weights. A fixedpoint implementation of 8bit integer was compared with 32bit floating point activations in [31]. Another fixedpoint network with ternary weights and 3bits activations was presented by [32]. Quantizing a network with error minimization achieved better accuracy on MNIST and CIFAR10 datasets in [33]. [34]proposed a backpropagation process by quantizing the representations at each layer of the network. To convert some of the remaining multiplications into binary shifts the neurons get restricted values of poweroftwo integers. In
[34] they carry the full precision weights during the test phase, and only quantize the neurons during the backpropagation process, and not during the forwardpropagation. Our work is similar to these methods since we are quantizing the parameters in the network. But our quantization is the extreme scenario +1,1.Network binarization: These works are the most related to our approach. Several methods attempt to binarize the weights and the activations in neural networks.The performance of highly quantized networks (e.g.,binarized) were believed to be very poor due to the destructive property of binary quantization [35]
. Expectation BackPropagation (EBP) in
[36] showed high performance can be achieved by a network with binary weights and binary activations. This is done by a variational Bayesian approach, that infers networks with binary weights and neurons. A fully binary network at run time presented in [37] using a similar approach to EBP, showing significant improvement in energy efficiency. In EBP the binarized parameters were only used during inference. BinaryConnect [38] extended the probablistic idea behind EBP. Similar to our approach, BinaryConnect uses the realvalued version of the weights as a key reference for the binarization process. The realvalued weight updated using the back propagated error by simply ignoring the binarization in the update. BinaryConnect achieved stateoftheart results on small datasets (e.g.,CIFAR10, SVHN). Our experiments shows that this method is not very successful on largescale datsets (e.g.,ImageNet). BinaryNet[11] propose an extention of BinaryConnect, where both weights and activations are binarized. Our method is different from them in the binarization method and the network structure. We also compare our method with BinaryNet on ImageNet, and our method outperforms BinaryNet by a large margin.[39] argued that the noise introduced by weight binarization provides a form of regularization, which could help to improve test accuracy. This method binarizes weights while maintaining full precision activation. [40] proposed fully binary training and testing in an array of committee machines with randomized input. [41] retraine a previously trained neural network with binary weights and binary inputs.We represent an layer CNN architecture with a triplet .
is a set of tensors, where each element
is the input tensor for the layer of CNN (Green cubes in figure 1). is a set of tensors, where each element in this set is the weight filter in the layer of the CNN. is the number of weight filters in the layer of the CNN. represents a convolutional operation with and as its operands^{2}^{2}2In this paper we assume convolutional filters do not have bias terms. , where represents channels, width and height respectively., where . We propose two variations of binary CNN: Binaryweights, where the elements of are binary tensors and XNORNetworks, where elements of both and are binary tensors.In order to constrain a convolutional neural network to have binary weights, we estimate the realvalue weight filter using a binary filter and a scaling factor such that . A convolutional operation can be appriximated by:
(1) 
where, indicates a convolution without any multiplication. Since the weight values are binary, we can implement the convolution with additions and subtractions. The binary weight filters reduce memory usage by a factor of compared to singleprecision filters. We represent a CNN with binary weights by , where is a set of binary tensors and is a set of positive real scalars, such that is a binary filter and is an scaling factor and
Without loss of generality we assume are vectors in , where . To find an optimal estimation for , we solve the following optimization:
(2) 
by expanding equation 2, we have
(3) 
since , is a constant . is also a constant because is a known variable. Lets define . Now, we can rewrite the equation 3 as follow: . The optimal solution for can be achieved by maximizing the following constrained optimization: (note that is a positive value in equation 2, therefore it can be ignored in the maximization)
(4) 
This optimization can be solved by assigning if and if , therefore the optimal solution is . In order to find the optimal value for the scaling factor , we take the derivative of with respect to and set it to zero:
(5) 
By replacing with
(6) 
therefore, the optimal estimation of a binary weight filter can be simply achieved by taking the sign of weight values. The optimal scaling factor is the average of absolute weight values.
Each iteration of training a CNN involves three steps; forward pass, backward pass and parameters update. To train a CNN with binary weights (in convolutional layers), we only binarize the weights during the forward pass and backward propagation. To compute the gradient for function , we follow the same approach as [11], where . The gradient in backward after the scaled sign function is . For updating the parameters, we use the high precision (realvalue) weights. Because, in gradient descend the parameter changes are tiny, binarization after updating the parameters ignores these changes and the training objective can not be improved. [11, 38] also employed this strategy to train a binary network.
Algorithm 1 demonstrates our procedure for training a CNN with binary weights. First, we binarize the weight filters at each layer by computing and . Then we call forward propagation using binary weights and its corresponding scaling factors, where all the convolutional operations are carried out by equation 1. Then, we call backward propagation, where the gradients are computed with respect to the estimated weight filters . Lastly, the parameters and the learning rate gets updated by an update rule e.g.,SGD update with momentum or ADAM [42].
Once the training finished, there is no need to keep the realvalue weights. Because, at inference we only perform forward propagation with the binarized weights.
So far, we managed to find binary weights and a scaling factor to estimate the realvalue weights. The inputs to the convolutional layers are still realvalue tensors. Now, we explain how to binarize both weigths and inputs, so convolutions can be implemented efficiently using XNOR and bitcounting operations. This is the key element of our XNORNetworks. In order to constrain a convolutional neural network to have binary weights and binary inputs, we need to enforce binary operands at each step of the convolutional operation. A convolution consist of repeating a shift operation and a dot product. Shift operation moves the weight filter over the input and the dot product performs elementwise multiplications between the values of the weight filter and the corresponding part of the input. If we express dot product in terms of binary operations, convolution can be approximated using binary operations. Dot product between two binary vectors can be implemented by XNORBitcounting operations [11]. In this section, we explain how to approximate the dot product between two vectors in by a dot product between two vectors in . Next, we demonstrate how to use this approximation for estimating a convolutional operation between two tensors.
To approximate the dot product between such that , where and , we solve the following optimization:
(7) 
where indicates elementwise product. We define such that , such that and such that . The equation 7 can be written as:
(8) 
the optimal solutions can be achieved from equation 2 as follow
(9) 
Since are independent, knowing that then,
therefore,
(10) 
Convolving weight filter (where ) with the input tensor requires computing the scaling factor for all possible subtensors in with same size as . Two of these subtensors are illustrated in figure 2 (second row) by and . Due to overlaps between subtensors, computing for all possible subtensors leads to a large number of redundant computations. To overcome this redundancy, first, we compute a matrix , which is the average over absolute values of the elements in the input across the channel. Then we convolve with a 2D filter , , where . contains scaling factors for all subtensors in the input . corresponds to for a subtensor centered at the location (across width and height). This procedure is shown in the third row of figure 2. Once we obtained the scaling factor for the weight and for all subtensors in (denoted by ), we can approximate the convolution between input and weight filter mainly using binary operations:
(11) 
where indicates a convolutional operation using XNOR and bitcount operations. This is illustrated in the last row in figure 2. Note that the number of nonbinary operations is very small compared to binary operations.
A typical block in CNN contains several different layers. Figure 3
(left) illustrates a typical block in a CNN. This block has four layers in the following order: 1Convolutional, 2Batch Normalization, 3Activation and 4Pooling. Batch Normalization layer
[43]normalizes the input batch by its mean and variance. The activation is an elementwise nonlinear function (
e.g.,Sigmoid, ReLU). The pooling layer applies any type of pooling (
e.g.,max,min or average) on the input batch. Applying pooling on binary input results in significant loss of information. For example, maxpooling on binary input returns a tensor that most of its elements are equal to
. Therefore, we put the pooling layer after the convolution. To further decrease the information loss due to binarization, we normalize the input before binarization. This ensures the data to hold zero mean, therefore, thresholding at zero leads to less quantization error. The order of layers in a block of binary CNN is shown in Figure 3(right).The binary activation layer(BinActiv) computes and as explained in section 3.2.2. In the next layer (BinConv), given and , we compute binary convolution by equation 11. Then at the last layer (Pool), we apply the pooling operations. We can insert a nonbinary activation(e.g.,ReLU) after binary convolution. This helps when we use stateoftheart networks (e.g.,AlexNet or VGG).
Once we have the binary CNN structure, the training algorithm would be the same as algorithm 1.
Binary Gradient: The computational bottleneck in the backward pass at each layer is computing a convolution between weight filters() and the gradients with respect of the inputs (). Similar to binarization in the forward pass, we can binarize in the backward pass. This leads to a very efficient training procedure using binary operations. Note that if we use equation 6 to compute the scaling factor for , the direction of maximum change for SGD would be diminished. To preserve the maximum change in all dimensions, we use as the scaling factor.
bit Quantization: So far, we showed 1bit quantization of weights and inputs using function. One can easily extend the quantization level to bits by using instead of the function. Where indicates rounding operation and .
We evaluate our method by analyzing its efficiency and accuracy. We measure the efficiency by computing the computational speedup (in terms of number of high precision operation) achieved by our binary convolution vs. standard convolution. To measure accuracy, we perform image classification on the largescale ImageNet dataset. This paper is the first work that evaluates binary neural networks on the ImageNet dataset. Our binarization technique is general, we can use any CNN architecture. We evaluate AlexNet [1] and two deeper architectures in our experiments. We compare our method with two recent works on binarizing neural networks; BinaryConnect [38] and BinaryNet [11]. The classification accuracy of our binaryweightnetwork version of AlexNet is as accurate as the full precision version of AlexNet. This classification accuracy outperforms competitors on binary neural networks by a large margin. We also present an ablation study, where we evaluate the key elements of our proposed method; computing scaling factors and our block structure for binary CNN. We shows that our method of computing the scaling factors is important to reach high accuracy.
In an standard convolution, the total number of operations is , where is the number of channels, and . Note that some modern CPUs can fuse the multiplication and addition as a single cycle operation. On those CPUs, BinaryWeightNetworks does not deliver speed up. Our binary approximation of convolution (equation 11) has binary operations and nonbinary operations. With the current generation of CPUs, we can perform 64 binary operations in one clock of CPU, therefore the speedup can be computed by .
The speedup depends on the channel size and filter size but not the input size. In figure 4(bc) we illustrate the speedup achieved by changing the number of channels and filter size. While changing one parameter, we fix other parameters as follows: , and (majority of convolutions in ResNet[4] architecture have this structure). Using our approximation of convolution we gain 62.27 theoretical speed up, but in our CPU implementation with all of the overheads, we achieve 58x speed up in one convolution (Excluding the process for memory allocation and memory access). With the small channel size () and filter size () the speedup is not considerably high. This motivates us to avoid binarization at the first and last layer of a CNN. In the first layer the chanel size is and in the last layer the filter size is . A similar strategy was used in [11]. Figure 4a shows the required memory for three different CNN architectures(AlexNet, VGG19, ResNet18) with binary and double precision weights. Binaryweightnetworks are so small that can be easily fitted into portable devices. BinaryNet [11] is in the same order of memory and computation efficiency as our method. In Figure 4, we show an analysis of computation and memory cost for a binary convolution. The same analysis is valid for BinaryNet and BinaryConnect. The key difference of our method is using a scalingfactor, which does not change the order of efficiency while providing a significant improvement in accuracy.
We evaluate the performance of our proposed approach on the task of natural image classification. So far, in the literature, binary neural network methods have presented their evaluations on either limited domain or simplified datasets e.g.,CIFAR10, MNIST, SVHN. To compare with stateoftheart vision, we evaluate our method on ImageNet (ILSVRC2012). ImageNet has 1.2M train images from 1K categories and 50K validation images. The images in this dataset are natural images with reasonably high resolution compared to the CIFAR and MNIST dataset, which have relatively small images. We report our classification performance using Top1 and Top5 accuracies. We adopt three different CNN architectures as our base architectures for binarization: AlexNet [1], Residual Networks (known as ResNet) [4], and a variant of GoogLenet [3].We compare our Binaryweightnetwork (BWN) with BinaryConnect(BC) [38] and our XNORNetworks(XNORNet) with BinaryNeuralNet(BNN) [11]. BinaryConnect(BC) is a method for training a deep neural network with binary weights during forward and backward propagations. Similar to our approach, they keep the realvalue weights during the updating parameters step. Our binarization is different from BC. The binarization in BC can be either deterministic or stochastic. We use the deterministic binarization for BC in our comparisons because the stochastic binarization is not efficient. The same evaluation settings have been used and discussed in [11]. BinaryNeuralNet(BNN) [11] is a neural network with binary weights and activations during inference and gradient computation in training. In concept, this is a similar approach to our XNORNetwork but the binarization method and the network structure in BNN is different from ours. Their training algorithm is similar to BC and they used deterministic binarization in their evaluations.
CIFAR10 : BC and BNN showed near stateoftheart performance on CIFAR10, MNIST, and SVHN dataset. BWN and XNORNet on CIFAR10 using the same network architecture as BC and BNN achieve the error rate of 9.88% and 10.17% respectively. In this paper we explore the possibility of obtaining near stateoftheart results on a much larger and more challenging dataset (ImageNet).
AlexNet:
This figure compares the imagenet classification accuracy on Top1 and Top5 across training epochs. Our approaches BWN and XNORNet outperform BinaryConnect(BC) and BinaryNet(BNN) in all the epochs by large margin(
17%).[1] is a CNN architecture with 5 convolutional layers and two fullyconnected layers. This architecture was the first CNN architecture that showed to be successful on ImageNet classification task. This network has 61M parameters. We use AlexNet coupled with batch normalization layers [43].
Classification Accuracy()  
BinaryWeight  BinaryInputBinaryWeight  FullPrecision  
BWN  BC[11]  XNORNet  BNN[11]  AlexNet[1]  
Top1  Top5  Top1  Top5  Top1  Top5  Top1  Top5  Top1  Top5 
56.8  79.4  35.4  61.0  44.2  69.2  27.9  50.42  56.6  80.2 
Train: In each iteration of training, images are resized to have 256 pixel at their smaller dimension and then a random crop of is selected for training. We run the training algorithm for 16 epochs with batche size equal to 512. We use negativeloglikelihood over the softmax of the outputs as our classification loss function. In our implementation of AlexNet we do not use the LocalResponseNormalization(LRN) layer^{3}^{3}3Our implementation is followed by https://gist.github.com/szagoruyko/dd032c529048492630fc. We use SGD with momentum=0.9 for updating parameters in BWN and BC. For XNORNet and BNN we used ADAM [42]. ADAM converges faster and usually achieves better accuracy for binary inputs [11]. The learning rate starts at 0.1 and we apply a learningratedecay=0.01 every 4 epochs.
Test: At inference time, we use the center crop for forward propagation.
Figure 5 demonstrates the classification accuracy for training and inference along the training epochs for top1 and top5 scores. The dashed lines represent training accuracy and solid lines shows the validation accuracy. In all of the epochs our method outperforms BC and BNN by large margin (17%). Table 1 compares our final accuracy with BC and BNN. We found that the scaling factors for the weights () is much more effective than the scaling factors for the inputs (). Removing reduces the accuracy by a small margin (less than top1 alexnet).
Binary Gradient: Using XNORNet with binary gradient the accuracy of top1 will drop only by 1.4%.
ResNet18  GoogLenet  
Network Variations  top1  top5  top1  top5 
BinaryWeightNetwork  60.8  83.0  65.5  86.1 
XNORNetwork  51.2  73.2  N/A  N/A 
FullPrecisionNetwork  69.3  89.2  71.3  90.0 
Residual Net : We use the ResNet18 proposed in [4] with shortcut type B.^{4}^{4}4
We used the Torch implementation in
https://github.com/facebook/fb.resnet.torchTrain: In each training iteration, images are resized randomly between 256 and 480 pixel on the smaller dimension and then a random crop of is selected for training. We run the training algorithm for 58 epochs with batch size equal to 256 images. The learning rate starts at 0.1 and we use the learningratedecay equal to 0.01 at epochs number 30 and 40.
Test: At inference time, we use the center crop for forward propagation.
Figure 6 demonstrates the classification accuracy (Top1 and Top5) along the epochs for training and inference. The dashed lines represent training and the solid lines represent inference. Table 2 shows our final accuracy by BWN and XNORNet.
GoogLenet Variant : We experiment with a variant of GoogLenet [3] that uses a similar number of parameters and connections but only straightforward convolutions, no branching^{5}^{5}5We used the Darknet [44] implementation: http://pjreddie.com/darknet/imagenet/#extraction. It has 21 convolutional layers with filter sizes alternating between and .
Train: Images are resized randomly between 256 and 320 pixel on the smaller dimension and then a random crop of is selected for training. We run the training algorithm for 80 epochs with batch size of 128. The learning rate starts at 0.1 and we use polynomial rate decay, .
Test: At inference time, we use a center crop of .


There are two key differences between our method and the previous network binariazation methods; the binararization technique and the block structure in our binary CNN. For binarization, we find the optimal scaling factors at each iteration of training. For the block structure, we order the layers in a block in a way that decreases the quantization loss for training XNORNet. Here, we evaluate the effect of each of these elements in the performance of the binary networks. Instead of computing the scaling factor using equation 6, one can consider as a network parameter. In other words, a layer after binary convolution multiplies the output of convolution by an scalar parameter for each filter. This is similar to computing the affine parameters in batch normalization. Table 3a compares the performance of a binary network with two ways of computing the scaling factors. As we mentioned in section 3.2.2 the typical block structure in CNN is not suitable for binarization. Table 3b compares the standard block structure CBAP (Convolution, Batch Normalization, Activation, Pooling) with our structure BACP. (A, is binary activation).
We introduce simple, efficient, and accurate binary approximations for neural networks. We train a neural network that learns to find binary values for weights, which reduces the size of network by and provide the possibility of loading very deep neural networks into portable devices with limited memory. We also propose an architecture, XNORNet, that uses mostly bitwise operations to approximate convolutions. This provides speed up and enables the possibility of running the inference of state of the art deep neural network on CPU (rather than GPU) in realtime.
This work is in part supported by ONR N000141310720, NSF IIS 1338054, Allen Distinguished Investigator Award, and the Allen Institute for Artificial Intelligence.
In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. (2015) 1–9
Predicting parameters in deep learning.
In: Advances in Neural Information Processing Systems. (2013) 2148–2156Approximation by superpositions of a sigmoidal function.
Mathematics of control, signals and systems 2(4) (1989) 303–314Inceptionv4, inceptionresnet and the impact of residual connections on learning.
CoRR (2016)In: Proceedings of the 30th International Conference on Machine Learning (ICML13). (2013) 1058–1066
Subdominant dense clusters allow for simple learning and high computational performance in neural networks with discrete synapses.
Physical review letters 115(12) (2015) 128101
Comments
There are no comments yet.