TabConv: Low-Computation CNN Inference via Table Lookups
Not on the map. Why?
Abstract (arXiv)
Convolutional Neural Networks (CNNs) have demonstrated remarkable ability throughout the field of computer vision. However, CNN inference requires a large number of arithmetic operations, making them expensive to deploy in hardware. Current approaches alleviate this issue by developing hardware-supported, algorithmic processes to simplify spatial convolution functions. However, these methods still heavily rely on matrix multiplication, leading to significant computational overhead. To bridge the gap between hardware, algorithmic acceleration, and approximate matrix multiplication, we propose TabConv, a novel, table-based approximation for convolution to significantly reduce arithmetic operations during inference. Additionally, we introduce a priority masking technique based on cosine similarity to select layers for table-based approximation, thereby maintaining the model performance. We evaluate our approach on popular CNNs: ResNet-18, ResNet-34, and NetworkInNetwork (NIN). TabConv preserves over 93% of the original model's performance while reducing arithmetic operations by 36.5%, 25.8%, and 99.4% for ResNet-18 on CIFAR-10, CIFAR-100, and MNIST, respectively, 35.6% and 99.3% for ResNet-34 on CIFAR-10 and MNIST, and 98.9% for NIN on MNIST, achieving low-computation inference.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 23 of its 48 references that are in the map. First posted on arXiv 8 Apr 2024.
Builds on
23 of 48 references.
References · 23
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2014Fully Convolutional Networks for Semantic Segmentationcited by 4,859
- 2015Fast R-CNNcited by 2,933
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2013Network In Networkcited by 605
- 2019Segmentation Transformer: Object-Contextual Representations for Semantic Segmentationcited by 576
- 2021Pruning and Quantization for Deep Neural Network Acceleration: A Surveycited by 263
- 2014cuDNN: Efficient Primitives for Deep Learningcited by 245
11 more
- 2019Fixing the train-test resolution discrepancycited by 209
- 2015Fast Algorithms for Convolutional Neural Networkscited by 102
- 2019DeepShift: Towards Multiplication-Less Neural Networkscited by 54
- 2015Optimal approximate matrix product in terms of stable rankcited by 37
- 2017Parallel Multi Channel Convolution using General Matrix Multiplicationcited by 30
- 2021Multiplying Matrices Without Multiplyingcited by 30
- 2018Accelerating CNN inference on FPGAs: A Surveycited by 16
- 2020The Effects of Approximate Multiplication on Convolutional Neural Networkscited by 10
- 2022Fine-Grained Address Segmentation for Attention-Based Variable-Degree Prefetchingcited by 5
- 2024PaCKD: Pattern-Clustered Knowledge Distillation for Compressing Memory Access Prediction Modelscited by 2
- 2021Efficient distributed algorithms for Convolutional Neural Networkscited by 1
Built on by
Citing papers per year: 2024: 1.
1 paper.