ShiftAddAug: Augment Multiplication-Free Tiny Neural Network with Hybrid Computation
Not on the map. Why?
Abstract (arXiv)
Operators devoid of multiplication, such as Shift and Add, have gained prominence for their compatibility with hardware. However, neural networks (NNs) employing these operators typically exhibit lower accuracy compared to conventional NNs with identical structures. ShiftAddAug uses costly multiplication to augment efficient but less powerful multiplication-free operators, improving performance without any inference overhead. It puts a ShiftAdd tiny NN into a large multiplicative model and encourages it to be trained as a sub-model to obtain additional supervision. In order to solve the weight discrepancy problem between hybrid operators, a new weight sharing method is proposed. Additionally, a novel two stage neural architecture search is used to obtain better augmentation effects for smaller but stronger multiplication-free tiny neural networks. The superiority of ShiftAddAug is validated through experiments in image classification and semantic segmentation, consistently delivering noteworthy enhancements. Remarkably, it secures up to a 4.95% increase in accuracy on the CIFAR100 compared to its directly trained counterparts, even surpassing the performance of multiplicative NNs.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 29 of its 46 references that are in the map. First posted on arXiv 3 Jul 2024.
Builds on
29 of 46 references.
References · 29
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2019Searching for MobileNetV3cited by 1,984
- 2018MnasNet: Platform-Aware Neural Architecture Search for Mobilecited by 937
- 2016XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networkscited by 829
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 778
- 2018ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardwarecited by 666
- 2018FBNet: Hardware-Aware Efficient ConvNet Design via Differentiable Neural Architecture Searchcited by 480
- 2018HAQ: Hardware-Aware Automated Quantization with Mixed Precisioncited by 426
- 2020MCUNet: Tiny Deep Learning on IoT Devicescited by 269
17 more
- 2019Auto-DeepLab: Hierarchical Neural Architecture Search for Semantic Image Segmentationcited by 258
- 2019Universally Slimmable Networks and Improved Training Techniquescited by 219
- 2019Additive Powers-of-Two Quantization: An Efficient Non-uniform Discretization for Neural Networkscited by 143
- 2017Shift: A Zero FLOP, Zero Parameter Alternative to Spatial Convolutionscited by 93
- 2021MCUNetV2: Memory-Efficient Patch-based Inference for Tiny Deep Learningcited by 87
- 2019AdderNet: Do We Really Need Multiplications in Deep Learning?cited by 82
- 2019DeepShift: Towards Multiplication-Less Neural Networkscited by 52
- 2020ShiftAddNet: A Hardware-Inspired Deep Networkcited by 52
- 2019All You Need is a Few Shifts: Designing Efficient Convolutional Neural Networks for Image Classificationcited by 38
- 2020AdderSR: Towards Energy Efficient Image Super-Resolutioncited by 32
- 2021NAAS: Neural Accelerator Architecture Searchcited by 24
- 2021Network Augmentation for Tiny Deep Learningcited by 23
- 2020DNN-Chip Predictor: An Analytical Performance Predictor for DNN Accelerators with Various Dataflows and Hardware Architecturescited by 16
- 2023ShiftAddViT: Mixture of Multiplication Primitives Towards Efficient Vision Transformercited by 15
- 2021AdderNet and its Minimalist Hardware Design for Energy-Efficient Artificial Intelligencecited by 10
- 2022ShiftAddNAS: Hardware-Inspired Search for More Accurate and Efficient Neural Networkscited by 8
- 2022NASA: Neural Architecture Search and Acceleration for Hardware Inspired Hybrid Networkscited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.