# Random construction of interpolating sets for high-dimensional integration

Published

Journal Article

Computing the value of a high-dimensional integral can often be reduced to the problem of finding the ratio between the measures of two sets. Monte Carlo methods are often used to approximate this ratio, but often one set will be exponentially larger than the other, which leads to an exponentially large variance. 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 rarely be done without extensive study of a problem. Here a new approach that automatically obtains such sets is presented. These well-balanced sets allow for faster approximation algorithms for integrals and sums using fewer samples, 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. © Applied Probability Trust 2014.

### Full Text

### Duke Authors

### Cited Authors

- Huber, M; Schott, S

### Published Date

- January 1, 2014

### Published In

### Volume / Issue

- 51 / 1

### Start / End Page

- 92 - 105

### International Standard Serial Number (ISSN)

- 0021-9002

### Digital Object Identifier (DOI)

- 10.1239/jap/1395771416

### Citation Source

- Scopus