Random construction of interpolating sets for high dimensional integration
Mark Huber, Sarah Schott

TL;DR
This paper introduces a novel method for automatically constructing well-balanced nested sets to improve high-dimensional integral approximation, sampling, and Bayesian computation.
Contribution
A new approach for automatically creating balanced nested sets enhances high-dimensional integration and sampling efficiency.
Findings
Faster approximation algorithms for high-dimensional integrals
Improved tempering and annealing Markov chains
Applications to Ising model partition functions and Bayesian normalization
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models · Statistical Methods and Inference · Markov Chains and Monte Carlo Methods
