Error bounds for simultaneous Wasserstein contractive adaptive increasingly rare MCMC

We investigate adaptive increasingly rare Markov chain Monte Carlo algorithms and the associated time-average estimator for approximating expectations.

Under a simultaneous Wasserstein contraction assumption on the underlying family of Markov kernels we derive explicit bounds for the mean squared error.

We illustrate the applicability of our estimate through adaptive stereographic algorithms and Metropolis-Hastings schemes that employ normalizing flows for adaptation.

We also consider a generic adaptive algorithm for doubly intractable problems and provide a corresponding cost analysis to achieve a desired precision.