BiologybioRxiv
Heuristic editor, no API keyVerdict: NotableExploiting Low-Rank Structure in Genomic Relationship Matrices for Computationally Efficient Optimum Contribution Selection
Motivation: Optimum contribution selection (OCS) maximizes genetic gain under a constraint on relatedness.
Key numbers
- 330-fold speedups
- 1% of the optimum at
Caveats
- Preprint; not yet peer reviewed.
VerdictWorth a reader's time today.
Abstract
Motivation: Optimum contribution selection (OCS) maximizes genetic gain under a constraint on relatedness. Genomic relationship matrices are dense, so the quadratic term costs O(n^3) operations, and existing OCS software assumes pedigree sparsity. Results: We replace the relationship matrix by its leading eigenpairs, computed by randomized SVD, and solve OCS in factorized form. On Norway spruce population (n=5,525), ranks 10--30 kept the exact objective within 1% of the optimum at 110--330-fold speedups; on the QTL-MAS 2010 (n=3,226), ranks up to 100 were needed (24-211 fold). The required rank rises as the diversity constraint loosens. Gain alone is a misleading accuracy check, since coancestry exceeded the optimum by up to 28%, so we choose the rank on the exact objective, which can be checked without a dense solve. The speedup comes from computing only the leading eigenpairs. We extend the factorization to robust OCS (18-fold). Availability and implementation: Julia implementation, and examples are available at https://github.com/jonhar97/fastocs under the MIT license (archived at Zenodo, DOI 10.5281/zenodo.23214804).
The editor's rubric
| Dimension | Level | Weight | What that level means |
|---|---|---|---|
| Leverage | ███░░ 3 | 24% | A method or resource many groups across the field will adopt within a year. |
| Magnitude | ███░░ 3 | 16% | Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem. |
| Evidence | ████░ 4 | 20% | Strong: large scale, preregistered, independently replicated, or a well-powered randomized trial. |
| Novelty | ██░░░ 2 | 20% | A new combination of known ideas. |
| Trajectory | ██░░░ 2 | 10% | Some room to improve with obvious engineering. |
| Stakes | ██░░░ 2 | 10% | Benefits a professional community (practitioners, clinicians, engineers). |
Editor’s rationale
Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: gains (x-fold, outperforms); design (randomized); verification (code released); scale (efficient).
How the score was computed
- Merit
- 5.6 / 10
- Adjusted merit
- 4.6 / 10
- Attention
- 0%
- Freshness
- 88%