mlsanityData to 14 Oct 2026

Hardware Efficient Approximate Convolution with Tunable Error Tolerance for CNNs

arXiv 2603.10100 ↗First posted 10 Mar 2026cs.LG cs.AI cs.ARcited by 0

Not on the map. Why?

Abstract (arXiv)

Modern CNNs' high computational demands hinder edge deployment, as traditional ``hard'' sparsity (skipping mathematical zeros) loses effectiveness in deep layers or with smooth activations like Tanh. We propose a ``soft sparsity'' paradigm using a hardware efficient Most Significant Bit (MSB) proxy to skip negligible non-zero multiplications. Integrated as a custom RISC-V instruction and evaluated on LeNet-5 (MNIST), this method reduces ReLU MACs by 88.42% and Tanh MACs by 74.87% with zero accuracy loss--outperforming zero-skipping by 5x. By clock-gating inactive multipliers, we estimate power savings of 35.2% for ReLU and 29.96% for Tanh. While memory access makes power reduction sub-linear to operation savings, this approach significantly optimizes resource-constrained inference.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 18 references that are in the map. First posted on arXiv 10 Mar 2026.

Builds on

7 of 18 references.

References · 7

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Going Deeper with Convolutionscited by 4,241
  3. 2016EIE: Efficient Inference Engine on Compressed Deep Neural Networkcited by 295
  4. 2021Accelerating Sparse Deep Neural Networkscited by 223
  5. 2020The Hardware Lotterycited by 160
  6. 2017NullHop: A Flexible Convolutional Neural Network Accelerator Based on Sparse Representations of Feature Mapscited by 39
  7. 2016Bit-pragmatic Deep Neural Network Computingcited by 32

Built on by

Not cited yet.