Inductive principles for restricted Boltzmann machine learning

Journal of Machine Learning Research

Volumn 9, Issue , 2010, Pages 509-516

  Marlin, Benjamin M ^a   Swersky, Kevin ^a   Chen, Bo ^a   De Freitas, Nando ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONTRASTIVE DIVERGENCE; DATA SETS; EMPIRICAL EVALUATIONS; LEARNING METHODS; MAXIMUM LIKELIHOOD LEARNING; MULTIPLE TASKS; PARTITION FUNCTIONS; PSEUDO-LIKELIHOOD; RESTRICTED BOLTZMANN MACHINE;

ARTIFICIAL INTELLIGENCE; MAXIMUM LIKELIHOOD;

LEARNING SYSTEMS;

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

References (18)

1. J. Besag. Statistical analysis of non-lattice data. The Statistician, 24(3):179-195, 1975.
2. R. A. Fisher. On the mathematical foundations of theoretical statistics. Philosophical Transactions of the Royal Society of London Series A., 222:309-368, 1922.
3. G. Hinton. Training products of experts by minimizing contrastive divergence. Neural Computation, 14, 2000.
4. G. E. Hinton. To recognize shapes, first learn to generate images. Progress in brain research, 165:535-547, 2007.
5. Aapo Hyvärinen. Some extensions of score matching. Computational Statistics & Data Analysis, 51(5):2499-2512, 2007.
6. H. Lee, C. Ekanadham, and A. Y. Ng. Sparse deep belief net model for visual area V2. In Advances in Neural Information Processing Systems 20. MIT Press, 2008.
7. Y.J. Lee and O.L. Mangasarian. SSVM: A smooth support vector machine for classification. Computational optimization and Applications, 20(1):5-22, 2001.
8. Siwei Lyu. Interpretation and generalization of score matching. In Uncertainty in Artificial Intelligence 25, 2009.
9. D. MacKay. Information Theory, Inference, and Learning Algorithms. Cambridge University Press, 2003.
10. I. Murray and R. Salakhutdinov. Evaluating probabilities under high-dimensional latent variable models. In Advances in Neural Information Processing Systems 21, pages 1137-1144, 2009.
11. J. Nocedal and S. Wright. Numerical Optimization. Springer, Second edition, 2000.
12. M. Ranzato, Y-L. Boureau, and Y. LeCun. Sparse feature learning for deep belief networks. In Advances in Neural Information Processing Systems 19. MIT Press, 2007.
13. H. Robbins and S. Monro. A stochastic approximation method. The Annals of Mathematical Statistics, 22:400-407, 1951.
14. P. Smolensky. Information processing in dynamical systems: Foundations of harmony theory. Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations, pages 194-281, 1986.
15. T. Tieleman. Training restricted Boltzmann machines using approximations to the likelihood gradient. In International Conference on Machine Learning 25, pages 1064-1071, 2008.
16. M. Wainwright, T. Jaakkola, and A. Willsky. Treereweighted belief propagation algorithms and approximate ML estimation via pseudo-moment matching. In Workshop on Artificial Intelligence and Statistics 9, 2003.
17. M. Welling, M. Rosen-Zvi, and G. Hinton. Exponential family harmoniums with an application to information retrieval. In Advances in Neural Information Processing Systems 17, pages 1481-1488, 2005.
18. L. Younes. Parametric inference for imperfectly observed Gibbsian fields. Probability Theory and Related Fields, 82(4):625-645, 1989.