Quickly generating representative samples from an RBM-derived process

Neural Computation

Volumn 23, Issue 8, 2011, Pages 2058-2073

  Breuleux, Olivier ^a   Bengio, Yoshua ^a   Vincent, Pascal ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79959650504     PISSN: 08997667     EISSN: 1530888X     Source Type: Journal    
DOI: 10.1162/NECO_a_00158     Document Type: Letter

References (13)

1. Bengio,Y.,&Delalleau,O. (2009). Justifying and generalizing contrastive divergence. Neural Computation, 21, 1601-1621.
2. Borkar, V. S. (2008). Stochastic approximation: A dynamical systems viewpoint. Cambridge: Cambridge University Press.
3. Breuleux, O., Bengio, Y., & Vincent, P. (2010). Unlearning for better mixing (Tech. Rep. 1349). Montreal: Université de Montréal/DIRO.
4. Desjardins, G., Courville, A., Bengio, Y., Vincent, P., & Delalleau, O. (2010). Tempered Markov chain Monte Carlo for training of restricted Boltzmann machine. In Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics (AISTATS 2010) (pp. 145-152). Available online at http://jmlr.csail.mit.edu/proceedings/papers/v9/.
5. Hinton, G. E. (1999). Products of experts. In Proceedings of the Ninth International Conference on Artificial Neural Networks (ICANN) (pp. 1-6). Edinburgh, Scotland: IEE.
6. Hinton, G. E. (2002). Training products of experts by minimizing contrastive divergence. Neural Computation, 14, 1771-1800.
7. Hinton, G. E., Osindero, S., & Teh, Y. (2006). A fast learning algorithm for deep belief nets. Neural Computation, 18, 1527-1554.
8. Hinton, G. E., Sejnowski, T. J., & Ackley, D. H. (1984). Boltzmann machines: Constraint satisfaction networks that learn (Tech. Rep. TR-CMU-CS-84-119). Pittsburgh, PA: Carnegie-Mellon University, Department of Computer Science.
9. Tieleman, T. (2008). Training restricted Boltzmann machines using approximations to the likelihood gradient. In Proceedings of the 25th International Conference on Machine Learning (pp. 1064-1071). Madison,WI: Omnipress.
10. Tieleman, T., & Hinton, G. (2009). Using fast weights to improve persistent contrastive divergence. In Proceedings of the 26th International Conference on Machine Learning (pp. 1033-1040). New York: ACM.
11. Welling, M. (2009a). Herding dynamic weights for partially observed random field models. In Proceedings of the 25th Conference in Uncertainty in Artificial Intelligence (UAI'09). San Francisco: Morgan Kaufmann.
12. Welling, M. (2009b). Herding dynamic weights to learn. In Proceedings of the 26th International Conference on Machine Learning. New York: ACM.
13. Younes, L. (1998). On the convergence of markovian stochastic algorithms with rapidly decreasing ergodicity rates. Stochastics and Stochastics Reports, 65, 177-228.