A Brief Review of Optimal Scaling of the Main MCMC Approaches and Optimal Scaling of Additive TMCMC Under Non-Regular Cases
Kushal Kr Dey, Sourabh Bhattacharya

TL;DR
This paper extends the understanding of optimal scaling in TMCMC algorithms to non-Gaussian proposals and discontinuous targets, demonstrating superior performance over RWM in challenging scenarios like Cauchy proposals.
Contribution
It introduces diffusion-based optimal scaling analysis for non-Gaussian proposals in TMCMC, including discontinuous targets, and compares its effectiveness with RWM methods.
Findings
Diffusion-based scaling applies to non-Gaussian proposals.
TMCMC outperforms RWM in Cauchy proposal scenarios.
Simulation supports diffusion conjecture for Cauchy proposals.
Abstract
Very recently, Transformation based Markov Chain Monte Carlo (TMCMC) was proposed by Dutta and Bhattcharya (2013) as a much efficient alternative to the Metropolis-Hastings algorithm, Random Walk Metropolis (RWM) algorithm, especially in high dimensions. The main advantage of this algorithm is that it simultaneously updates all components of a high dimensional parameter by some appropriate deterministic transformation of a single random variable, thereby reducing time complexity and enhancing the acceptance rate. The optimal scaling of the additive TMCMC approach has already been studied for the Gaussian proposal density by Dey and Bhattacharya(2013). In this paper, we discuss diffusion-based optimal scaling behavior for non-Gaussian proposal densities - in particular, uniform, Student's t and Cauchy proposals. We also consider diffusion based optimal scaling for non-Gaussian proposals…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
