Publication | Closed Access
RB-Net: Training Highly Accurate and Efficient Binary Neural Networks With Reshaped Point-Wise Convolution and Balanced Activation
27
Citations
32
References
2022
Year
Geometric LearningConvolutional Neural NetworkEngineeringMachine LearningNeural Networks (Machine Learning)Computational ComplexitySocial SciencesTraining Highly AccurateImage AnalysisSparse Neural NetworkBalanced ActivationComputing SystemsEfficient RpcParallel ComputingMachine VisionComputer EngineeringComputer ScienceNeural Networks (Computational Neuroscience)Neural Architecture SearchModel CompressionComputer VisionConventional Convolution OperationReshaped Point-wise Convolution
In this paper, we find that the conventional convolution operation becomes the bottleneck for extremely efficient binary neural networks (BNNs). To address this issue, we open up a new direction by introducing a reshaped point-wise convolution (RPC) to replace the conventional one to build BNNs. Specifically, we conduct a point-wise convolution after rearranging the spatial information into depth, with which at least <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$2.25\times $ </tex-math></inline-formula> computation reduction can be achieved. Such an efficient RPC allows us to explore more powerful representational capacity of BNNs under a given computation complexity budget. Moreover, we propose to use a balanced activation (BA) to adjust the distribution of the scaled activations after binarization, which enables significant performance improvement of BNNs. After integrating RPC and BA, the proposed network, dubbed as RB-Net, strikes a good trade-off between accuracy and efficiency, achieving superior performance with lower computational cost against the state-of-the-art BNN methods. Specifically, our RB-Net achieves 66.8% Top-1 accuracy with ResNet-18 backbone on ImageNet, exceeding the state-of-the-art Real-to-Binary Net (65.4%) by 1.4% while achieving more than <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$3\times $ </tex-math></inline-formula> reduction (52M vs. 165M) in computational complexity.
| Year | Citations | |
|---|---|---|
Page 1
Page 1