메뉴 건너뛰기




Volumn 17, Issue 2, 2008, Pages 312-332

Efficient sampling using metropolis algorithms: Applications of optimal scaling results

Author keywords

Asymptotically optimal acceptance rate; Diffusion; Hierarchical model; Nonidentically distributed components; Speed measure; Target distribution

Indexed keywords


EID: 46849119211     PISSN: 10618600     EISSN: None     Source Type: Journal    
DOI: 10.1198/108571108X319970     Document Type: Article
Times cited : (15)

References (14)
  • 1
    • 42649097792 scopus 로고    scopus 로고
    • Weak Convergence of Metropolis Algorithms for Non-IID Target Distributions
    • Bédard, M. (2007), "Weak Convergence of Metropolis Algorithms for Non-IID Target Distributions," Annals of Applied Probability, 17, 1222-1244.
    • (2007) Annals of Applied Probability , vol.17 , pp. 1222-1244
    • Bédard, M.1
  • 2
    • 46849107854 scopus 로고    scopus 로고
    • Optimal Acceptance Rates for Metropolis Algorithms: Moving Beyond 0.234
    • to appear
    • (2006), "Optimal Acceptance Rates for Metropolis Algorithms: Moving Beyond 0.234," Stochastic Processes and their Applications, to appear.
    • Stochastic Processes and their Applications
  • 3
    • 46849102103 scopus 로고    scopus 로고
    • On the Optimization of Metropolis Algorithms for Hierarchical Target Distributions
    • in preparation
    • (2008), "On the Optimization of Metropolis Algorithms for Hierarchical Target Distributions," in preparation.
  • 5
    • 77956890234 scopus 로고
    • Monte Carlo Sampling Methods using Markov Chains and their Applications
    • Hastings, W. K. (1970), "Monte Carlo Sampling Methods using Markov Chains and their Applications," Biometrika, 57, 97-109.
    • (1970) Biometrika , vol.57 , pp. 97-109
    • Hastings, W.K.1
  • 8
    • 46849092340 scopus 로고    scopus 로고
    • Optimal Scaling for Partially Updating MCMC Algorithms
    • to appear
    • Neal, P., and Roberts, G. O. (2004), "Optimal Scaling for Partially Updating MCMC Algorithms," Annals of Applied Probability, to appear.
    • (2004) Annals of Applied Probability
    • Neal, P.1    Roberts, G.O.2
  • 10
    • 46849099967 scopus 로고    scopus 로고
    • Adaptively Scaling the Metropolis Algorithm using Expected Squared Jumped Distance,
    • Department of Statistics, Columbia University
    • Pasarica, C., and Gelman A. (2003), "Adaptively Scaling the Metropolis Algorithm using Expected Squared Jumped Distance," technical report, Department of Statistics, Columbia University.
    • (2003) technical report
    • Pasarica, C.1    Gelman, A.2
  • 11
    • 0031285157 scopus 로고    scopus 로고
    • Weak Convergence and Optimal Scaling of Random Walk Metropolis Algorithms
    • 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.
    • (1997) Annals of Applied Probability , vol.7 , pp. 110-120
    • Roberts, G.O.1    Gelman, A.2    Gilks, W.R.3
  • 13
    • 0013037129 scopus 로고    scopus 로고
    • Optimal Scaling for various Metropolis-Hastings Algorithms
    • (2001), "Optimal Scaling for various Metropolis-Hastings Algorithms," Statistical Science, 16, 351-367.
    • Statistical Science , vol.16 , pp. 351-367
  • 14
    • 46849111750 scopus 로고    scopus 로고
    • Methodology for Inference on the Markov Modulated Poisson Process and Theory for Optimal Scaling of the Random Walk Metropolis,
    • Ph.D. dissertation, Lancaster University, Department of Mathematics and Statistics
    • Sherlock, C. (2006), "Methodology for Inference on the Markov Modulated Poisson Process and Theory for Optimal Scaling of the Random Walk Metropolis," Ph.D. dissertation, Lancaster University, Department of Mathematics and Statistics.
    • (2006)
    • Sherlock, C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.