Monte Carlo convergence of rival samplers
Abstract
It is often necessary to make sampling-based statistical inference about many probability distributions in parallel. Given a finite computational resource, this article addresses how to optimally divide sampling effort between the samplers of the different distributions. Formally approaching this decision problem requires both the specification of an error criterion to assess how well each group of samples represent their underlying distribution, and a loss function to combine the errors into an overall performance score. For the first part, a new Monte Carlo divergence error criterion based on Jensen-Shannon divergence is proposed. Using results from information theory, approximations are derived for estimating this criterion for each target based on a single run, enabling adaptive sample size choices to be made during sampling.
Keywords
Cite
@article{arxiv.1310.2534,
title = {Monte Carlo convergence of rival samplers},
author = {Nicholas Heard and Melissa Turcotte},
journal= {arXiv preprint arXiv:1310.2534},
year = {2015}
}