2000
DOI: 10.2307/2669532
|View full text |Cite
|
Sign up to set email alerts
|

The Multiple-Try Method and Local Optimization in Metropolis Sampling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
60
1

Year Published

2009
2009
2019
2019

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 59 publications
(62 citation statements)
references
References 0 publications
1
60
1
Order By: Relevance
“…The use of multiple chains has several desirable advantages, particularly when dealing with complex posterior distributions involving long tails, correlated parameters, multi-modality, and numerous local optima Liu et al, 2000;ter Braak, 2006;ter Braak and Vrugt, 2008;Vrugt et al, 2009a;Radu et al, 2009). The use of multiple chains offers a robust protection against premature convergence, and opens up the use of a wide arsenal of statistical measures to test whether convergence to a limiting distribution has been achieved (Gelman and Rubin, 1992).…”
Section: Multi-chain Methods: De-mcmentioning
confidence: 99%
See 2 more Smart Citations
“…The use of multiple chains has several desirable advantages, particularly when dealing with complex posterior distributions involving long tails, correlated parameters, multi-modality, and numerous local optima Liu et al, 2000;ter Braak, 2006;ter Braak and Vrugt, 2008;Vrugt et al, 2009a;Radu et al, 2009). The use of multiple chains offers a robust protection against premature convergence, and opens up the use of a wide arsenal of statistical measures to test whether convergence to a limiting distribution has been achieved (Gelman and Rubin, 1992).…”
Section: Multi-chain Methods: De-mcmentioning
confidence: 99%
“…It can be shown that this method satisfies the detailed balance condition and therefore produces a reversible Markov chain with the target distribution as the stationary distribution (Liu et al, 2000).…”
Section: Mt-dream (Zs)mentioning
confidence: 99%
See 1 more Smart Citation
“…This line sampling strategy overcomes the drawback of Gibbs line sampling. Furthermore, as Liu et al (2000) propose, this sampling strategy can be easily combined with a local optimization algorithm such as the Conjugate Gradient method. While Gilks et al (1994) did not mention exactly how to sample from the adjusted distribution, Liu et al (2000) developed a multiple-try method (MTM) for this purpose and named the new sampler the Conjugate Gradient Monte Carlo (CGMC) sampler.…”
Section: Introductionmentioning
confidence: 99%
“…This not only makes it difficult to rapidly explore multidimensional parameter spaces, but also complicates assessment of convergence, and effective use of multiprocessor resources. Prefetching [Brockwell, 2006] and multitry Metropolis sampling [Liu et al, 2000] offer some options for distributed, multicore implementation of single chains. What is more, the use of a single chain increases chances of premature convergence.…”
Section: Comparison With Other Posterior Sampling Methods 331 Compmentioning
confidence: 99%