Optimal proposal distributions and adaptive MCMC

Handbook of Markov Chain Monte Carlo

Volumn , Issue , 2011, Pages 93-112

  Rosenthal, Jeffrey S ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85055166148     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (43)

1. Andrieu, C. and Atchadé, Y. F. 2007. On the efficiency of adaptive MCMC algorithms. Electronic Communications in Probability, 12:336-349
2. Andrieu, C. and Moulines, E. 2006. On the ergodicity properties of some adaptive Markov chain Monte Carlo algorithms. Annals of Applied Probability, 16:1462-1505
3. Atchadé, Y. F. 2006. An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift. Methodology and Computing in Applied Probability, 8:235-254
4. Atchadé, Y. F. 2007. A cautionary tale on the efficiency of some adaptive Monte Carlo schemes. Annals of Applied Probability, to appear
5. Atchadé, Y. F. and Rosenthal, J. S. 2005. On adaptive Markov chain Monte Carlo algorithms. Bernoulli, 11:815-828
6. Bai, Y., Roberts, G. O., and Rosenthal, J. S. 2008. On the containment condition for adaptive Markov chain Monte Carlo algorithms. Preprint
7. Bédard, M. 2007. Weak convergence of Metropolis algorithms for non-iid target distributions. Annals of Applied Probability, 17:1222-1244
8. Bédard, M. 2008a. Efficient sampling using Metropolis algorithms: Applications of optimal scaling results. Journal of Computational and Graphical Statistics, 17:1-21
9. Bédard, M. 2008b. Optimal acceptance rates for Metropolis algorithms: Moving beyond 0.234. Stochastic Processes and their Applications, 118(12):2198-2222
10. Bédard, M. and Rosenthal, J. S. 2008. Optimal scaling of Metropolis algorithms: Heading towards general target distributions. Canadian Journal of Statistics, 36(4):483-503
11. Cappé, O., Guillin, A., Marin, J. M., and Robert, C. P. 2004. Population Monte Carlo. Journal of Computational and Graphical Statistics, 13:907-930
12. Craiu, R. V., Rosenthal, J. S., and Yang, C. 2009. Learn from thy neighbor: Parallel-chain adaptive MCMC. Journal of the American Statistical Association, 488:1454-1466
13. Del Moral, P., Doucet, A., and Jasra, A. 2006. Sequential Monte Carlo samplers. Journal of the Royal Statistical Society, Series B, 68:411-436
14. Gelman, A., Roberts, G. O., and Gilks, W. R. 1996. Efficient Metropolis jumping rules. In J. M. Bernardo, J. O. Berger, A. P. Dawid, and A. F. M. Smith (eds), Bayesian Statistics 5: Proceedings of the Fifth Valencia International Meeting, pp. 599-607. Oxford University Press, Oxford
15. Giordani, P. and Kohn, R. 2006. Adaptive independent Metropolis-Hastings by fast estimation of mixtures of normals. Journal of Computational and Graphical Statistics, to appear
16. Haario, H., Saksman, E., and Tamminen, J. 2001. An adaptive Metropolis algorithm. Bernoulli, 7:223-242
17. Haario, H., Saksman, E., and Tamminen, J. 2005. Componentwise adaptation for high dimensional MCMC. Computational Statistics, 20:265-274
18. Hastings, W. K. 1970. Monte Carlo sampling methods using Markov chains and their applications. Biometrika, 57:97-109
19. Hobert, J. P., Jones, G. L., Presnell, B., and Rosenthal, J. S. 2002. On the applicability of regenerative simulation in Markov chain Monte Carlo. Biometrika 89:731-743
20. Jones, G. L. 2004. On the Markov chain central limit theorem. Probability Surveys, 1:299-320
21. Jones, G. L. and Hobert, J. P. 2001. Honest exploration of intractable probability distributions via Markov chain Monte Carlo. Statistical Science, 16(4):312-334
22. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and Teller, E. 1953. Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21(6):1087-1092
23. Mira, A. 2001. Ordering and improving the performance of Monte Carlo Markov chains. Statistical Science, 16:340-350
24. Neal, P. J., Roberts, G. O., and Yuen, W. K. 2007. Optimal scaling of random walk Metropolis algorithms with discontinuous target densities. Preprint
25. Pasarica, C. and Gelman,A. 2010.Adaptively scaling the Metropolis algorithm using expected squared jumped distance. Statistica Sinica, 20:343-364
26. Pitt, M. K. and Shephard, N. 1999. Filtering via simulation: auxiliary particle filters. Journal of the American Statistical Association, 94:1403-1412
27. Roberts, G. O., Gelman, A., and Gilks, W. R. 1997. Weak convergence and optimal scaling of random walk Metropolis algorithms. Annals of Applied Probability, 7:110-120
28. Roberts, G. O. and Rosenthal, J. S. 1998. Optimal scaling of discrete approximations to Langevin diffusions. Journal of the Royal Statistical Society, Series B, 60:255-268
29. Roberts, G. O. and Rosenthal, J. S. 2001. Optimal scaling for various Metropolis-Hastings algorithms. Statistical Science, 16:351-367
30. Roberts, G. O. and Rosenthal, J. S. 2004. General state space Markov chains and MCMC algorithms. Probability Surveys, 1:20-71
31. Roberts, G. O. and Rosenthal, J. S. 2007. Coupling and ergodicity of adaptive MCMC. Journal of Applied Probability 44:458-475
32. Roberts, G. O. and Rosenthal, J. S. 2009. Examples of adaptive MCMC. Journal of Computational and Graphical Statistics 18(2):349-367
33. Roberts, G. O. and Tweedie, R. L. 1996. Exponential convergence of Langevin diffusions and their discrete approximations. Bernoulli, 2:341-363
34. Roberts, G. O. and Tweedie, R. L. 1999. Bounds on regeneration times and convergence rates for Markov chains. Stochastic Processes and Their Applications, 80: 211-229. Corrigendum (2001), 91:337-338
35. Rosenthal, J. S. 1995. Minorization conditions and convergence rates for Markov chain Monte Carlo. Journal of the American Statistical Association, 90:558-566
36. Rosenthal, J. S. 2002. Quantitative convergence rates of Markov chains: A simple account. Electronic Communications in Probability, 7(13):123-128
37. Rosenthal, J. S. 2004. Adaptive MCMC Java applet. Available at: http://probability.ca/jeff/java/ adapt.html
38. Rosenthal, J. S. 2007. AMCMC: An R interface for adaptive MCMC. Computational Statistics & Data Analysis, 51:5467-5470. (Related software available at probability.ca/amcmc.)
39. Sherlock, C. 2006. Methodology for inference on the Markov modulated Poisson processes and theory for optimal scaling of the random walk Metropolis. Ph.D. dissertation, Lancaster University
40. Tierney, L. 1994. Markov chains for exploring posterior distributions (with discussion). Annals of Statistics, 22:1701-1762
41. Turro, E., Bochkina, N., Hein, A. M. K., and Richardson, S. 2007. BGX: a Bioconductor package for the Bayesian integrated analysis of Affymetrix GeneChips. BMC Bioinformatics, 8:439-448. Available at: http://www.biomedcentral.com/1471-2105/8/439
42. Yang, C. 2008a. On the weak law of large numbers for unbounded functionals for adaptive MCMC. Preprint
43. Yang, C. 2008b. Recurrent and ergodic properties of adaptive MCMC. Preprint