Validation of an Approximate REML Algorithm for Parameter Estimation in a Multitrait, Multiple Across-Country Evaluation Model: A Simulation Study
Bibliographic record
Abstract
A multitrait, multiple across-country evaluation (MT-MACE) model permitting a variable number of correlated traits per country allows international genetic evaluation models to more closely match national models. Before the MT-MACE evaluation can be applied, genetic (co)variance components within and across country must be estimated. An approximate REML algorithm for parameter estimation was developed and was validated via simulation. This method is based on the expectation maximization REML (EM-REML) algorithm. Because obtaining the inverse of co-efficient matrix is not usually feasible for large amounts of data, an algorithm using the multiple-trait effective daughter contribution (EDC) is proposed to provide approximate diagonal elements of the inverse matrix. The accuracy of the approximate EM-REML was tested with simulated data and compared with an average information REML (AI-REML) from available software. Two simulation studies were performed. First, data of 2 countries were simulated using a single-trait model. Estimates of across-country genetic correlations with the developed algorithm were unbiased and very precise. The precision, however, depended on the percentage of bulls with data in both countries. The results obtained with the approximate EM-REML software were very close to those obtained with the AI-REML software regarding estimated genetic correlations and bulls' estimated breeding values. The second simulation assumed a multiple trait model and the same number of traits, pedigree structure, EDC, and pattern of missing records as for actual observations for milk yield obtained from French and German national Holstein evaluations. As with the single-trait scenarios, the approximate EM-REML gave nearly unbiased and very precise estimates of within- and across-country genetic correlations. The results obtained in both simulation studies confirmed the suitability of the MT-MACE model and approximate EM-REML software in a wide range of situations. Even when the genetic trend was incorrectly estimated by the national evaluations, a joint analysis including a time effect in the MT-MACE model adequately corrected for this bias.
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.019 | 0.032 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| 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".