Hamiltonian Monte Carlo method for estimating variance components
- PMID: 34227195
- DOI: 10.1111/asj.13575
Hamiltonian Monte Carlo method for estimating variance components
Abstract
A Hamiltonian Monte Carlo algorithm is a Markov chain Monte Carlo method, and the method has a potential to improve estimating parameters effectively. Hamiltonian Monte Carlo is based on Hamiltonian dynamics, and it follows Hamilton's equations, which are expressed as two differential equations. In the sampling process of Hamiltonian Monte Carlo, a numerical integration method called leapfrog integration is used to approximately solve Hamilton's equations, and the integration is required to set the number of discrete time steps and the integration stepsize. These two parameters require some amount of tuning and calibration for effective sampling. In this study, we applied the Hamiltonian Monte Carlo method to animal breeding data and identified the optimal tunings of leapfrog integration for normal and inverse chi-square distributions. Then, using real pig data, we revealed the properties of the Hamiltonian Monte Carlo method with the optimal tuning by applying models including variance explained by pedigree information or genomic information. Compared with the Gibbs sampling method, the Hamiltonian Monte Carlo method had superior performance in both models. We have provided the source codes of this method written in the Fortran language at https://github.com/A-ARAKAWA/HMC.
Keywords: Gibbs sampling; Hamiltonian Monte Carlo; genomic selection; leapfrog integration; mixed model.
© 2021 Japanese Society of Animal Science.
References
REFERENCES
-
- Aguilar, I., Misztal, I., Johnson, D. J., Legarra, A., Tsuruta, S., & Lawlor, T. J. (2010). Hot topic: A unified approach to utilize phenotypic, full pedigree, and genomic information for genetic evaluation of Holstein final score. Journal of Dairy Science, 93, 743-752. https://doi.org/10.3168/jds.2009-2730
-
- Amari, S. (2016). Information geometry and its applications. Springer.
-
- Betancourt, M., Byrne, S., Livingstone, S., & Girolami, M. (2017). The geometric foundations of Hamiltonian Monte Carlo. Bernoulli, 23, 2257-2298. https://doi.org/10.3150/16-BEJ810
-
- Carpenter, B., Gelman, A., Hoffman, M. D., Lee, D., Goodrich, B., Betancourt, M., Brubaker, M. A., Guo, J., Li, P., & Riddell, A. (2017). Stan: A probabilistic programming language. Journal of Statistical Software, 76, 1. https://doi.org/10.18637/jss.v076.i01
-
- Christensen, O. F., Møller, J., & Waagepetersen, R. P. (2001). Geometric ergodicity of Metropolis-Hastings algorithms for conditional simulation in generalized linear mixed models. Methodology and Computing in Applied Probability, 3, 309-327. https://doi.org/10.1023/A:1013779208892
MeSH terms
Grants and funding
LinkOut - more resources
Full Text Sources