pith. machine review for the scientific record. sign in

arxiv: 1510.03009 · v3 · pith:3USR2YVSnew · submitted 2015-10-11 · 💻 cs.LG · cs.NE

Neural Networks with Few Multiplications

classification 💻 cs.LG cs.NE
keywords trainingmultiplicationsnetworksneuralapproachconvertperformanceweights
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.