A Note on Exploratory Item Factor Analysis by Singular Value Decomposition

07/19/2019
by   Haoran Zhang, et al.
0

In this note, we revisit a singular value decomposition (SVD) based algorithm that was given in Chen et al. (2019a) for obtaining an initial value for joint maximum likelihood estimation of exploratory Item Factor Analysis (IFA). This algorithm estimates a multidimensional item response theory model by SVD. Thanks to the computational efficiency and scalability of SVD, this algorithm has substantial computational advantage over other exploratory IFA algorithms, especially when the numbers of respondents, items, and latent dimensions are all large. Under the same double asymptotic setting and notion of consistency as in Chen et al. (2019a), we show that this simple algorithm provides a consistent estimator for the loading matrix up to a rotation. This result provides theoretical guarantee to the use of this simple algorithm for exploratory IFA.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/31/2020

A Consistency Theorem for Randomized Singular Value Decomposition

The singular value decomposition (SVD) and the principal component analy...
research
12/19/2017

Joint Maximum Likelihood Estimation for High-dimensional Exploratory Item Response Analysis

Multidimensional item response theory is widely used in education and ps...
research
07/20/2023

Analysis of the rSVDdpd Algorithm: A Robust Singular Value Decomposition Method using Density Power Divergence

The traditional method of computing singular value decomposition (SVD) o...
research
03/07/2022

Matrix Decomposition Perspective for Accuracy Assessment of Item Response Theory

The item response theory obtains the estimates and their confidence inte...
research
01/22/2020

A Deep Learning Algorithm for High-Dimensional Exploratory Item Factor Analysis

Deep learning methods are the gold standard for non-linear statistical m...
research
12/29/2019

Stochastic Approximation EM for Exploratory Item Factor Analysis

The stochastic approximation EM algorithm (SAEM) is described for the es...
research
07/12/2016

LazySVD: Even Faster SVD Decomposition Yet Without Agonizing Pain

We study k-SVD that is to obtain the first k singular vectors of a matri...

Please sign up or login with your details

Forgot password? Click here to reset