Now showing items 1-2 of 2
Bayesian learning in undirected graphical models: approximate MCMC algorithms
Bayesian learning in undirected graphical models—computing posterior distributions over parameters and predictive quantities—is exceptionally difficult. We conjecture that for general undirected models, there are no tractable ...
MCMC for doubly-intractable distributions
Markov Chain Monte Carlo (MCMC) algorithms are routinely used to draw samples from distributions with intractable normalization constants. However, standard MCMC algorithms do not apply to doubly-intractable distributions ...