On the Theoretical Properties of Exchange Algorithm

  title={On the Theoretical Properties of Exchange Algorithm},
  author={Guanyang Wang},
  • Guanyang Wang
  • Published 19 May 2020
  • Mathematics, Computer Science
  • ArXiv
Exchange algorithm is one of the most popular extensions of Metropolis-Hastings algorithm to sample from doubly-intractable distributions. However, theoretical exploration of exchange algorithm is very limited. For example, natural questions like `Does exchange algorithm converge at a geometric rate?' or `Does the exchange algorithm admit a Central Limit Theorem?' have not been answered. In this paper, we study the theoretical properties of exchange algorithm, in terms of asymptotic variance… 
2 Citations

Figures from this paper

Exact Convergence Rate Analysis of the Independent Metropolis-Hastings Algorithms

Under mild conditions, the exact convergence rate for IMH algorithms on general state spaces is derived and it is proved that different initializations of the IMH algorithm have the same convergence rate.

Unbiased Multilevel Monte Carlo methods for intractable distributions: MLMC meets MCMC

This paper proposes a general method to construct unbiased estimators for function of expectations and generalizes this method to estimate nested expectations, based on the combination and generalization of the unbiased MCMC and Multilevel Monte Carlo methods.



Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms

We study convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms (Andrieu and Roberts [Ann. Statist. 37 (2009) 697-725]). We find that the asymptotic variance of the

Rates of convergence of the Hastings and Metropolis algorithms

Recent results in Markov chain theory are applied to Hastings and Metropolis algorithms with either independent or symmetric candidate distributions, and it is shown geometric convergence essentially occurs if and only if $pi$ has geometric tails.

On the utility of Metropolis-Hastings with asymmetric acceptance ratio

It is shown that convergence to equilibrium can be significantly shortened, therefore offering the possibility to reduce a user's waiting time in a generic fashion when a parallel computing architecture is available.

Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms

We develop results on geometric ergodicity of Markov chains and apply these and other recent results in Markov chain theory to multidimensional Hastings and Metropolis algorithms. For those based on

Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow

  • A. Sinclair
  • Computer Science
    Combinatorics, Probability and Computing
  • 1992
A new upper bound on the mixing rate is presented, based on the solution to a multicommodity flow problem in the Markov chain viewed as a graph, and improved bounds are obtained for the runtimes of randomised approximation algorithms for various problems, including computing the permanent of a 0–1 matrix, counting matchings in graphs, and computing the partition function of a ferromagnetic Ising system.

General state space Markov chains and MCMC algorithms

This paper surveys various results about Markov chains on gen- eral (non-countable) state spaces. It begins with an introduction to Markov chain Monte Carlo (MCMC) algorithms, which provide the

Coupled MCMC with a randomized acceptance probability

A class of MCMC algorithms characterized by a pseudo-marginal transition probability kernel is given and it is shown that on average O(m) of the samples realized by a simulation approximating a randomized chain of length n are exactly the same as those of a coupled (exact) randomized chain.

The pseudo-marginal approach for efficient Monte Carlo computations

A powerful and flexible MCMC algorithm for stochastic simulation that builds on a pseudo-marginal method, showing how algorithms which are approximations to an idealized marginal algorithm, can share the same marginal stationary distribution as the idealized method.

Practical Markov Chain Monte Carlo

The case is made for basing all inference on one long run of the Markov chain and estimating the Monte Carlo error by standard nonparametric methods well-known in the time-series and operations research literature.

A double Metropolis–Hastings sampler for spatial models with intractable normalizing constants

  • F. Liang
  • Computer Science, Mathematics
  • 2010
An asymptotic algorithm, the so-called double Metropolis–Hastings (MH) sampler, is proposed, which removes the need for exact sampling, the auxiliary variables being generated using MH kernels, and thus can be applied to a wide range of problems for which exact sampling is not available.