A Two Stage Adaptive Metropolis Algorithm

01/01/2021
by   Anirban Mondal, et al.
0

We propose a new sampling algorithm combining two quite powerful ideas in the Markov chain Monte Carlo literature – adaptive Metropolis sampler and two-stage Metropolis-Hastings sampler. The proposed sampling method will be particularly very useful for high-dimensional posterior sampling in Bayesian models with expensive likelihoods. In the first stage of the proposed algorithm, an adaptive proposal is used based on the previously sampled states and the corresponding acceptance probability is computed based on an approximated inexpensive target density. The true expensive target density is evaluated while computing the second stage acceptance probability only if the proposal is accepted in the first stage. The adaptive nature of the algorithm guarantees faster convergence of the chain and very good mixing properties. On the other hand, the two-stage approach helps in rejecting the bad proposals in the inexpensive first stage, making the algorithm computationally efficient. As the proposals are dependent on the previous states the chain loses its Markov property, but we prove that it retains the desired ergodicity property. The performance of the proposed algorithm is compared with the existing algorithms in two simulated and two real data examples.

READ FULL TEXT

page 15

page 16

research
05/03/2021

A Metropolized adaptive subspace algorithm for high-dimensional Bayesian variable selection

A simple and efficient adaptive Markov Chain Monte Carlo (MCMC) method, ...
research
10/22/2021

Adaptive random neighbourhood informed Markov chain Monte Carlo for high-dimensional Bayesian variable Selection

We introduce a framework for efficient Markov Chain Monte Carlo (MCMC) a...
research
05/27/2019

Efficient posterior sampling for high-dimensional imbalanced logistic regression

High-dimensional data are routinely collected in many application areas....
research
10/22/2022

Transport Reversible Jump Proposals

Reversible jump Markov chain Monte Carlo (RJMCMC) proposals that achieve...
research
08/18/2018

Optimal proposals for Approximate Bayesian Computation

We derive the optimal proposal density for Approximate Bayesian Computat...
research
01/04/2018

Constructing Metropolis-Hastings proposals using damped BFGS updates

This paper considers the problem of computing Bayesian estimates of syst...
research
10/13/2021

Generating MCMC proposals by randomly rotating the regular simplex

We present the simplicial sampler, a class of parallel MCMC methods that...

Please sign up or login with your details

Forgot password? Click here to reset