Brazilian Journal of Probability and Statistics
- Braz. J. Probab. Stat.
- Volume 33, Number 2 (2019), 222-266.
A brief review of optimal scaling of the main MCMC approaches and optimal scaling of additive TMCMC under non-regular cases
Transformation based Markov Chain Monte Carlo (TMCMC) was proposed by Dutta and Bhattacharya (Statistical Methodology 16 (2014) 100–116) as an efficient alternative to the Metropolis–Hastings algorithm, especially in high dimensions. The main advantage of this algorithm is that it simultaneously updates all components of a high dimensional parameter using appropriate move types defined by deterministic transformation of a single random variable. This results in reduction in time complexity at each step of the chain and enhances the acceptance rate.
In this paper, we first provide a brief review of the optimal scaling theory for various existing MCMC approaches, comparing and contrasting them with the corresponding TMCMC approaches.The optimal scaling of the simplest form of TMCMC, namely additive TMCMC, has been studied extensively for the Gaussian proposal density in Dey and Bhattacharya (2017a). Here, we discuss diffusion-based optimal scaling behavior of additive TMCMC for non-Gaussian proposal densities—in particular, uniform, Student’s $t$ and Cauchy proposals. Although we could not formally prove our diffusion result for the Cauchy proposal, simulation based results lead us to conjecture that at least the recipe for obtaining general optimal scaling and optimal acceptance rate holds for the Cauchy case as well. We also consider diffusion based optimal scaling of TMCMC when the target density is discontinuous. Such non-regular situations have been studied in the case of Random Walk Metropolis Hastings (RWMH) algorithm by Neal and Roberts (Methodology and Computing in Applied Probability 13 (2011) 583–601) using expected squared jumping distance (ESJD), but the diffusion theory based scaling has not been considered.
We compare our diffusion based optimally scaled TMCMC approach with the ESJD based optimally scaled RWM with simulation studies involving several target distributions and proposal distributions including the challenging Cauchy proposal case, showing that additive TMCMC outperforms RWMH in almost all cases considered.
Braz. J. Probab. Stat., Volume 33, Number 2 (2019), 222-266.
Received: June 2016
Accepted: November 2017
First available in Project Euclid: 4 March 2019
Permanent link to this document
Digital Object Identifier
Dey, Kushal K.; Bhattacharya, Sourabh. A brief review of optimal scaling of the main MCMC approaches and optimal scaling of additive TMCMC under non-regular cases. Braz. J. Probab. Stat. 33 (2019), no. 2, 222--266. doi:10.1214/17-BJPS386. https://projecteuclid.org/euclid.bjps/1551690033