Parallel computing in linear mixed models

Gökalp Yavuz, Fulya
Schloerke, Barret
In this study, we propose a parallel programming method for linear mixed models (LMM) generated from big data. A commonly used algorithm, expectation maximization (EM), is preferred for its use of maximum likelihood estimations, as the estimations are stable and simple. However, EM has a high computation cost. In our proposed method, we use a divide and recombine to split the data into smaller subsets, running the algorithm steps in parallel on multiple local cores and combining the results. The proposed method is used to fit LMM with dense and sparse parameters and for large number of observations. It is faster than the classical approach and generalizes for big data. Supplementary sources for the proposed method are available in the R package lmmpar.

Citation Formats
F. Gökalp Yavuz and B. Schloerke, “Parallel computing in linear mixed models,” COMPUTATIONAL STATISTICS, vol. 35, no. 3, pp. 1273–1289, 2020, Accessed: 00, 2020. [Online]. Available: