Random Construction of Interpolating Sets for High-Dimensional Integration

Many high dimensional integrals can be reduced to the problem of finding the relative measures of two sets. Often one set will be exponentially larger than the other, making it difficult to compare the sizes. A standard method of dealing with this problem is to interpolate between the sets with a sequence of nested sets where neighboring sets have relative measures bounded above by a constant. Choosing such a well balanced sequence can be very difficult in practice. Here a new approach that automatically creates such sets is presented. These well balanced sets allow for faster approximation algorithms for integrals and sums, and better tempering and annealing Markov chains for generating random samples. Applications such as finding the partition function of the Ising model and normalizing constants for posterior distributions in Bayesian methods are discussed.

[1]  J. Skilling Nested sampling for general Bayesian computation , 2006 .

[2]  D. Woodard,et al.  Conditions for Rapid and Torpid Mixing of Parallel and Simulated Tempering on Multimodal Distributions , 2009, 0906.2341.

[3]  G. Parisi,et al.  Simulated tempering: a new Monte Carlo scheme , 1992, hep-lat/9205018.

[4]  Xiongzhi Chen Brownian Motion and Stochastic Calculus , 2008 .

[5]  Wang,et al.  Replica Monte Carlo simulation of spin glasses. , 1986, Physical review letters.

[6]  D. N. Card,et al.  Monte Carlo Estimation of the Free Energy by Multistage Sampling , 1972 .

[7]  Ronald L. Wasserstein,et al.  Monte Carlo: Concepts, Algorithms, and Applications , 1997 .

[8]  H. Chernoff A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[9]  VempalaSantosh,et al.  Adaptive simulated annealing: A near-optimal connection between sampling and counting , 2009 .

[10]  Hoon Kim,et al.  Monte Carlo Statistical Methods , 2000, Technometrics.

[11]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[12]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[13]  Eric Vigoda,et al.  Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting , 2006, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[14]  George S. Fishman,et al.  Choosing sample path length and number of sample paths when starting in steady state , 1994, Oper. Res. Lett..

[15]  D. Woodard,et al.  Sufficient Conditions for Torpid Mixing of Parallel and Simulated Tempering , 2009 .

[16]  C. Geyer Markov Chain Monte Carlo Maximum Likelihood , 1991 .

[17]  J. Besag Spatial Interaction and the Statistical Analysis of Lattice Systems , 1974 .

[18]  Mark Huber,et al.  Using TPA for Bayesian Inference , 2010 .