MCMC for doubly-intractable distributions

Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence, UAI 2006

Volumn , Issue , 2006, Pages 359-366

  Murray, Iain ^a   Ghahramani, Zoubin ^b   MacKay, David J C ^c  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ESTIMATE MODEL; GRAPHICAL MODEL; MARKOV CHAIN MONTE CARLO ALGORITHMS; NORMALIZATION CONSTANTS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; MARKOV PROCESSES; PROBABILITY;

PARAMETER ESTIMATION;

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

References (16)

1. D. H. Ackley, G. E. Hinton, and T. J. Sejnowski. A learning algorithm for Boltzmann machines. Cog. Sci., 9(1), 1985.
2. B. P. Carlin and S. Chib. Bayesian model choice via Markov chain Monte Carlo methods. Journal of the Royal Statistical Society B, 57(3):473-484, 1995.
3. A. M. Childs, R. B. Patterson, and D. J. C. MacKay. Exact sampling from nonattractive distributions using summary states. Phys. Rev. E, 63, 2001.
4. M. K. Cowles, N. Best, K. Vines, and M. Plummer. R-CODA 0.10-5, 2006. available from http://www-fis.iarc.fr/coda/.
5. W. K. Hastings. Monte Carlo sampling methods using Markov chains and their applications. Biometrika, 57 (1), April 1970.
6. C. Jarzynski. Equilibrium free-energy differences from nonequilibrium measurements: a master-equation approach. Phys. Rev. E, 56(5):5018-5035, November 1997. (Pubitemid 127654616)
7. X.-L. Meng and W. H. Wong. Simulating ratios of normalizing constants via a simple identity: a theoretical exploration. Statistica Sinica, 6:831-860, 1996.
8. J. Møller, A. Pettitt, K. Berthelsen, and R. Reeves. An efficient Markov chain Monte Carlo method for distributions with intractable normalising constants. Technical Report R-2004-02, Dept. of Mathematical Sciences, Aalborg University, 2004. To appear: Biometrica, 93, 2006.
9. I. Murray and Z. Ghahramani. Bayesian learning in undirected graphical models: approximate MCMC algorithms. In Proc. 20th Conference on Uncertainty in Artificial Intelligence, pages 392-399. AUAI Press, 2004.
10. R. M. Neal. Sampling from multimodal distributions using tempered transitions. Statistics and Computing, 6(4): 353-366, 1996.
11. R. M. Neal. Annealed importance sampling. Statistics and Computing, 11(2):125-139, 2001. (Pubitemid 33638185)
12. R. M. Neal. Taking bigger Metropolis steps by dragging fast variables. Technical Report No. 0411, Department of Statistics, University of Toronto, October 2004.
13. R. M. Neal. Estimating ratios of normalizing constants using linked importance sampling. Technical Report No. 0511, Dept. of Statistics, University of Toronto, 2005.
14. J. G. Propp and D. B. Wilson. Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Struc. Algor., 9(1&2):223-252, 1996.
15. R. H. Swendsen and J.-S. Wang. Replica Monte Carlo simulation of spin-glasses. Phys. Rev. Lett., 57(21), 1986.
16. D. B. Wilson. Annotated bibliography of perfectly random sampling with Markov chains. volume 41 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1998. Updated version available online http://dbwilson.com/exact/.