Generative and Discriminative Deep Belief Network Classifiers: Comparisons Under an Approximate Computing Framework
Not on the map. Why?
Abstract (arXiv)
The use of Deep Learning hardware algorithms for embedded applications is characterized by challenges such as constraints on device power consumption, availability of labeled data, and limited internet bandwidth for frequent training on cloud servers. To enable low power implementations, we consider efficient bitwidth reduction and pruning for the class of Deep Learning algorithms known as Discriminative Deep Belief Networks (DDBNs) for embedded-device classification tasks. We train DDBNs with both generative and discriminative objectives under an approximate computing framework and analyze their power-at-performance for supervised and semi-supervised applications. We also investigate the out-of-distribution performance of DDBNs when the inference data has the same class structure yet is statistically different from the training data owing to dynamic real-time operating environments. Based on our analysis, we provide novel insights and recommendations for choice of training objectives, bitwidth values, and accuracy sensitivity with respect to the amount of labeled data for implementing DDBN inference with minimum power consumption on embedded hardware platforms subject to accuracy tolerances.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 4 of its 19 references that are in the map. First posted on arXiv 31 Jan 2021.
Builds on
4 of 19 references.
References · 4
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2016SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and <0.5MB model sizecited by 1,054
- 2017Generative and Discriminative Text Classification with Recurrent Neural Networkscited by 30
- 2019AX-DBN: An Approximate Computing Framework for the Design of Low-Power Discriminative Deep Belief Networkscited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.