Abstract
AbstractWe propose a new scalable method to approximate the intractable likelihood of the Potts model. The method decomposes the original likelihood into products of many low-dimensional conditional terms, and a Monte Carlo method is then proposed to approximate each of the small terms using their corresponding (exact) Multinomial distribution. The resulting tractable synthetic likelihood then serves as an approximation to the true likelihood. The method is scalable with respect to lattice size and can also be used for problems with irregular lattices. We provide theoretical justifications for our approach, and carry out extensive simulation studies, which show that our method performs at least as well as existing methods, whilst providing significant computational savings, up to ten times faster than the current fastest method. Finally, we include three real data applications for illustration.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Statistics, Probability and Uncertainty,Statistics and Probability
Reference53 articles.
1. Alsing J, Charnock T, Feeney S, Wand elt B (2019). Fast likelihood-free cosmology with neural density estimators and active learning. arXiv e-prints, page arXiv:1903.00007
2. Atchadé YF, Liu JS (2010) The wang-landau algorithm in general state spaces: applications and convergence analysis. Statistica Sinica, 209–233
3. Bartolucci F, Besag J (2002) A recursive algorithm for Markov random fields. Biometrika 89(3):724–730
4. Besag J (1974) Spatial interaction and the statistical analysis of lattice systems. J Royal Stat Soc. Series B (Methodological) 36(2):192–236
5. Besag J (1975) Statistical analysis of non-lattice data. J Royal Stat Soc. Series D (The Statistician) 24(3):179–195