Neural Networks with Few Multiplications

Zhouhan Lin, Matthieu Courbariaux, Roland Memisevic, Yoshua Bengio
10/11/2015
cs.LGcs.NE

Official code: hantek/BinaryConnect (80 stars, GPL-2.0, last commit 2016-04-28).

Abstract

For most deep learning algorithms training is notoriously time consuming. Since most of the computation in training neural networks is typically spent on floating point multiplications, we investigate an approach to training that eliminates the need for most of these. Our method consists of two parts: First we stochastically binarize weights to convert multiplications involved in computing hidden states to sign changes. Second, while back-propagating error derivatives, in addition to binarizing the weights, we quantize the representations at each layer to convert the remaining multiplications into binary shifts. Experimental results across 3 popular datasets (MNIST, CIFAR10, SVHN) show that this approach not only does not hurt classification performance but can result in even better performance than standard stochastic gradient descent training, paving the way to fast, hardware-friendly training of neural networks.

View on arXivView PDF

Code Implementations(1)

GPL-2.0

Source code for ``Neural Networks with Few Multiplications'' published at ICLR 2016

8012PythonJun 19, 201510 years agoGPL-2.0

Cite this paper

@article{lin2015neural,
  title  = {Neural Networks with Few Multiplications},
  author = {Zhouhan Lin and Matthieu Courbariaux and Roland Memisevic and Yoshua Bengio},
  year   = {2015},
  eprint = {1510.03009},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1510.03009}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1510.03009.svg)](https://codeofpaper.com/paper/1510.03009)

Discussion