Can independent Metropolis beat crude Monte Carlo?
<|reference_start|>Can independent Metropolis beat crude Monte Carlo?: Assume that we would like to estimate the expected value of a function $F$ with respect to a density $\pi$. We prove that if $\pi$ is close enough under KL divergence to another density $q$, an independent Metropolis sampler estimator that obtains samples from $\pi$ with proposal density $q$, enriched with a variance reduction computational strategy based on control variates, achieves smaller asymptotic variance than that of the crude Monte Carlo estimator. The control variates construction requires no extra computational effort but assumes that the expected value of $F$ under $q$ is analytically available. We illustrate this result by calculating the marginal likelihood in a linear regression model with prior-likelihood conflict and a non-conjugate prior. Furthermore, we propose an adaptive independent Metropolis algorithm that adapts the proposal density such that its KL divergence with the target is being reduced. We demonstrate its applicability in a Bayesian logistic and Gaussian process regression problems and we rigorously justify our asymptotic arguments under easily verifiable and essentially minimal conditions.<|reference_end|>
@article{liu2024variance,
    title={Variance Reduction for the Independent Metropolis Sampler},
    author={Siran Liu, Petros Dellaportas, Michalis K. Titsias},
    journal={arXiv preprint arXiv:2406.17699},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.17699},
    primaryClass={math.ST cs.LG stat.TH}
}