TL;DR
This paper introduces a stochastic approximation EM algorithm tailored for exploratory item factor analysis, enabling efficient estimation of parameters in high-dimensional test data with uncertainty quantification.
Contribution
It presents a novel SAEM-based Bayesian approach for EFA in IRT, incorporating eigenanalysis, Robbins-Monro convergence, and Tracy-Widom distribution for factor retention.
Findings
Effective in high-dimensional data
Accurate parameter estimation demonstrated in simulations
Applicable to real test data analysis
Abstract
The stochastic approximation EM algorithm (SAEM) is described for the estimation of item and person parameters given test data coded as dichotomous or ordinal variables. The method hinges upon the eigenanalysis of missing variables sampled as augmented data; the augmented data approach was introduced by Albert's seminal work applying Gibbs sampling to Item Response Theory in 1992. Similar to maximum likelihood factor analysis, the factor structure in this Bayesian approach depends only on sufficient statistics, which are computed from the missing latent data. A second feature of the SAEM algorithm is the use of the Robbins-Monro procedure for establishing convergence. Contrary to Expectation Maximization methods where costly integrals must be calculated, this method is well-suited for highly multidimensional data, and an annealing method is implemented to prevent convergence to a local…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
