Neighborhood-based stopping criterion for contrastive divergence

Restricted Boltzmann Machines (RBMs) are general unsupervised learning devices to ascertain generative models of data distributions. RBMs are often trained using the Contrastive Divergence (CD) learning algorithm, an approximation to the gradient of the data log-likelihood (logL). A simple reconstru...

Descripción completa

Detalles Bibliográficos
Autores: Romero Merino, Enrique|||0000-0003-2404-5716, Mazzanti Castrillejo, Fernando Pablo|||0000-0001-6641-0609, Delgado Pin, Jordi|||0000-0003-4546-8355
Tipo de recurso: artículo
Fecha de publicación:2018
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/125738
Acceso en línea:https://hdl.handle.net/2117/125738
https://dx.doi.org/10.1109/TNNLS.2017.2697455
Access Level:acceso abierto
Palabra clave:Machine learning
Neural networks (Computer science)
Recurrent neural networks
Restricted Boltzmann machines
Unsupervised learning
Aprenentatge automàtic
Xarxes neuronals (Informàtica)
Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial::Aprenentatge automàtic
Descripción
Sumario:Restricted Boltzmann Machines (RBMs) are general unsupervised learning devices to ascertain generative models of data distributions. RBMs are often trained using the Contrastive Divergence (CD) learning algorithm, an approximation to the gradient of the data log-likelihood (logL). A simple reconstruction error is often used as a stopping criterion for CD, although several authors have raised doubts concerning the feasibility of this procedure. In many cases, the evolution curve of the reconstruction error is monotonic, while the logL is not, thus indicating that the former is not a good estimator of the optimal stopping point for learning. However, not many alternatives to the reconstruction error have been discussed in the literature. An estimation of the logL of the training data based on annealed importance sampling is feasible but computationally very expensive. In this manuscript, we present a simple and cheap alternative, based on the inclusion of information contained in neighboring states to the training set, as a stopping criterion for CD learning.