A bound for the convergence rate of parallel tempering for sampling restricted Boltzmann machines

详细信息    查看全文

• 作者：Asja Fischer^a ; ^b ; ^{asja.fischer@rub.de" class="auth_mail" title="E-mail the corresponding author} ; Christian Igel^b ; ^{igel@diku.dk" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Restricted Boltzmann machines ; Parallel tempering ; Mixing time
• 刊名：Theoretical Computer Science
• 出版年：2015
• 出版时间：20 September 2015
• 年：2015
• 卷：598
• 期：Complete
• 页码：102-117
• 全文大小：436 K

文摘

Sampling from restricted Boltzmann machines (RBMs) is done by Markov chain Monte Carlo (MCMC) methods. The faster the convergence of the Markov chain, the more efficiently can high quality samples be obtained. This is also important for robust training of RBMs, which usually relies on sampling. Parallel tempering (PT), an MCMC method that maintains several replicas of the original chain at higher temperatures, has been successfully applied for RBM training. We present the first analysis of the convergence rate of PT for sampling from binary RBMs. The resulting bound on the rate of convergence of the PT Markov chain shows an exponential dependency on the size of one layer and the absolute values of the RBM parameters. It is minimized by a uniform spacing of the inverse temperatures, which is often used in practice. Similarly as in the derivation of bounds on the approximation error for contrastive divergence learning, our bound on the mixing time implies an upper bound on the error of the gradient approximation when the method is used for RBM training.