1999
DOI: 10.1007/s001800050022
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive proposal distribution for random walk Metropolis algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
331
0
1

Year Published

2005
2005
2017
2017

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 382 publications
(333 citation statements)
references
References 9 publications
1
331
0
1
Order By: Relevance
“…For this first numerical exercise, we target the twisted Gaussian distribution proposed by Haario et al (1999) given by,…”
Section: A 10-dimensional Twisted Gaussian Target Distributionmentioning
confidence: 99%
“…For this first numerical exercise, we target the twisted Gaussian distribution proposed by Haario et al (1999) given by,…”
Section: A 10-dimensional Twisted Gaussian Target Distributionmentioning
confidence: 99%
“…Based on Metropolis algorithm, Hastings [38] developed Metropolis-Hastings(M-H) algorithm which is able to make use of any form of transition function, and meet the requirement of detailed balance. Aim at the selection of proposal function, Haario et al [39] developed an adaptive proposal distribution (AP) algorithm, AP is operated by a normal distribution of which the mean and variance are calculated by retained samples. Based on AP algorithm, Haario et al [40] developed an Adaptive Metropolis (AM) algorithm, with respect to AP, AM is superior in updating the mean and covariance of proposal distribution by using previous sampling information based on a regression formula.…”
Section: Uncertainty Analysis Of Groundwater Model Parametersmentioning
confidence: 99%
“…The most common adaptive single chain methods are the adaptive proposal (AP) (Haario et al, 1999), adaptive Metropolis (AM) (Haario et al, 2001) and delayed rejection adaptive metropolis (DRAM) algorithm (Haario et al, 2006), respectively. These methods work with a single trajectory, and continuously adapt the covariance, S of a Gaussian proposal distribution, q t ðx tÀ1 ; ,Þ ¼ N d ðx tÀ1 ; s d SÞ using the accepted samples of the chain, S ¼ cov(x 0 ,…,x tÀ1 ) þ 4I d .…”
Section: Single-chain Methodsmentioning
confidence: 99%
“…The SCEM-UA method can be made an exact sampler if the multi-chain adaptation of the covariance matrix is restricted to the burn-in period only. In a fashion similar to the AP (Haario et al, 1999) and AM algorithm, the method then derives an efficient Gaussian proposal distribution for the standard Metropolis algorithm. Nevertheless, I do not consider the SCEM-UA algorithm herein.…”
Section: Multi-chain Methods: De-mcmentioning
confidence: 99%