University of Cambridge > Talks.cam > MRC Biostatistics Unit Seminars > Inference for binary Markov random fields without tears (or MCMC).

Inference for binary Markov random fields without tears (or MCMC).

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Nikolaos Demiris.

Binary Markov random fields have played an important role in the development of MCMC methods. The Metropolis algorithm was designed to sample from the Ising model, for example. In this talk we will present an non-MCMC based approach to carrying out inference for such models. Here I will present an algorithm which allows, for example, direct sampling from the Markov random field, computation of marginal distributions of lattice points, but crucially which also allows inference for the parameters of the MRF . These algorithms can be carried out exactly if the dimension of the lattice is of moderate size. We present an approximate inference scheme for the case where the lattice is of large dimension. This is joint work with Havard Rue (NTNU, Trondheim).

This talk is part of the MRC Biostatistics Unit Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2020 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity