Recursive computing and simulation-free inference for general factorizable models
From MaRDI portal
Publication:5447656
DOI10.1093/biomet/asm052zbMath1135.62078OpenAlexW1992930276MaRDI QIDQ5447656
Publication date: 20 March 2008
Published in: Biometrika (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f152ec7d934390dfeda6c91ff6a47b8c2ce904da
Ising modelexact samplinghidden Markov random fieldnormalizing constantautologistic distributionarchaeology data set
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (16)
Prior specification of neighbourhood and interaction structure in binary Markov random fields ⋮ Approximate computations for binary Markov random fields and their use in Bayesian models ⋮ Use of SAMC for Bayesian analysis of statistical models with intractable normalizing constants ⋮ Noisy Monte Carlo: convergence of Markov chains with approximate transition kernels ⋮ Approximate Bayesian Inference for Latent Gaussian models by using Integrated Nested Laplace Approximations ⋮ Construction of binary multi-grid Markov random field prior models from training images ⋮ Exploiting multi-core architectures for reduced-variance estimation with intractable likelihoods ⋮ Bayesian model comparison with un-normalised likelihoods ⋮ Recursions on the marginals and exact computation of the normalizing constant for Gibbs processes ⋮ The value of information in spatial decision making ⋮ Adaptive ABC model choice and geometric summary statistics for hidden Gibbs random fields ⋮ Model comparison for Gibbs random fields using noisy reversible jump Markov chain Monte Carlo ⋮ Scalable Bayesian inference for the inverse temperature of a hidden Potts model ⋮ Bayesian Model Selection for Exponential Random Graph Models via Adjusted Pseudolikelihoods ⋮ Noisy Hamiltonian Monte Carlo for Doubly Intractable Distributions ⋮ Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
This page was built for publication: Recursive computing and simulation-free inference for general factorizable models