SearcharxivSearch

arXiv · 2110.10801

Efficient Sampling for Ising and Potts Models using Auxiliary Gaussian Variables

Abstract

Ising and Potts models are an important class of discrete probability distributions which originated from statistical physics and since then have found applications in several disciplines. Simulation from these models is a well known challenging problem. In this paper, we study a class of Markov chain Monte Carlo algorithms, in which we introduce an auxiliary Gaussian variable such that, conditional on this variable, the discrete states are independent. This approach is broadly applicable to Ising and Potts models, including ones in which the coupling matrix admits negative entries, as in spin glass and Hopfield models. We focus on a block Gibbs sampler version of this algorithm, which alternates between sampling the auxiliary Gaussian and the discrete states, and derive mixing time bounds for a wide class of Ising/Potts models at both high and low temperatures, yielding results analogous to those derived for the Heat Bath and Swendsen-Wang algorithms. We present novel choices of auxiliary Gaussian variables which scale well with the number of states in the Potts model, and which can take advantage of the low rank structure of the coupling matrix, if any. Finally, we numerically evaluate the performance of the auxiliary Gaussian Gibbs sampler with several competing algorithms, across a range of examples.

Explore related subjects

Keep this discovery

BibTeXRIS

Charles C. Margossian, Chenyang Zhong, Sumit Mukherjee. 2021-10-20. Efficient Sampling for Ising and Potts Models using Auxiliary Gaussian Variables. https://arxiv.org/abs/2110.10801

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO