Iterative dispersion update achieves global optimum fitting linear mixed model in genetic associations
Guan, Y.; Levy, D.
Show abstract
The linear mixed model (LMM) has become a standard in genetic association studies to account for population stratification and relatedness in the samples to reduce false positives. Much recent progresses in LMM focused on approximate computations. Exact methods remained computationally demanding and without theoretical assurance. The computation is particularly challenging for multiomics studies where tens of thousands of phenotypes are tested for association with millions of genetic markers. We present IDUL and IDUL{dagger} that use iterative dispersion updates to fit LMMs, where IDUL{dagger} is a modified version of IDUL that guarantees likelihood increase between updates. Practically, IDUL and IDUL{dagger} produced identical results, both are markedly more efficient than the state-of-the-art Newton-Raphson method, and in particular, both are highly efficient for additional phenotypes, making them ideal to study genetic determinants of multiomics phenotypes. Theoretically, the LMM like-lihood is asymptotically uni-modal, and therefore the gradient ascent algorithm IDUL{dagger} is an asymptotically exact method. A software package implementing IDUL and IDUL{dagger} for genetic association studies is freely available at https://github.com/haplotype/IDUL.
Matching journals
The top 2 journals account for 50% of the predicted probability mass.
Similar papers in this journal
Similar papers in this journal
Similar papers in this journal
- Survival Analysis on Rare Events Using Group-Regularized Multi-Response Cox Regression 96%
- The winner's curse under dependence: repairing empirical Bayes using convoluted densities 96%
- A mixed-model approach for powerful testing of genetic associations with cancer risk incorporating tumor characteristics 94%
Similar papers in this journal
"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.