Abstract Restricted Boltzmann Machine (RBM) is a powerful generative model in deep learning that can automatically conduct learning of data probability distributions without supervision. Deep architectures can effectively enhance the capability of image feature expression in image recognition. However, their learning time is long or they present poor performance given the same running time in a deep model. To address these problems, we propose a new gradient approximation algorithm called average contrastive divergence (ACD) with weight-decay momentum for training the RBM. It is an improved contrastive divergence (CD) algorithm combined with weight-decay momentum. Different combinations of the weight momentum term are added in the pre-training and fine-tuning phases of the RBM to accelerate the network convergence and improve the classification effect. Finally, the proposed algorithm is evaluated on the MNIST database, Extended Yale B and CMU-PIE face databases. The experimental results show that the proposed learning algorithm is a better approximation of the log-likelihood gradient method and outperforms the other algorithms.
Paper
Full text
A gradient approximation algorithm based weight momentum for restricted Boltzmann machine
Semantic Scholar · Computer Science · 2019
Abstract
Abstract Restricted Boltzmann Machine (RBM) is a powerful generative model in deep learning that can automatically conduct learning of data probability distributions without supervision. Deep architectures can effectively enhance the capability of image feature expression in image recognition. However, their learning time is long or they present poor performance given the same running time in a deep model. To address these problems, we propose a new gradient approximation algorithm called average contrastive divergence (ACD) with weight-decay momentum for training the RBM. It is an improved contrastive divergence (CD) algorithm combined with weight-decay momentum. Different combinations of the weight momentum term are added in the pre-training and fine-tuning phases of the RBM to accelerate the network convergence and improve the classification effect. Finally, the proposed algorithm is evaluated on the MNIST database, Extended Yale B and CMU-PIE face databases. The experimental results show that the proposed learning algorithm is a better approximation of the log-likelihood gradient method and outperforms the other algorithms.