An efficient proposal distribution for Metropolis–Hastings using a B-splines technique
In this paper, we proposed an efficient proposal distribution in the Metropolis–Hastings algorithm using the B-spline proposal Metropolis–Hastings algorithm. This new method can be extended to high-dimensional cases, such as the B-spline proposal in Gibbs sampling and in the Hit-and-Run (BSPHR) algorithm. It improves the proposal distribution in the Metropolis–Hastings algorithm by carrying more information from the target function. The performance of BSPHR was compared with that of other Markov Chain Monte Carlo (MCMC) samplers in simulation and real data examples. Simulation results show that the new method performs significantly better than other MCMC methods.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Giovanni Petris, . "An R Package for Dynamic Linear Models," Journal of Statistical Software, American Statistical Association, vol. 36(i12).
- S. Illeris & G. Akehurst, 2002. "Introduction," The Service Industries Journal, Taylor & Francis Journals, vol. 22(1), pages 1-3, January.
- Liang F. & Wong W.H., 2001. "Real-Parameter Evolutionary Monte Carlo With Applications to Bayesian Mixture Models," Journal of the American Statistical Association, American Statistical Association, vol. 96, pages 653-666, June.
When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:57:y:2013:i:1:p:465-478. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.