On contrastive divergence learning

AISTATS 2005 - Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics

Volumn , Issue , 2005, Pages 33-40

  Carreira Perpiñán, Miguel Á ^a,b   Hinton, Geoffrey E ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTRASTIVE DIVERGENCE; EXPONENTIAL NUMBERS; MARKOV CHAIN MONTE CARLO METHOD; MARKOV RANDOM FIELDS; RANDOM FIELDS; UNBIASED ESTIMATES;

ARTIFICIAL INTELLIGENCE; MARKOV PROCESSES; MONTE CARLO METHODS;

ESTIMATION;

EID: 84862612564     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. A. Benveniste, M. Métivier, and P. Priouret. Adaptive Algorithms and Stochastic Approximations. Springer-Verlag, 1990.
2. M. Á. Carreira-Perpiñán and G. E. Hinton. On contrastive divergence (CD) learning. Technical report, Dept. of Computer Science, University of Toronto, 2004. In preparation.
3. H. Chen and A. F. Murray. Continuous restricted Boltzmann machine with an implementable training algorithm. IEE Proceedings: Vision, Image and Signal Processing, 150(3):153-158, June 20 2003.
4. Y. Freund and D. Haussler. Unsupervised learning of distributions on binary vectors using 2-layer networks. In NIPS, pages 912-919, 1992.
5. W. Gilks, S. Richardson, and D. J. Spiegelhalter, editors. Markov Chain Monte Carlo in Practice. Chapman & Hall, 1996.
6. I. J. Good. The population frequencies of species and the estimation of population parameters. Biometrika, 40(3/4):237-264, Dec. 1953.
7. X. He, R. S. Zemel, and M. Á. Carreira-Perpiñán. Multiscale conditional random fields for image labeling. In CVPR, pages 695-702, 2004.
8. G. Hinton and S. T. Roweis. Stochastic neighbor embedding. In NIPS, pages 857-864, 2003.
9. G. E. Hinton. Training products of experts by minimizing contrastive divergence. Neural Computation, 14(8):1771-1800, Aug. 2002.
10. S. Z. Li. Markov Random Field Modeling in Image Analysis. Springer-Verlag, 2001.
11. D. J. C. MacKay. Failures of the one-step learning algorithm. Available online at http://www.inference.phy.cam.ac.uk/mackay/abstracts/gbm.html, 2001.
12. R. M. Neal. Probabilistic inference using Markov chain Monte Carlo methods. Technical Report CRG-TR-93-1, Dept. of Computer Science, University of Toronto, Sept. 1993. Available online at ftp://ftp.cs.toronto.edu/pub/radford/ review.ps.Z.
13. P. Smolensky. Information processing in dynamical systems: Foundations of harmony theory. In D. E. Rumelhart and J. L. MacClelland, editors, Parallel Distributed Computing: Explorations in the Microstructure of Cognition. Vol. 1: Foundations, chapter 6. MIT Press, 1986.
14. Y. W. Teh, M. Welling, S. Osindero, and G. E. Hinton. Energy-based models for sparse overcomplete representations. Journal of Machine Learning Research, 4:1235-1260, Dec. 2003.
15. C. K. I. Williams and F. V. Agakov. An analysis of contrastive divergence learning in Gaussian Boltzmann machines. Technical Report EDI-INF-RR-0120, Division of Informatics, University of Edinburgh, May 2002.
16. G. Winkler. Image Analysis, Random Fields and Markov Chain Monte Carlo Methods. Springer-Verlag, second edition, 2002.
17. A. Yuille. The convergence of contrastive divergences. To appear in NIPS, 2004.