PSV-14 Using Bayesian Hamiltonian Monte Carlo and a nonlinear model for the estimation of genetic parameters for lactation curves in goats
Bibliographic record
Abstract
Abstract Hamiltonian Monte Carlo (HMC) is an algorithm of the Markov Chain Monte Carlo (MCMC) method that uses dynamics to propose samples that follow a target distribution. This algorithm enables more effective and consistent exploration of the probability interval and is more sensitive to correlated parameters. Therefore, Bayesian-HMC is a promising alternative to estimate individual parameters of complex functions such as nonlinear models, especially when using small datasets. Our objective was to estimate genetic parameters for milk traits defined based on nonlinear model parameters predicted using the Bayesian-HMC algorithm. A total of 64,680 milk yield test-day records from 2,624 first, second, and third lactations of Saanen and Alpine goats were used. First, the Wood model was fitted to the data. Second, lactation persistency (LP), peak time (PT), peak yield (PY), and total milk yield [estimated from zero to 50 (TMY50), 100(TMY100), 150(TMY150), 200(TMY200), 250(TMY250), and 300(TMY300) days-in-milk] were predicted for each animal and parity based on the output of the first step (the individual phenotypic parameters of the Wood model). Thereafter, these predicted phenotypes were used for estimating genetic parameters for each trait. In general, the heritability estimates across lactations ranged from 0.10 to 0.20 for LP, 0.04 to 0.07 for PT, 0.26 to 0.27 for PY, and 0.21 to 0.28 for TMY (considering the different intervals). Lower heritabilities were obtained for the nonlinear function parameters (A, b and l) compared to its predicted traits (except PT), especially for the first and second lactations (range: 0.09 to 0.18). Higher heritability estimates were obtained for the third lactation traits. To our best knowledge, this study is the first attempt to use the HMC algorithm to fit a nonlinear model in animal breeding. The two-step method proposed here allowed us to estimate genetic parameters for all traits evaluated.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.007 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".