Accelerating L1-penalized expectation maximization algorithm for latent variable selection in multidimensional two-parameter logistic models

PLoS One. 2023 Jan 17;18(1):e0279918. doi: 10.1371/journal.pone.0279918. eCollection 2023.

Abstract

One of the main concerns in multidimensional item response theory (MIRT) is to detect the relationship between observed items and latent traits, which is typically addressed by the exploratory analysis and factor rotation techniques. Recently, an EM-based L1-penalized log-likelihood method (EML1) is proposed as a vital alternative to factor rotation. Based on the observed test response data, EML1 can yield a sparse and interpretable estimate of the loading matrix. However, EML1 suffers from high computational burden. In this paper, we consider the coordinate descent algorithm to optimize a new weighted log-likelihood, and consequently propose an improved EML1 (IEML1) which is more than 30 times faster than EML1. The performance of IEML1 is evaluated through simulation studies and an application on a real data set related to the Eysenck Personality Questionnaire is used to demonstrate our methodologies.

Publication types

  • Research Support, Non-U.S. Gov't

MeSH terms

  • Algorithms
  • Computer Simulation
  • Logistic Models
  • Models, Statistical*
  • Motivation*

Grants and funding

The research of Ping-Feng Xu is supported by the Natural Science Foundation of Jilin Province in China (No. 20210101152JC) and the National Natural Science Foundation of China (No. 11571050). The research of Na Shan is supported by the National Natural Science Foundation of China (No. 11871013). The research of George To-Sum Ho is supported by the Research Grants Council of Hong Kong (No. UGC/FDS14/P05/20) and the Big Data Intelligence Centre in The Hang Seng University of Hong Kong. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.