Minconvnets: a New Class of Multiplication-Less Neural Networks

Abstract

In this article, MinConvNets where the multiplications in the forward propagation path of CNNs are approximated by minimum comparator operations are introduced. Hardware complexity of minimum operator is of the order of O(N ), whereas for multiplication it is O(N 2 ). Firstly, a methodology to find approximate operations based on statistical correlation is presented. We show that it is possible to replace multipliers by minimum operations in the forward propagation under certain constraints, i.e. given similar mean and variances of the feature and the weight vectors. A modified training method which guarantees the above constraints is proposed. And it is shown that equivalent precision can be achieved during inference with MinConvNets by using transfer learning from well trained exact CNNs.

Survey: Leakage and Privacy at Inference Time

“…4.3 and 6.5). Feature leakage can be detected even when present in a few [98] or a single image [99], with common techniques (e.g., augmentations, unlearning) shown to not offer protection.…”