Deep Boltzmann machines

Journal of Machine Learning Research

Volumn 5, Issue , 2009, Pages 448-455

  Salakhutdinov, Ruslan ^a   Hinton, Geoffrey ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BOLTZMANN MACHINES; DATA SETS; GENERATIVE MODEL; HANDWRITTEN DIGIT; HIDDEN LAYERS; HIDDEN VARIABLE; LAYER-BY-LAYERS; LOG LIKELIHOOD; PRE-TRAINING; SINGLE MODE; VARIATIONAL APPROXIMATION; VARIATIONAL INFERENCE; VISUAL OBJECT RECOGNITION;

LEARNING ALGORITHMS; MARKOV PROCESSES;

ARTIFICIAL INTELLIGENCE;

EID: 84862286946     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (22)

1. Y. Bengio and Y. Le Cun. Scaling learning algorithms towards AI. Large-Scale Kernel Machines, 2007.
2. D. Decoste and B. Schölkopf. Training invariant support vector machines. Machine Learning, 46(1/3):161, 2002.
3. G. Hinton. Training products of experts by minimizing contrastive divergence. Neural Computation, 14(8):1711-1800, 2002.
4. G. Hinton and R. Salakhutdinov. Reducing the dimensionality of data with neural networks. Science, 313(5786):504 - 507, 2006.
5. G. Hinton and T. Sejnowski. Optimal perceptual inference. In IEEE conference on Computer Vision and Pattern Recognition, 1983.
6. G. Hinton and R. Zemel. Autoencoders, minimum description length and Helmholtz free energy. In NIPS, volume 6, pages 3-10, 1994.
7. G. Hinton, S. Osindero, and Y. W. Teh. A fast learning algorithm for deep belief nets. Neural Computation, 18(7):1527-1554, 2006.
8. Y. LeCun, F. Huang, and L. Bottou. Learning methods for generic object recognition with invariance to pose and lighting. In CVPR (2), pages 97-104, 2004.
9. V. Nair and G. Hinton. Implicit mixtures of restricted Boltzmann machines. In Advances in Neural Information Processing Systems, volume 21, 2008.
10. R. Neal. Annealed importance sampling. Statistics and Computing, 11:125-139, 2001.
11. R. Neal. Connectionist learning of belief networks. Artif. Intell, 56(1):71-113, 1992.
12. R. Neal and G. Hinton. A view of the EM algorithm that justifies incremental, sparse and other variants. In M. I. Jordan, editor, Learning in Graphical Models, pages 355-368, 1998.
13. H. Robbins and S. Monro. A stochastic approximation method. Ann. Math. Stat., 22:400-407, 1951.
14. R. Salakhutdinov. Learning and evaluating Boltzmann machines. Technical Report UTML TR 2008-002, Dept. of Computer Science, University of Toronto, June 2008.
15. R. Salakhutdinov and I. Murray. On the quantitative analysis of deep belief networks. In International Conference on Machine Learning, volume 25, 2008.
16. P. Smolensky. Information processing in dynamical systems: Foundations of harmony theory. In Parallel Distributed Processing, volume 1, chapter 6, pages 194-281. MIT Press, 1986.
17. T. Tieleman. Training restricted Boltzmann machines using approximations to the likelihood gradient. In International Conference on Machine Learning, 2008.
18. M. Welling and G. Hinton. A new learning algorithm for mean field Boltzmann machines. Lecture Notes in Computer Science, 2415, 2002.
19. M. Welling, M. Rosen-Zvi, and G. Hinton. Exponential family harmoniums with an application to information retrieval. In NIPS 17, pages 1481-1488, 2005.
20. L. Younes. On the convergence of Markovian stochastic algorithms with rapidly decreasing ergodicity rates, March 17 2000.
21. L. Younes. Parameter inference for imperfectly observed Gibbsian fields. Probability Theory Rel. Fields, 82:625-645, 1989.
22. A. L. Yuille. The convergence of contrastive divergences. In NIPS, 2004.