A multiple-try Metropolis-Hastings algorithm with tailored proposals (Q2319482)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A multiple-try Metropolis-Hastings algorithm with tailored proposals |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A multiple-try Metropolis-Hastings algorithm with tailored proposals |
scientific article |
Statements
A multiple-try Metropolis-Hastings algorithm with tailored proposals (English)
0 references
19 August 2019
0 references
acyclic graph
0 references
customized proposals
0 references
dependent proposals
0 references
Gibbs updates
0 references
Markov chain Monte Carlo
0 references
0 references
0 references
0 references
0.768735945224762
0 references
0.7680248618125916
0 references
0.7678260207176208
0 references
0.760521650314331
0 references
0.752372682094574
0 references
