Optimal Proposal Distributions and Adaptive MCMC
暂无分享,去创建一个
[1] Jeffrey S. Rosenthal,et al. Optimal scaling of Metropolis algorithms: Heading toward general target distributions , 2008 .
[2] Christophe Andrieu,et al. On the efficiency of adaptive MCMC algorithms , 2006, valuetools '06.
[3] R. Tweedie,et al. Exponential Convergence of Langevin Diiusions and Their Discrete Approximations , 1997 .
[4] Chao Yang,et al. Learn From Thy Neighbor: Parallel-Chain Adaptive MCMC , 2008 .
[5] M. Bédard. Optimal acceptance rates for Metropolis algorithms: Moving beyond 0.234 , 2008 .
[6] Yves F. Atchad'e. A cautionary tale on the efficiency of some adaptive monte carlo schemes , 2009, 0901.1378.
[7] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[8] A. Gelman,et al. Adaptively Scaling the Metropolis Algorithm Using Expected Squared Jumped Distance , 2007 .
[9] H. Haario,et al. An adaptive Metropolis algorithm , 2001 .
[10] J. Rosenthal,et al. On adaptive Markov chain Monte Carlo algorithms , 2005 .
[11] R. Tweedie,et al. Bounds on regeneration times and convergence rates for Markov chains fn1 fn1 Work supported in part , 1999 .
[12] Gareth O. Roberts,et al. Examples of Adaptive MCMC , 2009 .
[13] L. Tierney. Markov Chains for Exploring Posterior Distributions , 1994 .
[14] W. K. Yuen,et al. Optimal scaling of random walk Metropolis algorithms with discontinuous target densities , 2012, 1210.5090.
[15] Jeffrey S. Rosenthal,et al. AMCMC: An R interface for adaptive MCMC , 2007, Comput. Stat. Data Anal..
[16] Galin L. Jones. On the Markov chain central limit theorem , 2004, math/0409112.
[17] J. Rosenthal,et al. General state space Markov chains and MCMC algorithms , 2004, math/0404033.
[18] Mylène Bédard. Efficient Sampling Using Metropolis Algorithms: Applications of Optimal Scaling Results , 2008 .
[19] J. Rosenthal,et al. Department of , 1993 .
[20] P. Carlo. Population Monte Carlo , 2004 .
[21] Chao Yang,et al. On The Weak Law Of Large Numbers For Unbounded Functionals For Adaptive MCMC , 2007 .
[22] Jeffrey S. Rosenthal,et al. Coupling and Ergodicity of Adaptive MCMC , 2007 .
[23] J. Rosenthal,et al. Optimal scaling for various Metropolis-Hastings algorithms , 2001 .
[24] J. Rosenthal. QUANTITATIVE CONVERGENCE RATES OF MARKOV CHAINS: A SIMPLE ACCOUNT , 2002 .
[25] M. B'edard. Weak convergence of Metropolis algorithms for non-i.i.d. target distributions , 2007, 0710.3684.
[26] Anne-Mette K. Hein,et al. BGX: a Bioconductor package for the Bayesian integrated analysis of Affymetrix GeneChips , 2007, BMC Bioinformatics.
[27] Galin L. Jones,et al. On the applicability of regenerative simulation in Markov chain Monte Carlo , 2002 .
[28] C. Sherlock. Methodology for inference on the Markov modulated Poisson process and theory for optimal scaling of the random walk Metropolis , 2006 .
[29] P. Giordani,et al. Adaptive Independent Metropolis–Hastings by Fast Estimation of Mixtures of Normals , 2008, 0801.1864.
[30] W. K. Hastings,et al. Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .
[31] Chao Yang,et al. Recurrent and Ergodic Properties of Adaptive MCMC , 2007 .
[32] J. Rosenthal,et al. Optimal scaling of discrete approximations to Langevin diffusions , 1998 .
[33] M. Pitt,et al. Filtering via Simulation: Auxiliary Particle Filters , 1999 .
[34] Galin L. Jones,et al. Honest Exploration of Intractable Probability Distributions via Markov Chain Monte Carlo , 2001 .
[35] Y. Atchadé. An Adaptive Version for the Metropolis Adjusted Langevin Algorithm with a Truncated Drift , 2006 .
[36] A. Gelman,et al. Weak convergence and optimal scaling of random walk Metropolis algorithms , 1997 .
[37] J. Rosenthal. Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo , 1995 .
[38] Heikki Haario,et al. Componentwise adaptation for high dimensional MCMC , 2005, Comput. Stat..
[39] Antonietta Mira,et al. Ordering and Improving the Performance of Monte Carlo Markov Chains , 2001 .
[40] P. Moral,et al. Sequential Monte Carlo samplers , 2002, cond-mat/0212648.