We consider optimal temperature spacings for Metropolis-coupled Markov chain Monte Carlo (MCMCMC) and Simulated Tempering algorithms. We prove that, under certain conditions, it is optimal (in terms of maximising the expected squared jumping distance) to space the temperatures so that the proportion of temperature swaps which are accepted is approximately 0.234. This generalises related work by physicists, and is consistent with previous work about optimal scaling of random-walk Metropolis algorithms
We consider the optimal scaling problem for high-dimensional Random walk Metropolis (RWM) algorithms...
<div><p>Sampling from complex distributions is an important but challenging topic in scientific and ...
Recent optimal scaling theory has produced a condition for the asymptotically optimal acceptance rat...
AbstractIn this paper we study the relationships between two Markov Chain Monte Carlo algorithms—the...
We derive new results comparing the asymptotic variance of diffusions by writing them as appropriate...
In this paper we study the relationships between two Markov Chain Monte Carlo algorithms--the Swappi...
Scaling of proposals for Metropolis algorithms is an important practical problem in MCMC implementat...
One main limitation of the existing optimal scaling results for Metropolis–Hastings algorithms is th...
This paper investigates the behaviour of the random walk Metropolis algorithm in high-dimensional pr...
Study of diffusion limits of the Metropolis-Hastings algorithm in high dimensions yields useful quan...
We consider the optimal scaling problem for high-dimensional random walk Metropolis (RWM) algorithms...
Abstract For a given Markov chain Monte Carlo algorithm we introduce a distance between two configur...
We consider the optimal scaling problem for high-dimensional Random walk Metropolis (RWM) algorithms...
Markov Chain Monte Carlo (MCMC) techniques for sampling from complex probability distributions have ...
Abstract. Sampling from complex distributions is an important but challenging topic in scientific an...
We consider the optimal scaling problem for high-dimensional Random walk Metropolis (RWM) algorithms...
<div><p>Sampling from complex distributions is an important but challenging topic in scientific and ...
Recent optimal scaling theory has produced a condition for the asymptotically optimal acceptance rat...
AbstractIn this paper we study the relationships between two Markov Chain Monte Carlo algorithms—the...
We derive new results comparing the asymptotic variance of diffusions by writing them as appropriate...
In this paper we study the relationships between two Markov Chain Monte Carlo algorithms--the Swappi...
Scaling of proposals for Metropolis algorithms is an important practical problem in MCMC implementat...
One main limitation of the existing optimal scaling results for Metropolis–Hastings algorithms is th...
This paper investigates the behaviour of the random walk Metropolis algorithm in high-dimensional pr...
Study of diffusion limits of the Metropolis-Hastings algorithm in high dimensions yields useful quan...
We consider the optimal scaling problem for high-dimensional random walk Metropolis (RWM) algorithms...
Abstract For a given Markov chain Monte Carlo algorithm we introduce a distance between two configur...
We consider the optimal scaling problem for high-dimensional Random walk Metropolis (RWM) algorithms...
Markov Chain Monte Carlo (MCMC) techniques for sampling from complex probability distributions have ...
Abstract. Sampling from complex distributions is an important but challenging topic in scientific an...
We consider the optimal scaling problem for high-dimensional Random walk Metropolis (RWM) algorithms...
<div><p>Sampling from complex distributions is an important but challenging topic in scientific and ...
Recent optimal scaling theory has produced a condition for the asymptotically optimal acceptance rat...