PokeBNN: A Binary Pursuit of Lightweight Accuracy
Yichi Zhang, Zhiru Zhang, Lukasz Lew

TL;DR
PokeBNN introduces a novel binary convolution block and cost metric, achieving state-of-the-art accuracy in binary neural networks with significantly reduced computational effort on ImageNet.
Contribution
The paper proposes PokeConv, a new binary convolution block, and the ACE cost metric, enabling improved accuracy and efficiency in binary neural networks.
Findings
Achieves 75.6% top-1 accuracy with low ACE cost
Outperforms previous SOTA ReActNet-Adam in accuracy and efficiency
Provides implementation and reproduction instructions in open-source repository
Abstract
Optimization of Top-1 ImageNet promotes enormous networks that may be impractical in inference settings. Binary neural networks (BNNs) have the potential to significantly lower the compute intensity but existing models suffer from low quality. To overcome this deficiency, we propose PokeConv, a binary convolution block which improves quality of BNNs by techniques such as adding multiple residual paths, and tuning the activation function. We apply it to ResNet-50 and optimize ResNet's initial convolutional layer which is hard to binarize. We name the resulting network family PokeBNN. These techniques are chosen to yield favorable improvements in both top-1 accuracy and the network's cost. In order to enable joint optimization of the cost together with accuracy, we define arithmetic computation effort (ACE), a hardware- and energy-inspired cost metric for quantized and binarized networks.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Neural Network Applications · Domain Adaptation and Few-Shot Learning · Adversarial Robustness in Machine Learning
MethodsConvolution
