2019
DOI: 10.1186/s12711-019-0515-1
|View full text |Cite
|
Sign up to set email alerts
|

Performance of Hamiltonian Monte Carlo and No-U-Turn Sampler for estimating genetic parameters and breeding values

Abstract: BackgroundHamiltonian Monte Carlo is one of the algorithms of the Markov chain Monte Carlo method that uses Hamiltonian dynamics to propose samples that follow a target distribution. The method can avoid the random walk behavior to achieve a more effective and consistent exploration of the probability space and sensitivity to correlated parameters, which are shortcomings that plague many Markov chain Monte Carlo methods. However, the performance of Hamiltonian Monte Carlo is highly sensitive to two hyperparame… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
32
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 42 publications
(38 citation statements)
references
References 18 publications
0
32
0
Order By: Relevance
“…A Bayesian method was used to infer parameters using stan language (Carpenter et al, 2017, code (Nishio & Arakawa, 2019).…”
Section: Relationship Between Topography and Neutral And Adaptive Genetic Variationmentioning
confidence: 99%
“…A Bayesian method was used to infer parameters using stan language (Carpenter et al, 2017, code (Nishio & Arakawa, 2019).…”
Section: Relationship Between Topography and Neutral And Adaptive Genetic Variationmentioning
confidence: 99%
“…Samples were drawn from the posterior distributions of the model parameters using the NUTS sampler (Hoffman and Gelman, 2013). Four sampling chains were run, each collecting 4,000 iterations whereby the first 1,000 iterations were disregarded as part of the warm-up phase leading to 12,000 iterations available for analysis.…”
Section: Discussionmentioning
confidence: 99%
“…In this sampling process, the alternative sampling of u and θ is carried out, where θ is fixed initially and sampled for u such that the condition given in Equation (13) will be satisfied (i.e., 0 ≤ u ≤ π(θ) → p(u|θ)~uniform(0, π(θ)). After that, a horizontal slice region S is formed from the sample θ (S = (θ: u ≤ π(θ)) [34].…”
Section: Bayesian Approachmentioning
confidence: 99%
“…After slice sampling, the No-U-Turn sampler initiates with the uniformity as given in Equation ( 15); however, its efficiency is highly dependent on the probability of the acceptance. The step size will be small for a high acceptance probability that requires many leapfrog steps to generate the subset of candidate (θ|p) states [34].…”
Section: Bayesian Approachmentioning
confidence: 99%