bioRxivGeneticsPreprint
Tunings for leapfrog integration of Hamiltonian Monte Carlo for estimating genetic parameters
Aisaku ArakawaiD, Takeshi Hayashi, Masaaki TaniguchiiD, Satoshi Mikawa, Motohide NishioiD
Abstract
A Hamiltonian Monte Carlo algorithm is a Markov Chain Monte Carlo method that is considered more effective than the conventional Gibbs sampling method. Hamiltonian Monte Carlo is based on Hamiltonian dynamics, and it follows Hamiltons 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 Hamiltons 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 R language.
- Citations
- 0
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Scalable gradients enable Hamiltonian Monte Carlo sampling for phylodynamic inference under episodic birth-death-sampling models
Y. Shao, A. F. Magee, … M. A. Suchard·bioRxiv·Oct 31, 2023
- Assessment of the performance of different hidden Markov models for imputation in animal breeding
Andrew Whalen, Gregor Gorjanc, … John M. Hickey·Genetics Selection EvolutionPeer-reviewed·Sep 17, 2018
- Reparametrizing the Sigmoid Model of Gene Regulation for Bayesian Inference
Martin Modrák·Lecture notes in computer sciencePeer-reviewed·Jan 1, 2018
- A new iterative framework for simulation-based population genetic inference with improved coverage properties of confidence intervals
François Rousset, Raphaël Leblois, … Jean‐Michel Marin·Peer Community JournalPeer-reviewed·May 7, 2026
- Exact decoding of the sequentially Markov coalescent
Caleb Ki, Jonathan Terhorst·bioRxiv·Sep 21, 2020
- Worth the effort? A practical examination of random effects in hidden Markov models for animal telemetry data
B. T. McClintock·bioRxiv·Jul 10, 2020