Adaptive independence samplers

Statistics and Computing

Volumn 18, Issue 4, 2008, Pages 409-420

  Keith, Jonathan M ^a   Kroese, Dirk P ^b   Sofronov, George Y ^c  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

^b UNIVERSITY OF QUEENSLAND   (Australia)

^c UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

Adaptive methods; Comparative genomics; Cross entropy; Generalized Markov sampler; Markov chain Monte Carlo

Indexed keywords

EID: 57849116433     PISSN: 09603174     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11222-008-9070-2     Document Type: Article

References (32)

1. H. Akaike 1974 A new look at the statistical model identification IEEE Trans. Autom. Control 19 6 716 723
2. P. Andolfatto 2005 Adaptive evolution of non-coding DNA in drosophila Nature 437 1149 1152
3. C. Andrieu E. Moulines 2006 On the ergodicity properties of some adaptive MCMC algorithms Ann. Appl. Aprobab. 16 3 1462 1505
4. Y.F. Atchade J.S. Rosenthal 2005 On adaptive Markov chain Monte Carlo algorithms Bernoulli 11 815 828
5. Ter Braak, C.J.F.: A Markov chain Monte Carlo version of the genetic algorithm differential evolution: easy Bayesian computing for real parameter spaces. Stat. Comput. 16 (2006)
6. D. Chauveau P. Vandekerkhove 2002 Improving convergence of the Hastings-Metropolis algorithm with an adaptive proposal Scand. J. Stat. 29 1 13 29
7. A.P. Dempster N.M. Laird D.B. Rubin 1977 Maximum likelihood from incomplete data via the EM algorithm J. R. Stat. Soc. 39 1 1 38
8. R. Douc A. Guillin J.-M. Marin C.P. Robert 2007 Convergence of adaptive mixtures of importance sampling schemes Ann. Stat. 35 1 420 448
9. J. Gasemyr 2003 On an adaptive version of the Metropolis-Hastings algorithm with independent proposal distribution Scand. J. Stat. 30 1 159 173
10. A.E. Gelfand S.K. Sahu 1994 On Markov chain Monte Carlo acceleration J. Comput. Graph. Stat. 3 3 261 276
11. Gelman, A., Carlin, J.B., Stern, H.S., Rubin, D.B.: Bayesian Data Analysis, 2nd edn. Chapman and Hall, London (2003)
12. Gelman, A.G., Roberts, G.O., Gilks, W.R.: Efficient metropolis jumping rules. In: Bernardo, J.M., Berger, J.O., Dawid, A.P., Smith, A.F.M. (eds.) Bayesian Statistics V, pp. 599-608. Oxford Univ. Press, New York (1996)
13. W. Gilks G. Roberts E. George 1994 Adaptive direction sampling Statistician 43 1 179 189
14. W. Gilks G. Roberts S. Sahu 1998 Adaptive Markov chain Monte Carlo through regeneration J. Am. Stat. Assoc. 93 1045 1054
15. H. Haario E. Saksman J. Tamminen 1999 Adaptive proposal distribution for random walk Metropolis algorithm Comput. Stat. 14 375 395
16. H. Haario E. Saksman J. Tamminen 2001 An adaptive Metropolis algorithm Bernoulli 7 2 223 242
17. H. Haario E. Saksman J. Tamminen 2005 Componentwise adaptation for high dimensional MCMC Comput. Stat. 20 265 273
18. W.K. Hastings 1970 Monte Carlo sampling methods using Markov chains and their applications Biometrika 57 97 109
19. Holden, L.: Adaptive chains. Technical report, Norwegian Computing Centre, P.O. Box 114 Blindern, N-0314, Oslo, Norway (2000)
20. S. Kullback R.A. Leibler 1951 On information and sufficiency Ann. Math. Stat. 22 79 86
21. Liu, J.S.: Monte Carlo Strategies in Scientific Computing. Springer, Berlin (2001)
22. McLachlan, G., Krishnan, T.: The EM Algorithm and Extensions. Wiley, New York (1997)
23. Mengersen, K., Robert, C.P.: Iid sampling using self-avoiding population Monte Carlo: the pinball sampler. In: Bernardo, J.M., Bayarri, M.J., Berger, J.O., Dawid, A.P., Heckerman, D., Smith, A.F.M., West, M. (eds.) Bayesian Statistics 7, pp. 277-292. Clarendon, Oxford (2003)
24. N. Metropolis A.W. Rosenbluth M.N. Rosenbluth A.H. Teller 1953 Equations of state calculations by fast computing mashines J. Chem. Phys. 21 1087 1092
25. P. Mykland L. Tierney B. Yu 1995 Regeneration in Markov chain samplers J. Am. Stat. Assoc. 90 233 241
26. Pasarica, C., Gelman, A.: Adaptively scaling the Metropolis algorithm using expected squared jumped distance. Technical report, Department of Statistics, Columbia University (2003)
27. Rubinstein, R.Y., Kroese, D.P.: The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning. Springer, New York (2004)
28. S.K. Sahu A.A. Zhigljavsky 2003 Self-regenerative Markov chain Monte Carlo with adaptation Bernoulli 9 395 422
29. G. Schwarz 1978 Estimating the dimension of a model Ann. Stat. 6 2 461 464
30. L. Tierney A. Mira 1999 Some adaptive Monte Carlo methods for Bayesian inference Stat. Medicine 18 2507 2515
31. Warnes, G.R.: The normal kernel coupler: An adaptive Markov chain Monte Carlo method for efficiently sampling from multi-modal distributions. Technical Report 39, Department of Statistics, University of Washington (2003)
32. R.H. Waterston K. Lindblad-Toh E. Birney J. Rogers J.F. Abril 2002 Initial sequencing and comparative analysis of the mouse genome Nature 420 520 562