Sampling using Adaptive Regenerative Processes
Preprint
Abstract
Enriching Brownian motion with regenerations from a fixed regeneration distribution $\mu$ at a particular regeneration rate $\kappa$ results in a Markov process that has a target distribution $\pi$ as its invariant distribution. For the purpose of Monte Carlo inference, implementing such a scheme requires firstly selection of regeneration distribution $\mu$, and secondly computation of a specific constant $C$. Both of these tasks can be very difficult in practice for good performance. We introduce a method for adapting the regeneration distribution, by adding point masses to it. This allows the process to be simulated with as few regenerations as possible and obviates the need to find said constant $C$. Moreover, the choice of fixed $\mu$ is replaced with the choice of the initial regeneration distribution, which is considerably less difficult. We establish convergence of this resulting self-reinforcing process and explore its effectiveness at sampling from a number of target distributions. The examples show that adapting the regeneration distribution guards against poor choices of fixed regeneration distribution and can reduce the error of Monte Carlo estimates of expectations of interest, especially when $\pi$ is skewed.
Keywords
All Related Versions
This publication has 28 references indexed in Scilit:
- An approximation scheme for quasi-stationary distributions of killed diffusionsStochastic Processes and their Applications, 2020
- The Bouncy Particle Sampler: A Nonreversible Rejection-Free Markov Chain Monte Carlo MethodJournal of the American Statistical Association, 2018
- Analysis of a stochastic approximation algorithm for computing quasi-stationary distributionsAdvances in Applied Probability, 2016
- A tutorial on adaptive MCMCStatistics and Computing, 2008
- Parameterization Issues in Bayesian Inference1992
- An iterative Monte Carlo method for nonconjugate Bayesian analysisStatistics and Computing, 1991
- A Monte Carlo method for high dimensional integrationNumerische Mathematik, 1989
- Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov ChainsProbability in the Engineering and Informational Sciences, 1988
- Simulation of nonhomogeneous poisson processes by thinningNaval Research Logistics Quarterly, 1979
- A splitting technique for Harris recurrent Markov chainsProbability Theory and Related Fields, 1978