Automated search algorithm for optimal generalized linear mixed models (GLMMs)

Miryeong Koo, Jinming Zhang


Abstract
Only a limited number of predictors can be included in a generalized linear mixed model (GLMM) due to estimation algorithm divergence. This study aims to propose a machine learning based algorithm (e.g., random forest) that can consider all predictors without the convergence issue and automatically searches for the optimal GLMMs.
Anthology ID:
2025.aimecon-main.38
Volume:
Proceedings of the Artificial Intelligence in Measurement and Education Conference (AIME-Con): Full Papers
Month:
October
Year:
2025
Address:
Wyndham Grand Pittsburgh, Downtown, Pittsburgh, Pennsylvania, United States
Editors:
Joshua Wilson, Christopher Ormerod, Magdalen Beiting Parrish
Venue:
AIME-Con
SIG:
Publisher:
National Council on Measurement in Education (NCME)
Note:
Pages:
352–358
Language:
URL:
https://aclanthology.org/2025.aimecon-main.38/
DOI:
Bibkey:
Cite (ACL):
Miryeong Koo and Jinming Zhang. 2025. Automated search algorithm for optimal generalized linear mixed models (GLMMs). In Proceedings of the Artificial Intelligence in Measurement and Education Conference (AIME-Con): Full Papers, pages 352–358, Wyndham Grand Pittsburgh, Downtown, Pittsburgh, Pennsylvania, United States. National Council on Measurement in Education (NCME).
Cite (Informal):
Automated search algorithm for optimal generalized linear mixed models (GLMMs) (Koo & Zhang, AIME-Con 2025)
Copy Citation:
PDF:
https://aclanthology.org/2025.aimecon-main.38.pdf