about
ApproxDBN: Approximate Computing for Discriminative Deep Belief Networks (arxiv.org)
2 points by lainon on Apr 23, 2017 | hide | past | pdf | discuss on HN

In plain words: It shrinks what a deep belief network stores by giving fewer bits to the least important nodes, then retraining to find the biggest cut that meets the accuracy target and saves power. Versus full precision everywhere, it cut bit lengths sharply while keeping accuracy.

Abstract

Probabilistic generative neural networks are useful for many applications, such as image classification, speech recognition and occlusion removal. However, the power budget for hardware implementations of neural networks can be extremely tight. To address this challenge we describe a design methodology for using approximate computing methods to implement Approximate Deep Belief Networks (ApproxDBNs) by systematically exploring the use of (1) limited precision of variables; (2) criticality analysis to identify the nodes in the network which can operate with such limited precision while allowing the network to maintain target accuracy levels; and (3) a greedy search methodology with incremental retraining to determine the optimal reduction in precision to enable maximize power savings under user-specified accuracy constraints. Experimental results show that significant bit-length reduction can be achieved by our ApproxDBN with constrained accuracy loss.

Xiaojing Xu, Srinjoy Das, Ken Kreutz-Delgado
arXiv:1704.03993 · cs.NE · submitted Apr 13, 2017 · updated May 6, 2017
abstract · pdf · html · 8 pages, 7 figures

add comment on HN