Low-complexity Approximate Convolutional Neural Networks
R. J. Cintra, S. Duffner, C. Garcia, A. Leite

TL;DR
This paper introduces a method to significantly reduce the computational complexity of convolutional neural networks by approximating their filters with binary matrices, enabling efficient, multiplication-free operations suitable for low-power hardware.
Contribution
The authors propose a novel binary linear programming approach to approximate ConvNet filters, drastically reducing computational complexity while preserving performance across various network sizes.
Findings
Low-complexity approximations maintain near-original accuracy.
Method applicable to diverse ConvNet architectures.
Enables efficient hardware implementations with addition and bit-shifting.
Abstract
In this paper, we present an approach for minimizing the computational complexity of trained Convolutional Neural Networks (ConvNet). The idea is to approximate all elements of a given ConvNet and replace the original convolutional filters and parameters (pooling and bias coefficients; and activation function) with efficient approximations capable of extreme reductions in computational complexity. Low-complexity convolution filters are obtained through a binary (zero-one) linear programming scheme based on the Frobenius norm over sets of dyadic rationals. The resulting matrices allow for multiplication-free computations requiring only addition and bit-shifting operations. Such low-complexity structures pave the way for low-power, efficient hardware designs. We applied our approach on three use cases of different complexity: (i) a "light" but efficient ConvNet for face detection (with…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsConvolution
