Abstract

The expectation-maximization (EM) algorithm is a popular tool for maximum likelihood estimation, but its use in high-dimensional regularization problems in linear mixed-effects models has been limited. In this article, we introduce the EMLMLasso algorithm, which combines the EM algorithm with the popular and efficient R package glmnet for Lasso variable selection of fixed effects in linear mixed-effects models and allows for automatic selection of the tuning parameter. A comprehensive performance evaluation is conducted, comparing the proposed EMLMLasso algorithm against two existing algorithms implemented in the R packages glmmLasso and splmm . In both simulated and real-world applications analyzed, our algorithm showed robustness and effectiveness in variable selection, including cases where the number of predictors <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mo stretchy="false">(</mml:mo> <mml:mi>p</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:math> is greater than the number of independent observations <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mo stretchy="false">(</mml:mo> <mml:mi>n</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:math> . In most evaluated scenarios, the EMLMLasso algorithm consistently outperformed both glmmLasso and splmm . The proposed method is quite general and simple to implement, allowing for extensions based on ridge and elastic net penalties in linear mixed-effects models.

Affiliated Institutions

Related Publications

Publication Info

Year
2025
Type
article
Pages
9622802251399913-9622802251399913
Citations
0
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

0
OpenAlex

Cite This

Daniela Carine Ramires de Oliveira, Fernanda L. Schumacher, Víctor H. Lachos (2025). The use of the EM algorithm for regularization problems in high-dimensional linear mixed-effects models. Statistical Methods in Medical Research , 9622802251399913-9622802251399913. https://doi.org/10.1177/09622802251399913

Identifiers

DOI
10.1177/09622802251399913