Exploratory M2PL Analysis with Adaptive Lasso Penalty
Source:R/E2PL_gvem_adaptlasso.R
E2PL_gvem_adaptlasso.Rd
Exploratory M2PL Analysis with Adaptive Lasso Penalty
Usage
E2PL_gvem_adaptlasso(
u,
indic,
max.iter = 5000,
constrain = "C1",
non_pen = NULL,
gamma = 2
)
Arguments
- u
an \(N \times J\)
matrix
or adata.frame
that consists of binary responses of \(N\) individuals to \(J\) items. The missing values are coded asNA
- indic
a \(J \times K\)
matrix
or adata.frame
that describes the factor loading structure of \(J\) items to \(K\) factors. It consists of binary values where 0 refers to the item is irrelevant to this factor, and 1 otherwise. For exploratory factor analysis with adaptive lasso penalty,indic
should include constraints on the a \(K \times K\) sub-matrix to ensure identifiability. The remaining parts do not assume any pre-specified zero structure but instead, the appropriate lasso penalty would recover the true zero structure. Also seeconstrain
- max.iter
the maximum number of iterations for the EM cycle; default is 5000
- constrain
the constraint setting:
"C1"
or"C2"
. To ensure identifiability,"C1"
sets a \(K \times K\) sub-matrix ofindic
to be an identity matrix.This constraint anchor \(K\) factors by designating \(K\) items that load solely on each factor respectively. Note that the \(K \times K\) matrix does not have to appear at the top of theindic
matrix."C2"
sets the \(K \times K\) sub-matrix to be a lower triangular matrix with the diagonal being ones. That is, there are test items associated with each factor for sure and they may be associated with other factors as well. Nonzero entries (in the lower triangular part) except for the diagonal entries of the sub-matrix are penalized during the estimation procedure. For instance, assume \(K=3\), then the"C2"
constraint will imply the following submatrix: \(C2=\begin{bmatrix} 1 & 0 & 0\\ 1 & 1 & 0\\ 1 & 1 & 1\\\end{bmatrix}\). As shown, item 1 is allowed to only load on the first factor, item 2 will for sure load on the second factor but it may also load on the first factor (hence a penalty is added on the \((2,1)\) element of"C2"
, i.e., \(C2_{2,1}\) ). Item 3 will for sure load on the third factor but it may also load on the first two factors. However, note that for all remaining items their loading vector will all be \((1, 1, 1)\) hence indistinguishable from the third anchor item. Therefore, we need to alert the algorithm that this third anchor item will for sure load on the third factor, and whether or not it loads on the first two factors depends on the regularization results. Therefore, we need to specify"non_pen="
to identify the \(K\)th anchor item. Although,"C2"
is much weaker than"C1"
, it still ensures empirical identifiability. Default is"C1"
. During estimation, under both the"C1"
and"C2"
constraints, the population means and variances are constrained to be 0 and 1, respectively.- non_pen
the index of an item that is associated with every factor under constraint
"C2"
. ForC1
, the input can beNULL
- gamma
a numerical value of adaptive lasso parameter. Zou (2006) recommended three values, 0.5, 1, and 2. The default value is 2.
Value
a list containing the following objects:
- ra
item discrimination parameters, a \(J \times K\)
matrix
- rb
item difficulty parameters, vector of length \(J\)
- reta
variational parameters \(\eta(\xi)\), a \(N \times J\) matrix
- reps
variational parameters \(\xi\), a \(N \times J\) matrix
- rsigma
population variance-covariance matrix, a \(K \times K\) matrix
- mu_i
mean parameter for each person, a \(K \times N\) matrix
- sig_i
covariance matrix for each person, a \(K \times K \times N\) array
- n
the number of iterations for the EM cycle
- Q_mat
factor loading structure, a \(J \times K\) matrix
- GIC
model fit index
- AIC
model fit index
- BIC
model fit index
- lbd
numerical value of lasso penalty parameter \(\lambda\)
References
Cho, A. E., Xiao, J., Wang, C., & Xu, G. (2022). Regularized Variational Estimation for Exploratory Item Factor Analysis. Psychometrika. https://doi.org/10.1007/s11336-022-09874-6
Zou, H. (2006). The adaptive LASSO and its oracle properties. Journal of the American Statistical Association, 7, 1011418–1429.
See also
E2PL_gvem_rot
, E2PL_gvem_lasso
, exampleIndic_efa2pl_c1
, exampleIndic_efa2pl_c2