Sparse and Simple Structure Estimation via Prenet Penalization

Abstract

We propose a prenet (product-based elastic net), a novel penalization method for factor analysis models. The penalty is based on the product of a pair of elements in each row of the loading matrix. The prenet not only shrinks some of the factor loadings toward exactly zero but also enhances the simplicity of the loading matrix, which plays an important role in the interpretation of the common factors. In particular, with a large amount of prenet penalization, the estimated loading matrix possesses a perfect simple structure, which is known as a desirable structure in terms of the simplicity of the loading matrix. Furthermore, the perfect simple structure estimation via the proposed penalization turns out to be a generalization of the k-means clustering of variables. On the other hand, a mild amount of the penalization approximates a loading matrix estimated by the quartimin rotation, one of the most commonly used oblique rotation techniques. Simulation studies compare the performance of our proposed penalization with that of existing methods under a variety of settings. The usefulness of the perfect simple structure estimation via our proposed procedure is presented through various real data applications.

Supplementary Information

The online version contains supplementary material available at 10.1007/s11336-022-09868-4.

Factor analysis investigates the correlation structure of high-dimensional observed variables by the construction of a small number of latent variables called common factors. Factor analysis can be considered as a soft clustering of variables, in which each factor corresponds to a cluster and observed variables are categorized into overlapping clusters. For interpretation purposes, it is desirable for the observed variables to be well-clustered (Yamamoto and Jennrich, 2013) or the loading matrix to be simple (Thurstone, 1947). In particular, the perfect simple structure (e.g., Bernaards and Jennrich, 2003; Jennrich, 2004), wherein each row of the loading matrix has at most one nonzero element, provides a non-overlapping clustering of variables in the sense that variables that correspond to nonzero elements of the jth column of the loading matrix belong to the jth cluster.

Conventionally, the well-clustered or simple structure of the loading matrix is found by rotation techniques. A number of rotation techniques have been proposed in the literature; for example, quartimin rotation (Carroll, 1953), varimax rotation (Kaiser, 1958), promax rotation (Hendrickson and White, 1964), simplimax rotation (Kiers, 1994), geomin rotation (Yates, 1987), and component loss criterion (Jennrich, 2004, 2006). The literature review of the rotation techniques is described in Browne 2001. The main purpose of the factor rotation is to get a good solution that is as simple as possible. See, e.g., Thurstone (1935), Carroll (1953), Neuhaus and Wrigley (1954), Kaiser (1974), Bernaards and Jennrich (2003).

The problem with the rotation technique is that it cannot produce a sufficiently sparse solution in some cases (Hirose and Yamamoto, 2015), because the loading matrix must be found among a set of unpenalized maximum likelihood estimates. To obtain sparser solutions than the factor rotation, we employ a penalization method. It is shown that the penalization is a generalization of the rotation techniques and can produce sparser solutions than the rotation methods (Hirose and Yamamoto, 2015). Typically, many researchers use the $L_1$-type penalization, such as the lasso (Tibshirani, 1996), the adaptive lasso (Zou, 2006), and the minimax concave penalty (MCP) (Zhang, 2010); for example, Choi et al. (2011), Ning and Georgiou (2011), Srivastava et al. (2017), Hirose and Yamamoto (2015), Trendafilov et al. (2017), Hui et al. (2018). The $L_1$ penalization shrinks some of the parameters toward exactly zero; in other words, parameters that need not to be modeled are automatically disregarded. Furthermore, the degrees of sparsity are freely adjusted by changing the value of a regularization parameter. The $L_1$ penalization provides a good estimation accuracy, such as $L_1$ consistency and model selection consistency in high dimension (e.g., Zhao and Yu 2007; Wainwright, 2009; Bhlmann and van de Geer, 2011).

As described above, it is important to obtain a “good” loading matrix in the sense of simplicity and thus interpretability in the exploratory factor analysis. Although the $L_1$ penalization achieves the sparse estimation, the estimated loading matrix is not guaranteed to possess an interpretable structure. For example, a great amount of penalization leads to a zero matrix, which does not make sense from an interpretation viewpoint. Thus, the $L_1$ penalization cannot produce an interpretable loading matrix with a sufficient large regularization parameter. Even if a small value of regularization parameter is selected, the $L_1$ penalization cannot often approximate a true loading matrix when it is not sufficiently sparse; with the lasso, some of the factor loadings whose true values are close —but not very close—to zero are estimated as zero values, and this misspecification can often cause a significant negative effect on the estimation of other factor loadings (Hirose and Yamamoto, 2014). Therefore, it is important to estimate a loading matrix that is not only sparse but also interpretable. To achieve this, we need a different type of penalty.

In this study, we propose a prenet (product-based elastic net) penalty, which is based on the product of a pair of parameters in each row of the loading matrix. A remarkable feature of the prenet is that a large amount of penalization leads to the perfect simple structure. The existing $L_1$-type penalization methods do not have that significant property. Furthermore, the perfect simple structure estimation via the prenet penalty is shown to be a generalization of the k-means clustering of variables. On the other hand, with a mild amount of prenet penalization, the estimated loading matrix is approximated by that obtained using the quartimin rotation, a widely used oblique rotation method. The quartimin criterion can often estimate a non-sparse loading matrix appropriately, so that the problem of the lasso-type penalization mentioned above is addressed. We employ the generalized expectation and maximization (EM) algorithm and the coordinate descent algorithm (e.g., Friedman et al., 2010) to obtain the estimator. The proposed algorithm monotonically decreases the objective function at each iteration.

In our proposed procedure, the regularization parameter controls the degrees of simplicity; the larger the regularization parameter is, the simpler the loading matrix is. The advantage of our proposed procedure is that we can change the degrees of simplicity according to the purpose of the analysis. This study focus on two different purposes of the analysis: (i) to find a loading matrix that fits the data and also is simple as much as possible and (ii) to conduct cluster analysis by estimating a perfect simple structure. The regularization parameter selection procedure differs depending on these two purposes. To achieve the purpose (i), we select the regularization parameter by the Akaike information criterion (AIC; Akaike, 1973; Zou et al., 2007) or the Bayesian information criterion (BIC; Schwarz, 1978; Zou et al., 2007). The purpose (ii) is attained by setting the regularization parameter to be infinity.

We conduct the Monte Carlo simulations to compare the performance of our proposed method with that of $L_1$-type penalization and conventional rotation techniques. The Monte Carlo simulations investigate the performance in terms of both (i) and (ii); investigations of (i) and (ii) are detailed in Sects. 5.2 and 5.3, respectively. Our proposed method is applied to data from big five personality traits to study the performance for various sample sizes and impact of the regularization parameter on the accuracy. The analysis of big five personality traits aims at purpose (i). We also present the analyses of fMRI and electricity demand data, intended to purpose both (i) and (ii), in Section S2 of the supplemental material.

The rest of this article is organized as follows. Section 1 describes the estimation of the factor analysis model via penalization. In Sect. 2, we introduce the prenet penalty. Section 3 describes several properties of the prenet penalty, including its relationship with the quartimin criterion. Section 4 presents an estimation algorithm to obtain the prenet solutions. In Sect. 5, we conduct a Monte Carlo simulation to investigate the performance of the prenet penalization. Section 6 illustrates the usefulness of our proposed procedure through real data analysis. Extension and future works are discussed in Sect. 7. Some technical proofs and detail of our algorithm are shown in “Appendix.” Supplemental materials include further numerical and theoretical investigation, including numerical analyses of resting-state fMRI and electricity demand data.

Estimation of Factor Analysis Model via Penalization

Let $\mathit{X}={(X_1,\cdots ,X_p)}^T$ be a p-dimensional observed random vector with mean vector $\mathbf{0}$ and variance–covariance matrix $\mathbf{\Sigma }$. The factor analysis model is

$$\begin{array}{c}\hfill \mathit{X}=\mathbf{\Lambda }\mathit{F}+\mathit{\epsilon },\end{array}$$ 1

where $\mathbf{\Lambda }=({\lambda }_{\mathit{ij}})$ is a $p\times m$ loading matrix, $\mathit{F}={(F_1,\dots ,F_m)}^T$ is a random vector of common factors, and $\mathit{\epsilon }={({\epsilon }_1,\dots ,{\epsilon }_p)}^T$ is a random vector of unique factors. It is assumed that $E(\mathit{F})=\mathbf{0}$, $E(\mathit{\epsilon })=\mathbf{0}$, $E(\mathit{F}{\mathit{F}}^T)=\mathbf{\Phi }$, $E(\mathit{\epsilon }{\mathit{\epsilon }}^T)=\mathbf{\Psi }$, and $E(\mathit{F}{\mathit{\epsilon }}^T)=\mathit{O}$, where $\mathbf{\Phi }$ is an $m\times m$ factor correlation matrix, and $\mathbf{\Psi }$ is a $p\times p$ diagonal matrix (i.e., strict factor model). The diagonal elements of $\mathbf{\Psi }$ are referred to as unique variances. Under these assumptions, the variance–covariance matrix of observed random vector $\mathit{X}$ is $\mathbf{\Sigma }=\mathbf{\Lambda }\mathbf{\Phi }{\mathbf{\Lambda }}^T+\mathbf{\Psi }$.

In many cases, the orthogonal factor model (i.e., $\mathbf{\Phi }={\mathit{I}}_m$) is used but is often oversimplified. Here, ${\mathit{I}}_m$ is an identity matrix of order m. This paper covers the oblique factor model, which allows a more realistic estimation of latent factors than the orthogonal factor model in many cases (e.g., Fabrigar et al., 1999; Sass and Schmitt, 2010; Schmitt and Sass, 2011).

Let ${\mathit{x}}_1,\dots ,{\mathit{x}}_n$ be n observations and $\mathit{S}=(s_{\mathit{ij}})$ be the corresponding sample covariance matrix. Let $\mathit{\theta }={(\mathrm{vec}{(\mathbf{\Lambda })}^T,\mathrm{diag}{(\mathbf{\Psi })}^T,\mathrm{vech}{(\mathbf{\Phi })}^T)}^T$ be a parameter vector, where vech$(·)$ is a vector that consists of a lower triangular matrix without diagonal elements. We estimate the model parameter by minimizing the penalized loss function ${\ell }_{\rho }(\mathit{\theta })$ expressed as

$$\begin{array}{c}\hfill {\ell }_{\rho }(\mathit{\theta })=\ell (\mathit{\theta })+\rho P(\mathbf{\Lambda }),\end{array}$$ 2

where $\ell (\mathit{\theta })$ is a loss function, $P(\mathbf{\Lambda })$ is a penalty function, and $\rho >0$ is a regularization parameter. As a loss function, we adopt the maximum likelihood discrepancy function

$$\begin{array}{c}\hfill {\ell }_{\text{DF}}(\mathit{\theta })=\frac{1}{2}\left\{\mathrm{tr},({\mathbf{\Sigma }}^{-1}\mathit{S}),-,log,|{\mathbf{\Sigma }}^{-1}\mathit{S}|,-,p\right\},\end{array}$$ 3

where DF is an abbreviation for discrepancy function. Assume that the observations ${\mathit{x}}_1,\dots ,{\mathit{x}}_n$ are drawn from the p-dimensional normal population $N_p(\mathbf{0},\mathbf{\Sigma })$ with $\mathbf{\Sigma }=\mathbf{\Lambda }\mathbf{\Phi }{\mathbf{\Lambda }}^T+\mathbf{\Psi }$. The minimizer of ${\ell }_{\text{DF}}(\mathit{\theta })$ is the maximum likelihood estimate. It is shown that ${\ell }_{\text{DF}}(\mathit{\theta })\ge 0$ for any $\mathit{\theta }$, and ${\ell }_{\text{DF}}(\mathit{\theta })=0$ if and only if $\mathbf{\Lambda }\mathbf{\Phi }{\mathbf{\Lambda }}^T+\mathbf{\Psi }=\mathit{S}$ when $\mathbf{\Sigma }$ and $\mathit{S}$ are positive definite matrices. It is worth noting that our proposed penalty, described in Sect. 2, can be directly applied to many other loss functions, including a quadratic loss used for generalized least squares (Jöreskog and Goldberger, 1971).

When $\mathbf{\Phi }={\mathit{I}}_m$, the model has a rotational indeterminacy; both $\mathbf{\Lambda }$ and $\mathbf{\Lambda }\mathit{T}$ generate the same covariance matrix $\mathbf{\Sigma }$, where $\mathit{T}$ is an arbitrary orthogonal matrix. Thus, when $\rho =0$, the solution that minimizes (2) is not uniquely determined. However, when $\rho >0$, the solution may be uniquely determined except for the sign and permutation of columns of the loading matrix when an appropriate penalty $P(\mathbf{\Lambda })$ is chosen.

Prenet Penalty

Definition

We propose a prenet penalty

$$\begin{array}{c}\hfill P(\mathbf{\Lambda })=\sum _{i=1}^p\sum _{j=1}^{m-1}\sum _{k>j}\left\{\gamma |,{\lambda }_{\mathit{ij}},{\lambda }_{\mathit{ik}},|+,\frac{1}{2},(1-\gamma ),{({\lambda }_{\mathit{ij}}{\lambda }_{\mathit{ik}})}^2\right\},\end{array}$$ 4

where $\gamma \in (0,1]$ is a tuning parameter. The most significant feature of the prenet penalty is that it is based on the product of a pair of parameters.

When $\gamma \to 0$, the prenet penalty is equivalent to the quartimin criterion (Carroll, 1953), a widely used oblique rotation criterion in factor rotation. As is the case with the quartimin rotation, the prenet penalty in (4) eliminates the rotational indeterminacy except for the sign and permutation of columns of the loading matrix and contributes significantly to the estimation of the simplicity of the loading matrix. The prenet penalty includes products of absolute values of factor loadings, producing factor loadings that are exactly zero.

Comparison with the Elastic Net Penalty

The prenet penalty is similar to the elastic net penalty (Zou and Hastie, 2005)

$$\begin{array}{c}\hfill P(\mathbf{\Lambda })=\sum _{i=1}^p\sum _{j=1}^m\left\{\gamma |,{\lambda }_{\mathit{ij}},|+,\frac{1}{2},(1-\gamma ),{\lambda }_{\mathit{ij}}^2\right\},\end{array}$$ 5

which is a hybrid of the lasso and the ridge penalties. Although the elastic net penalty is similar to the prenet penalty, there is a fundamental difference between these two penalties; the elastic net is constructed by the sum of the elements of parameter vector, whereas the prenet is based on the product of a pair of parameters.

Figure 1 shows the penalty functions of the prenet ($P(x,y)=\gamma |xy|+(1-\gamma ){(xy)}^2/2$) and the elastic net ($P(x,y)=\gamma (|x|+|y|)+(1-\gamma )(x^2+y^2)/2$) when $\gamma =0.1$, 0.5, 0.9. Clearly, the prenet penalty is a nonconvex function. A significant difference between the prenet and the elastic net is that although the prenet penalty becomes zero when either x or y attains zero, the elastic net penalty becomes zero only when both $x=0$ and $y=0$. Therefore, for a two-factor model, the estimate of either ${\lambda }_{i1}$ or ${\lambda }_{i2}$ can be zero with the prenet penalization, leading to a perfect simple structure. On the other hand, the elastic net tends to produce estimates in which both $|{\lambda }_{i1}|$ and $|{\lambda }_{i2}|$ are small.

Fig. 1.

Penalty functions of the prenet and the elastic net with various $\gamma$.

The penalty functions in Fig. 1 also show that the prenet penalty becomes smooth as $\gamma$ decreases. Thus, the value of $\gamma$ controls the degrees of sparsity; the larger the value of $\gamma$, the sparser the estimate of the loading matrix. With an appropriate value of $\gamma$, the prenet penalty enhances both simplicity and sparsity of the loading matrix. Further investigation into the estimator against the value of $\gamma$ is presented in Sect. 5.

Properties of the Prenet Penalty

Perfect Simple Structure

The model (1) does not impose an orthogonal constraint on the loading matrix $\mathbf{\Lambda }$. For unconstrained $\mathbf{\Lambda }$, most existing penalties, such as the lasso, shrink all coefficients toward zero when the tuning parameter $\rho$ is sufficiently large; we usually obtain $\widehat{\mathbf{\Lambda }}=\mathit{O}$ when $\rho \to \infty$. However, the following proposition shows that the prenet penalty does not necessarily shrink all of the elements toward zero even when $\rho$ is sufficiently large.

Proposition 1

Assume that we use the prenet penalty with $\gamma \in (0,1]$. As $\rho \to \infty$, the estimated loading matrix possesses the perfect simple structure, that is, each row has at most one nonzero element.

Proof

As $\rho \to \infty$, $P(\widehat{\mathbf{\Lambda }})$ must satisfy $P(\widehat{\mathbf{\Lambda }})\to 0$. Otherwise, the second term of (2) diverges. When $P(\widehat{\mathbf{\Lambda }})=0$, ${\widehat{\lambda }}_{\mathit{ij}}{\widehat{\lambda }}_{\mathit{ik}}=0$ for any $j\ne k$. Therefore, the ith row of $\mathbf{\Lambda }$ has at most one nonzero element. $\square$

The perfect simple structure is known as a desirable property in the literature in factor analysis because it is easy to interpret the estimated loading matrix (e.g., Bernaards and Jennrich, 2003). When $\rho$ is small, the estimated loading matrix can be away from the perfect simple structure but the goodness of fit to the model is improved.

Remark 1

For $\rho \to \infty$, the consistency of the loading matrix is shown when the true loading matrix possesses the perfect simple structure. For simplicity, we consider the orthogonal case. Assume that $\mathbf{\Sigma }=\mathbf{\Lambda }{\mathbf{\Lambda }}^T+\mathbf{\Psi }$, where the true $\mathbf{\Lambda }$ possesses the perfect simple structure. As $n\to \infty$, the sample covariance matrix converges to the true covariance matrix almost surely; thus, the loss function (3) is minimized when $\mathbf{\Sigma }=\widehat{\mathbf{\Lambda }}{\widehat{\mathbf{\Lambda }}}^T+\widehat{\mathbf{\Psi }}$. When $\rho \to \infty$, $\widehat{\mathbf{\Lambda }}$ must be the perfect simple structure. Therefore, we should consider the following problem:

$$\begin{array}{c}\hfill \text{Find}(\widehat{\mathbf{\Lambda }},\widehat{\mathbf{\Psi }})\text{that}\text{satisfies}\left\{\begin{array}{c}\mathbf{\Sigma }=\widehat{\mathbf{\Lambda }}{\widehat{\mathbf{\Lambda }}}^T+\widehat{\mathbf{\Psi }},\hfill \\ \widehat{\mathbf{\Lambda }}\text{is}\text{perfect}\text{simple}\text{structure.}\hfill \end{array}\right)\end{array}$$

The solution to the above problem is $\widehat{\mathbf{\Lambda }}=\mathbf{\Lambda }$ except for the sign and permutation of columns of the loading matrix if an identifiability condition for an orthogonal model (e.g., Theorem 5.1 in Anderson and Rubin, 1956) is satisfied.

Relationship with k-Means Clustering of Variables

The perfect simple structure corresponds to variables clustering, that is, variables that correspond to nonzero elements of the jth column of the loading matrix belong to the jth cluster. In this subsection, we investigate the relationship between the prenet with $\rho \to \infty$ and the k-means clustering of variables, one of the most popular cluster analyses.

Let ${\mathit{X}}_0$ be an $n\times p$ data matrix. ${\mathit{X}}_0$ can be expressed as ${\mathit{X}}_0=({\mathit{x}}_1^{\ast },\cdots ,{\mathit{x}}_p^{\ast })$, where ${\mathit{x}}_i^{\ast }$ is the ith column vector of ${\mathit{X}}_0$. We consider the problem of the variables clustering of ${\mathit{x}}_1^{\ast },\cdots ,{\mathit{x}}_p^{\ast }$ by the k-means. Let $C_j$ $(j=1,\cdots ,m)$ be a subset of indices of variables that belong to the jth cluster. The objective function of the k-means is

$$\begin{array}{c}\hfill \sum _{j=1}^m\sum _{i\in C_j}{\Vert {\mathit{x}}_i^{\ast }-{\mathit{\mu }}_j\Vert }^2=(n-1)\left(\sum _{i=1}^p,s_{\mathit{ii}},-,\sum _{j=1}^m,\frac{1}{p_j},\sum _{i\in C_j},\sum _{i^{\prime }\in C_j},s_{i{i}^{\prime }}\right),\end{array}$$ 6

where $p_j=\#\{C_j\}$, ${\mathit{\mu }}_j=\frac{1}{p_j}{\sum }_{i\in C_j}{\mathit{x}}_i^{\ast }$, and recall that $s_{i{i}^{\prime }}={\mathit{x}}_i^{\ast T}{\mathit{x}}_{i^{\prime }}^{\ast }/(n-1)$. Let $\mathbf{\Lambda }=({\lambda }_{\mathit{ij}})$ be a $p\times m$ indicator variables matrix

$$\begin{array}{c}\hfill {\lambda }_{\mathit{ij}}=\left\{\begin{array}{cc}1/\sqrt{p_j}\hfill & i\in C_j,\hfill \\ 0\hfill & i\notin C_j.\hfill \end{array}\right)\end{array}$$ 7

Using the fact that ${\mathbf{\Lambda }}^T\mathbf{\Lambda }={\mathit{I}}_m$, the k-means clustering of variables using (6) is equivalent to (Ding et al., 2005)

$$\begin{array}{c}\hfill \underset{\mathbf{\Lambda }}{min}{\Vert \mathit{S}-\mathbf{\Lambda }{\mathbf{\Lambda }}^T\Vert }_F^2,\text{subject}\text{to}(7),\end{array}$$ 8

where ${\Vert ·\Vert }_F$ denotes the Frobenius norm. We consider slightly modifying the condition on $\mathbf{\Lambda }$ in (7) to

$$\begin{array}{c}\hfill {\lambda }_{\mathit{ij}}{\lambda }_{\mathit{ik}}=0(j\ne k)\text{and}{\mathbf{\Lambda }}^T\mathbf{\Lambda }={\mathit{I}}_m.\end{array}$$ 9

The modified k-means problem is then given as

$$\begin{array}{c}\hfill \underset{\mathbf{\Lambda }}{min}{\Vert \mathit{S}-\mathbf{\Lambda }{\mathbf{\Lambda }}^T\Vert }_F^2\text{subject}\text{to}(9).\end{array}$$ 10

The condition (9) is milder than (7); if $\mathbf{\Lambda }$ satisfies (7), we obtain (9). The reverse does not always hold; with (9), the nonzero elements for each column do not have to be equal. Therefore, the modified k-means in (10) may capture a more complex structure than the original k-means.

Proposition 2

Assume that $\mathbf{\Psi }=\alpha {\mathit{I}}_p$, $\mathbf{\Phi }={\mathit{I}}_m$, and $\alpha$ is given. Suppose that $\mathbf{\Lambda }$ satisfies ${\mathbf{\Lambda }}^T\mathbf{\Lambda }={\mathit{I}}_m$. The prenet solution with $\rho \to \infty$ is then obtained by (10).

Proof

The proof appears in Appendix A.1. $\square$

The proposition 2 shows that the prenet solution with $\rho \to \infty$ is a generalization of the problem (10). As mentioned above, the problem (10) is a generalization of the k-means problem in (8). Therefore, the perfect simple structure estimation via the prenet is a generalization of the k-means clustering of variables. We remark that the condition $\mathbf{\Psi }=\alpha {\mathit{I}}_p$ in Proposition 2 implies the probabilistic principal component analysis (probabilistic PCA; Tipping and Bishop, 1999); the penalized probabilistic PCA via the prenet is also a generalization of the k-means clustering of variables.

Relationship with Quartimin Rotation

As described in Sect. 2, the prenet penalty is a generalization of the quartimin criterion (Carroll, 1953); setting $\gamma \to 0$ to the prenet penalty in (4) leads to the quartimin criterion

$$\begin{array}{c}\hfill P_{\mathrm{qmin}}(\mathbf{\Lambda })=\sum _{i=1}^p\sum _{j=1}^{m-1}\sum _{k>j}{({\lambda }_{\mathit{ij}}{\lambda }_{\mathit{ik}})}^2.\end{array}$$

The quartimin criterion is typically used in the factor rotation. The solution of quartimin rotation method, say ${\widehat{\mathit{\theta }}}_q$, is obtained by two-step procedure. First, we calculate an unpenalized estimate, denoted by $\widehat{\mathit{\theta }}$. The estimate $\widehat{\mathit{\theta }}$, that satisfies ${\displaystyle \ell (\widehat{\mathit{\theta }})=\underset{\mathit{\theta }}{min}\ell (\mathit{\theta })}$, is not unique due to the rotational indeterminacy. The second step is the minimization of the quartimin criterion with a restricted parameter space $\{\mathit{\theta }|\ell (\mathit{\theta })={min}_{\mathit{\theta }}\ell (\mathit{\theta })\}$. Hirose and Yamamoto (2015) showed that the solution of the quartimin rotation, ${\widehat{\mathit{\theta }}}_q$, can be obtained by

$$\begin{array}{c}\hfill \underset{\mathit{\theta }}{min}{P}_{\mathrm{qmin}}(\mathbf{\Lambda }),\text{subject}\text{to}\ell (\mathit{\theta })=\ell (\widehat{\mathit{\theta }})\end{array}$$ 11

under the condition that the unpenalized estimate of loading matrix $\widehat{\mathbf{\Lambda }}$ is unique if the indeterminacy of the rotation in $\widehat{\mathbf{\Lambda }}$ is excluded. It is not easy to check this condition, but several necessary conditions of the identifiability for the orthogonal model are provided (e.g., Theorem 5.1 in Anderson and Rubin, 1956.)

Now, we show a basic asymptotic result of the prenet solution, from which we can see that the prenet solution is a generalization of the quartimin rotation. Let $(\mathrm{\Theta },d)$ be a compact parameter space with distance d and $(\mathrm{\Omega },\mathcal{F},\mathbb{P})$ be a probability space. Suppose that for any ${(\mathrm{vec}{(\mathbf{\Lambda })}^T,\mathrm{diag}{(\mathbf{\Psi })}^T,\mathrm{vech}{(\mathbf{\Phi })}^T)}^T\in \mathrm{\Theta }$ and any $\mathit{T}\in \mathcal{O}(m)$, we have ${(\mathrm{vec}{(\mathbf{\Lambda }\mathit{T})}^T,\mathrm{diag}{(\mathbf{\Psi })}^T,\mathrm{vech}{(\mathbf{\Phi })}^T)}^T\in \mathrm{\Theta }$, where $\mathcal{O}(m)$ is a set of $m\times m$ orthonormal matrices. Let ${\mathit{X}}_1,\cdots ,{\mathit{X}}_n$ denote independent ${\mathbb{R}}^p$-valued random variables with the common population distribution $\mathbb{P}$. Now, it is required that we can rewrite the empirical loss function and the true loss function as $\ell (\mathit{\theta })={\sum }_{i=1}^{n}q({\mathit{X}}_i;\mathit{\theta })/n$ and ${\ell }_{\ast }(\mathit{\theta })=\int q(\mathit{x};\mathit{\theta })\mathbb{P}(d\mathit{x})$, respectively. Let ${\widehat{\mathit{\theta }}}_{\rho }$ denote an arbitrary measurable prenet estimator which satisfies $\ell ({\widehat{\mathit{\theta }}}_{\rho })+\rho P({\widehat{\mathbf{\Lambda }}}_{\rho })={min}_{\mathit{\theta }\in \mathrm{\Theta }}\ell (\mathit{\theta })+\rho P(\mathbf{\Lambda })$.

Condition 3.1

$q(\mathit{x};\mathit{\theta })$ fulfills the following conditions:

• For each $\mathit{x}\in {\mathbb{R}}^p$, function $q(\mathit{x};\mathit{\theta })$ on $\mathrm{\Theta }$ is continuous.

• There exists a $\mathbb{P}$-integrable function $g(\mathit{x})$ such that for all $\mathit{x}\in {\mathbb{R}}^p$ and for all $\mathit{\theta }\in \mathrm{\Theta }$ $|q(\mathit{x};\mathit{\theta })|\le g(\mathit{x})$.

Since $\ell (\mathit{\theta })$ is the discrepancy function in Eq. (3), $q(\mathit{x};\mathit{\theta })$ becomes a logarithm of density function of normal distribution; in this case, Condition 3.1 is satisfied. The following proposition shows that the prenet estimator converges almost surely to a true parameter which minimizes the quartimin criterion when $\rho \to 0$ as $n\to \infty$.

Proposition 3

Assume that Condition 3.1 is satisfied. We denote by ${\mathrm{\Theta }}_q^{\ast }$ a set of true solutions of the following quartimin problem.

$$\begin{array}{c}\hfill \underset{\mathit{\theta }\in \mathrm{\Theta }}{min}{P}_{\mathrm{qmin}}(\mathbf{\Lambda })\text{subject to}{\ell }_{\ast }(\mathit{\theta })=\underset{\mathit{\theta }\in \mathrm{\Theta }}{min}{\ell }_{\ast }(\mathit{\theta }).\end{array}$$

Let ${\rho }_n$ ($n=1,2,\cdots$) be a sequence that satisfies ${\rho }_n>0$ and ${lim}_{n\to \infty }{\rho }_n=0$. Let the prenet solution with $\gamma \to 0$ and $\rho ={\rho }_n$ be ${\widehat{\mathit{\theta }}}_{{\rho }_n}$. Then we obtain

$$\begin{array}{c}\hfill \underset{n\to \infty }{lim}d({\widehat{\mathit{\theta }}}_{{\rho }_n},{\mathrm{\Theta }}_q^{\ast })=0a.s.,\end{array}$$

where $d(a,B)={inf}_{b\in B}d(a,b)$.

Proof

The proof is given in Appendix A.2. $\square$

Remark 3.1

Proposition 3 uses a set of true solutions ${\mathrm{\Theta }}_q^{\ast }$ instead of one true solution ${\mathit{\theta }}_q^{\ast }$. This is because even if the quartimin solution does not have a rotational indeterminacy, it still has an indeterminacy with respect to sign and permutation of columns of the loading matrix.

Remark 3.2

The Geomin criterion (Yates, 1987) often produces a loading matrix similar to that obtained by the Quartimin criterion (Asparouhov and Muthén 2009). For the Geomin criterion, we add a small number to the loadings to address the identifiability problem (Hattori et al., 2017). Meanwhile, the prenet does not suffer from such a problem. The detailed discussion is described in Section S3 in the supplemental material.

Algorithm

It is well known that the solutions estimated by the lasso-type penalization methods are not usually expressed in a closed form because the penalty term includes an indifferentiable function. As the objective function of the prenet is nonconvex, it is not easy to construct an efficient algorithm to obtain a global minimum. Here, we use the generalized EM algorithm, in which the latent factors are considered to be missing values. The complete-data log-likelihood function is increased with the use of the coordinate descent algorithm (Friedman et al., 2010), which is commonly used in the lasso-type penalization. Although our proposed algorithm is not guaranteed to attain the global minimum, our algorithm decreases the objective function at each step. The update equation of the algorithm and its complexity are presented in Appendix B.

Efficient Algorithm for Sufficiently Large $\rho$

The prenet tends to be multimodal for large $\rho$ as is the case with the k-means algorithm. Therefore, we prepare many initial values, estimate the solutions for each initial value, and select a solution that minimizes the penalized loss function. In this case, it seems that we require heavy computational loads. However, we can construct an efficient algorithm for a sufficiently large $\rho$.

For sufficiently large $\rho$, the ith column of loading matrix $\mathbf{\Lambda }$ has at most one nonzero element, denoted by ${\lambda }_{\mathit{ij}}$. With the EM algorithm, we can easily find the location of the nonzero parameter when the current value of the parameter is given. Assume that the (i, j)th element of the loading matrix is nonzero and the (i, k)th elements ($k\ne j$) are zero. Because the penalty function attains zero for sufficiently large $\rho$, it is sufficient to minimize the following function.

$$\begin{array}{c}\hfill f({\lambda }_{\mathit{ij}})={\mathit{\lambda }}_i^T\mathit{A}{\mathit{\lambda }}_i-2{\mathit{\lambda }}_i^T{\mathit{b}}_i=a_{\mathit{jj}}{\lambda }_{\mathit{ij}}^2-2{\lambda }_{\mathit{ij}}{b}_{\mathit{ij}}.\end{array}$$ 12

The minimizer is easily obtained by

$$\begin{array}{c}\hfill {\widehat{\lambda }}_{\mathit{ij}}=b_{\mathit{ij}}/a_{\mathit{jj}}.\end{array}$$ 13

Substituting (13) into (12) gives us $f({\widehat{\lambda }}_{\mathit{ij}})=-\frac{b_{\mathit{ij}}^2}{a_{\mathit{jj}}}$. Therefore, the index j that minimizes the function $f({\lambda }_{\mathit{ij}})$ is

$$\begin{array}{c}\hfill j={\mathrm{argmax}}_k\frac{b_{\mathit{ik}}^2}{a_{\mathit{kk}}},\end{array}$$

and ${\lambda }_i$ is updated as ${\widehat{\lambda }}_{\mathit{ij}}=b_{\mathit{ij}}/a_{\mathit{jj}}$ and ${\widehat{\lambda }}_{\mathit{ik}}=0$ for any k $\ne$ j.

Selection of the Maximum Value of $\rho$

The value of ${\rho }_{max}$, which is the minimum value of $\rho$ that produces the perfect simple structure, is easily obtained using $\widehat{\mathbf{\Lambda }}$ given by (13). Assume that ${\widehat{\lambda }}_{\mathit{ij}}\ne 0$ and ${\widehat{\lambda }}_{\mathit{ik}}=0$ ($k\ne j$). Using the update equation of ${\lambda }_{\mathit{ik}}$ in (A.10) and the soft thresholding function in (A.12) of Appendix A, we show that the regularization parameter $\rho$ must satisfy the following inequality to ensure that ${\lambda }_{\mathit{ik}}$ is estimated to be zero.

$$\begin{array}{c}\hfill \left|\frac{b_{\mathit{ik}}-a_{\mathit{kj}}{\widehat{\lambda }}_{\mathit{ij}}}{a_{\mathit{kk}}+\rho {\psi }_i(1-\gamma ){\widehat{\lambda }}_{\mathit{ij}}^2}\right|\le \frac{{\psi }_i}{a_{\mathit{kk}}+\rho {\psi }_i(1-\gamma ){\widehat{\lambda }}_{\mathit{ij}}^2}\rho \gamma |{\widehat{\lambda }}_{\mathit{ij}}|.\end{array}$$

Thus, the value of ${\rho }_{max}$ is

$$\begin{array}{c}\hfill {\rho }_{max}=\underset{i}{max}\underset{k\in C_i}{max}\frac{|b_{\mathit{ik}}-a_{\mathit{kj}}{\widehat{\lambda }}_{\mathit{ij}}|}{\gamma {\psi }_i|{\widehat{\lambda }}_{\mathit{ij}}|},\end{array}$$

where $C_i=\{k|k\ne j,{\widehat{\lambda }}_{\mathit{ij}}\ne 0\}$.

Estimation of the Entire Path of Solutions

The entire path of solutions can be produced with the grid of increasing values $\{{\rho }_1,\cdots ,{\rho }_K\}$. Here, ${\rho }_K$ is (5.2), and ${\rho }_1={\rho }_K\mathrm{\Delta }\sqrt{\gamma }$, where $\mathrm{\Delta }$ is a small value such as 0.001. The term $\sqrt{\gamma }$ allows us to estimate a variety of models even if $\gamma$ is small.

The entire solution path can be made using a decreasing sequence $\{{\rho }_K\cdots ,{\rho }_1\}$, starting with ${\rho }_K$. The proposed algorithm at ${\rho }_K$ does not always converge to the global minimum, so that we prepare many initial values, estimate solutions for each initial value with the use of the efficient algorithm described in Sect. 4.1, and select a solution that minimizes the penalized log-likelihood function. We can use the warm start defined as follows: the solution at ${\rho }_{k-1}$ is computed using the solution at ${\rho }_k$. The warm start leads to improved and smoother objective value surfaces (Mazumder et al., 2011).

One may use the warm start with increasing $\rho$; that is, the solution with $\rho =0$ is obtained by the rotation technique with MLE, and then we gradually increase $\rho$, using the solution from the previous step. However, the decreasing sequence of $\rho$ has a significant advantage over the increasing sequence; the decreasing sequence allows the application to the $n<p$ case. With an increasing order, the solution with $\rho =0$ (MLE) is not available, and then the entire solution cannot be produced. Therefore, we adopt the warm start with decreasing sequence of $\rho$ instead of an increasing sequence.

Another method to estimate the entire solution is to use the cold start with multiple random starts. Although the cold start does not always produce a smooth estimate as a function of $\rho$, it can sometimes find a better solution than the warm start when the loss function has multiple local minima. However, the cold start often requires heavier computational loads than the warm start.

When $\rho$ is extremely small, the loss function becomes nearly flat due to rotational indeterminacy. However, in our experience, our proposed algorithm generally produces a smooth and stable estimate when the warm start is adopted. Even when the cold start is used, the estimate can often be stable for large sample sizes when $\rho$ is not extremely but sufficiently small, such as $\rho ={10}^{-4}$. However, when $n<p$, the maximum likelihood estimate cannot be obtained; therefore, the cold start often produces an unstable estimate with small $\rho$.

Selection of the Regularization Parameter $\rho$

The estimate of the loading matrix depends on the regularization parameter $\rho$. As described in the Introduction, this study focus on two different purposes of the analysis: (i) exploratory factor analysis and (ii) clustering of variables. When the purpose of the analysis is (ii), we simply set $\rho \to \infty$ to achieve the perfect simple structure estimation. When the purpose of the analysis is (i), $\rho$ is selected by the AIC or the BIC (Zou et al., 2007);

$$\begin{array}{cc}\hfill \text{AIC}=& -2n\ell (\widehat{\mathit{\theta }})+2p_0,\hfill \\ \hfill \text{BIC}=& -2n\ell (\widehat{\mathit{\theta }})+p_{0}logn,\hfill \end{array}$$

where $p_0$ is the number of nonzero parameters.

Our algorithm sometimes produces a loading matrix some of whose columns are zero vectors. In this case, the number of factors may be smaller than expected. The selection of the number of factors via the regularization is achieved by taking advantage of the zero column vectors estimation (Caner and Han, 2014; Hirose and Yamamoto, 2015).

Monte Carlo Simulations

The performance of our proposed method is investigated through Monte Carlo simulations. The prenet penalization has two different purposes of analysis: clustering of variables and exploratory factor analysis. In this section, we investigate the performance in terms of both purposes. The comparison of various exploratory factor analysis methods is described in Sect. 5.2, and the investigation of clustering of variables is presented in Sect. 5.3.

Simulation Models

In this simulation study, we use three simulation models as below.

Model (A):

$$\begin{array}{cc}\hfill \mathbf{\Lambda }=& \left(\begin{array}{cccc}\hfill 0.8& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0.7& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0.6& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 0.5\end{array}\right)\otimes {\mathbf{1}}_{25},\hfill \end{array}$$

where ${\mathbf{1}}_{25}$ is a 25-dimensional vector with each element being 1.

Model (B):

The size of the loading matrix of Model (B) is the same as that of Model (A), and the nonzero factor loadings share the same values. However, all zero elements in Model (A) are replaced by small random numbers from $U(-0.3,0.3)$.

Model (C):

$$\begin{array}{cc}\hfill \mathbf{\Lambda }=& {({\mathbf{\Lambda }}_1^T,{\mathbf{\Lambda }}_2^T)}^T,\hfill \\ \hfill {\mathbf{\Lambda }}_1=& {\left(\begin{array}{ccccccccccccc}\hfill 0.79& \hfill 0.00& \hfill 0.00& \hfill 0.49& \hfill 0.50& \hfill 0.00& \hfill 0.68& \hfill 0.29& \hfill 0.66& \hfill 0.33& \hfill 0.00& \hfill 0.00& \hfill 0.62\\ \hfill 0.00& \hfill 0.77& \hfill 0.00& \hfill 0.53& \hfill 0.00& \hfill 0.50& \hfill 0.32& \hfill 0.66& \hfill 0.00& \hfill 0.00& \hfill 0.62& \hfill 0.34& \hfill -0.64\\ \hfill 0.00& \hfill 0.00& \hfill 0.76& \hfill 0.00& \hfill 0.52& \hfill 0.48& \hfill 0.00& \hfill 0.00& \hfill 0.34& \hfill 0.66& \hfill 0.33& \hfill 0.62& \hfill 0.00\end{array}\right)}^T,\hfill \\ \hfill {\mathbf{\Lambda }}_2=& {\left(\begin{array}{ccccccccccccc}\hfill -0.62& \hfill 0.62& \hfill -0.62& \hfill 0.00& \hfill 0.00& \hfill 0.43& \hfill 0.47& \hfill 0.00& \hfill 0.42& \hfill 0.43& \hfill 0.00& \hfill 0.36& \hfill 0.26\\ \hfill 0.64& \hfill 0.00& \hfill 0.00& \hfill 0.67& \hfill -0.67& \hfill 0.58& \hfill 0.00& \hfill 0.50& \hfill 0.57& \hfill 0.00& \hfill 0.50& \hfill 0.38& \hfill 0.43\\ \hfill 0.00& \hfill -0.61& \hfill 0.61& \hfill -0.63& \hfill 0.63& \hfill 0.00& \hfill 0.57& \hfill 0.48& \hfill 0.00& \hfill 0.57& \hfill 0.46& \hfill 0.38& \hfill 0.38\end{array}\right)}^T.\hfill \end{array}$$

The simulation is conducted for both orthogonal and oblique models on (A) and an orthogonal model on (B) – (C). For Model (A), we write the orthogonal and oblique models as “Model (A-ORT)” and “Model (A-OBL),” respectively. Here, “ORT” and “OBL” are abbreviations for “orthogonal” and “oblique,” respectively. The factor correlations for the oblique model are set to be 0.4. The unique variances are calculated by $\mathbf{\Psi }=\mathrm{diag}({\mathit{I}}_p-\mathbf{\Lambda }\mathbf{\Phi }{\mathbf{\Lambda }}^T)$.

In Model (A), the loading matrix possesses the perfect simple structure. In such cases, the prenet is expected to perform well because it is able to estimate the perfect simple structure for large $\rho$ (Proposition 1). Note that $p=100$ on Model (A); therefore, maximum likelihood estimate cannot be available when $n<100$.

The loading matrix of Model (B) is close to but not exactly a perfect simple structure. In this case, the prenet is expected to perform well when both $\rho$ and $\gamma$ are close to zero, thanks to Proposition 3. Meanwhile, the lasso would not perform well; a small illustrative example with intuitive description is presented in Section S1 in supplemental material.

In Model (C), the loading matrix is sparse but more complex than the perfect simple structure. The loading matrix is a rotated centroid solution of the Thurstone’s box problem, reported in Thurstone (1947). We use data(ThurstoneBox26) in the fungible package in R to obtain the loading matrix. With the original loading matrix, some of the unique variances can be larger than 1 with $\mathbf{\Psi }=\mathrm{diag}({\mathit{I}}_p-\mathbf{\Lambda }{\mathbf{\Lambda }}^T)$; therefore, the elements of the original loading matrix are multiplied by 0.83. Furthermore, to enhance the sparsity, factor loadings whose absolute values are less than 0.1 are replaced by 0.

Accuracy Investigation

The model parameter is estimated by the prenet penalty with $\gamma =1.0$, 0.1, 0.01, the lasso, the MCP (Zhang, 2010)

$$\begin{array}{cc}\hfill \rho P(\mathbf{\Lambda };\rho ;\gamma )=& \sum _{i=1}^p\sum _{j=1}^m\rho {\int }_0^{|{\lambda }_{\mathit{ij}}|}{\left(1,-,\frac{x}{\rho \gamma }\right)}_{+}dx\hfill \end{array}$$

with $\gamma =3$, and the elastic net with $\gamma =0.1$. The regularization parameter $\rho$ is selected by the AIC and the BIC. We also compute a limit, ${\displaystyle \underset{\rho \to +0}{lim}{\widehat{\mathrm{\Lambda }}}_{\rho }}$, where ${\widehat{\mathrm{\Lambda }}}_{\rho }$ is the estimate of the loading matrix obtained with a regularization parameter $\rho$. We note that ${\displaystyle \underset{\rho \to +0}{lim}{\widehat{\mathrm{\Lambda }}}_{\rho }}$ corresponds to the factor rotation with MLE (Hirose and Yamamoto, 2015). In particular, the estimate with $\rho \to +0$ and $\gamma \to +0$ is equivalent to that obtained by the quartimin rotation with MLE, thanks to Proposition 3. We also conduct rotation techniques with MLE: varimax rotation (Kaiser, 1958) for the orthogonal model and promax rotation (Hendrickson and White, 1964) for the oblique model. When MLE cannot be found due to $n<p$, we conduct the lasso and obtain the approximation of the MLE with $\rho \to +0$.

The warm start is used for Models (A) and (B). The dimension of these models is $p=100$, and then the warm start is stabler than the cold start for small $\rho$ in our experience. Meanwhile, we adopt the cold start on Model (C) because Thurstone’s box problem tends to possess multiple local minima.

In our implementation, the estimate of the elastic net sometimes diverges for the oblique model. Scharf and Nestler (2019a) reported the same phenomenon. To address this issue, we add a penalty $\zeta log|\mathbf{\Phi }|$ to Eq. (2) with $\zeta =0.01$. This penalty is based on Lee (1981), a conjugate prior for Wishart distribution from a Bayesian viewpoint. We remark that the prenet does not tend to suffer from this divergence issue even if $\zeta =0$ in our experience. This is probably because the prenet does not shrink all loadings to zero, thanks to Proposition 1. For example, assume that ${\widehat{\sigma }}_{\mathit{ij}}={\widehat{\lambda }}_{\mathit{im}}{\widehat{\lambda }}_{\mathit{jk}}{\widehat{\varphi }}_{\mathit{km}}$ ($k\ne m$). When the elastic net penalization is adopted, both ${\widehat{\lambda }}_{\mathit{im}}$ and ${\widehat{\lambda }}_{\mathit{jk}}$ are close to zero with a large $\rho$. When $s_{\mathit{ij}}$ is large, ${\widehat{\varphi }}_{\mathit{km}}$ must be large to get ${\sigma }_{\mathit{ij}}\approx s_{\mathit{ij}}$. Accordingly, the value of ${\widehat{\varphi }}_{\mathit{km}}$ can be significantly large; it can be greater than 1. Meanwhile, the prenet may not suffer from this problem because either ${\widehat{\lambda }}_{\mathit{im}}$ and ${\widehat{\lambda }}_{\mathit{jk}}$ can become large.

For each model, $T=1000$ data sets are generated with $N(\mathbf{0},\mathbf{\Lambda }\mathbf{\Phi }{\mathbf{\Lambda }}^T+\mathbf{\Psi })$. The number of observations is $n=50,100$, and 500. To investigate the performance of various penalization procedures, we compare the root mean squared error (RMSE) over $T=1000$ simulations, which is defined by

$$\begin{array}{c}\hfill \text{RMSE}=\frac{1}{T}{\left(\sum _{s=1}^T,\frac{\Vert \mathbf{\Lambda }-{\widehat{\mathbf{\Lambda }}}^{(s)}{\Vert }_F^2}{\mathit{pm}}\right)}^{1/2},\end{array}$$

where ${\widehat{\mathbf{\Lambda }}}^{(s)}$ is the estimate of the loading matrix using the sth dataset. We also compare the rate of nonzero factor loadings for Models (A) and (B). Because the loading matrix is not identifiable due to permutation and sign of columns, we change the permutation and sign such that RMSE is minimized. It is not fair to compare the rate of nonzero loadings for $\rho \to +0$, because the estimated loading matrix cannot become sparse. Thus, we apply the hard-thresholding with a cutoff value being 0.1, the default of the loadings class in R.

The results for RMSE and the rate of nonzero factor loadings are depicted in Figs. 2 and 3, respectively. For reference, true positive rate (TPR) and false positive rate (FPR) of the loading matrix are depicted in Figures S1.4 and S1.5 in the supplemental material. The range of the error bar indicates 90% confidence interval; we calculate 5% and 95% quantiles over 1000 simulation results and use them as the boundaries of the error bar. We obtain the following empirical observations from these figures.

Model (A-ORT):

The prenet penalization outperforms the existing methods in terms of RMSE when the regularization parameter is selected by the model selection criteria. It is also seen that the performance of the prenet is almost independent of $\gamma$. When $\rho \to +0$, all of the estimation procedures yield similar performances. When the $\rho$ is selected by the model selection criteria, the rate of nonzero loadings of the prenet is almost 0.25, that is the true rate. Considering the TPR result in Figure S1.4 in the supplemental material, the prenet with AIC or BIC correctly estimates the true zero/nonzero pattern. Meanwhile, the MCP, elastic net, and lasso tend to select a denser model than the true one.

Model (A-OBL):

The result for the oblique model is similar to that for the orthogonal model, but the oblique model tends to produce larger RMSEs than the orthogonal model for most cases. The $\rho \to +0$ produces larger RMSE than that with the regularization parameter $\rho$ selected by model selection criteria. This is probably because the loss function becomes flat as $\rho \to +0$. Therefore, the regularization may help improve the accuracy. We note that the promax rotation, which corresponds to $\rho \to +0$, turns out to be stable.

Model (B):

When n is large, the prenet with small $\gamma$ and varimax rotation produces small RMSEs. Because the true values of cross-loadings (small loadings) are close to but not exactly zero, the $L_1$ type regularization that induces a sparse loading matrix does not work well. The prenet with $\gamma =0.01$ achieves the sparse estimation but produces a loading matrix that is similar to the quartimin rotation, resulting in a nonsparse loading matrix. We also observe that the prenet with BIC sometimes results in too sparse loading matrix when $n=50$.

Model (C):

For small n, all methods result in large RMSE. For large n, the $L_1$ regularization methods, including the lasso, MCP, elastic net, and prenet with large $\gamma$ yield small RMSE. However, the prenet with small $\gamma$ and varimax rotation, which tend to estimate non-sparse loading matrix, produce large RMSE. Indeed, the average value of loading matrix in the supplemental material shows that the prenet with small $\gamma$ is biased. Furthermore, the varimax rotation with true loading matrix does not approximate the true one. Therefore, when the loading matrix is sparse but does not have the perfect simple structure, the lasso-type penalization or prenet with $\gamma =1$ would perform well.

Fig. 2.

RMSE of factor loadings. The upper and lower bars represent 95th and 5th percentiles, respectively. Here, “$\rho \to +0$” denotes a limit of the estimate of the factor loadings, ${\displaystyle \underset{\rho \to +0}{lim}{\widehat{\mathrm{\Lambda }}}_{\rho }}$, which corresponds to the factor rotation.

Fig. 3.

Rate of nonzero factor loadings. The upper and lower bars represent 95th and 5th percentiles, respectively. Here, “$\rho \to +0$” denotes a limit of the estimate of the factor loadings, ${\displaystyle \underset{\rho \to +0}{lim}{\widehat{\mathrm{\Lambda }}}_{\rho }}$, which corresponds to the factor rotation.

Investigation of Clustering via Perfect Simple Structure Estimation

As shown in Proposition 1, our proposed method allows the clustering of variables via the perfect simple structure estimation. We investigate the clustering accuracy on Model (A); the true loading matrix has the perfect simple structure, and then we know the true clusters. Figure 4 shows the Adjusted Rand Index (ARI) between true clusters and those obtained by prenet, lasso, and varimax. The range of the error bar indicates 90% confidence interval; we calculate 5% and 95% quantiles over 1000 simulation results and use them as the boundaries of the error bar.

Fig. 4.

Adjusted Rand Index (ARI) of the clustering results.

The clustering via prenet is achieved by perfect simple structure estimation. The lasso and varimax cannot always estimate the perfect simple structure. Therefore, we estimate the clusters as follows: for ith row vector of $\widehat{\mathbf{\Lambda }}$, say ${\widehat{\mathit{\lambda }}}_i={({\widehat{\lambda }}_{i1},\cdots ,{\widehat{\lambda }}_{\mathit{im}})}^T$, the ith variable belongs to jth cluster, where $j=\underset{j\in \{1,\cdots ,m\}}{\arg \max }(|{\widehat{\lambda }}_{\mathit{ij}}|)$. The regularization parameter for the lasso is $\rho \to +0$, which corresponds to a special case of the component loss criterion (Jennrich, 2004, 2006) with MLE.

The result of Fig. 4 shows that the prenet and varimax result in almost identical ARIs and are slightly better than the lasso when $n=50$ on Model (A-ORT). All methods correctly detect the true clusters when $n=100$ and $n=500$. For Model (A-OBL), the prenet performs slightly better than the varimax when $n=50$. As with the orthogonal model, the prenet and varimax correctly detect the true clusters when $n=100$ and $n=500$. The lasso performs worse than the other two methods for small sample sizes, suggesting that the prenet or varimax would be better if the clustering of variables is the purpose of the analysis.

Analysis of Big Five Personality Traits

We apply the prenet penalization to the survey data regarding the big five personality traits collected from Open Source Psychometrics Project (https://openpsychometrics.org/). Other real data applications (electricity demand and fMRI data) are described in Section S2 of the supplemental material. $n=8582$ responders in the US region are asked to assess their own personality based on 50 questions developed by Goldberg (1992). Each question asks how well it describes the statement of the responders on a scale of 1–5. It is well known that the personality is characterized by five common factors; therefore, we choose $m=5$. Several earlier researchers showed that the loading matrix may not possess the perfect simple structure due to the small cross-loadings (Marsh et al., 2010, 2013; Booth and Hughes, 2014); therefore, we do not aim at estimating the perfect simple structure with $\rho \to \infty$ in this analysis. We first interpret the estimated model and then investigate the performance of the prenet penalization with $\rho$ selected by model selection criteria for various sample sizes. The impact of the regularization parameter on the accuracy is also studied.

Interpretation of Latent Factors

We first apply the prenet penalization and the varimax rotation with maximum likelihood estimate and compare the loading matrices estimated by these two methods. With the prenet penalization, we choose a regularization parameter using AIC, BIC, and tenfold cross-validation (CV) with $\gamma =1$. The regularization parameter selected by the AIC and CV is $\rho =7.4\times {10}^{-4}$, and that selected by the BIC is $\rho =2.9\times {10}^{-3}$. The heatmaps of the loading matrices are shown in Fig. 5. The result of Fig. 5 shows that these heatmaps are almost identical; all methods are able to detect the five personality traits appropriately. We also observe that the result is almost independent of $\gamma$. These similar results may be due to the large sample sizes.

Fig. 5.

Heatmaps of the loading matrices on big five personality traits data. Each cell corresponds to the factor loading, and the depth of color indicates the magnitude of the value of the factor loading.

We explore the estimates of cross-loadings whose absolute values are larger than 0.3; it would be reasonable to regard that these cross-loadings affect the items. There exists four items that include such large absolute values of cross-loadings, and factor loadings related to these four items are shown in Table 1.

Table 1.

Factor loadings of four items estimated by the prenet penalization with $\gamma =0.01$. The regularization parameter, $\rho$, is selected by the BIC. The cross-loadings whose absolute values are larger than 0.3 are written in bold.

Item	F1	F2	F3	F4	F5
A2: Am not interested in other people’s problems.	0.341	$-$0.062	$-$0.525	$-$0.020	0.070
A7: Have a soft heart.	-0.317	0.089	0.615	0.008	$-$0.010
A10: Do not have a good imagination.	0.347	$-$0.164	$-$0.375	0.116	0.082
C4: Change my mood a lot.	$-$0.083	0.365	0.033	$-$0.548	0.022

The loading matrix is estimated by the prenet penalization with $\gamma =0.01$. The regularization parameter $\rho$ is selected by the BIC. The five factors represent “F1: extraversion,” “F2: neuroticism,” “F3: agreeableness,” “F4: conscientiousness,” and “F5: openness to experience.” For reference, the complete loading matrix is shown in Tables S2.5 and S2.6 of the supplemental material.

The three items, A2, A7, and A10, are affected by “F1: extraversion” and “F3: agreeableness.” The main and cross-loadings on the same item have opposite signs. We may make a proper interpretation of the factor loadings. For example, as for the question “A7: Have a soft heart,” it is easy to imagine some people who have an extraversion cannot be kind. They are interested in a profit from a person rather than the situation that the person is in now; thus, they can become selfish to get the profit even if the person’s feelings are hurt. Booth and Hughes (2014) also reported similar results of such cross-loadings. They mentioned that these cross-loadings were due to the overlap in content between extraversion and agreeableness.

Furthermore, we perform $M=100$ subsampling simulation with $n=500$ to investigate whether these cross-loadings can be found with small sample sizes. We compare the performance of four estimation methods: the prenet, lasso, MCP, and varimax rotation. For regularization methods, $\rho$ is selected by the BIC. We set $\gamma =1$ and $\gamma =0.01$ for the prenet and $\gamma =3$ for MCP.

Table 2 shows the number of times that the absolute values of these four cross-loadings exceed 0.3. The results show that the prenet with $\gamma =0.01$ most frequently identifies these four cross-loadings among $M=100$ simulations.

Table 2.

The number of times that the absolute values of four cross-loadings exceed 0.3. For regularization methods, $\rho$ is selected by the BIC.

	Prenet ($\gamma =1$)	Prenet ($\gamma =0.01$)	Lasso	MCP	Varimax
A2	25	85	35	69	81
A7	10	72	18	45	61
A10	29	90	40	68	80
C4	20	94	49	78	94

RMSE Comparison

We investigate the performance of the prenet in terms of estimation accuracy of the loading matrix through subsampling simulation. First, the dataset is randomly split into two datasets, ${\mathit{X}}_1$ and ${\mathit{X}}_2$, without replacement. The sample sizes of ${\mathit{X}}_1$ and ${\mathit{X}}_2$ are $n/2=4291$. The ${\mathit{X}}_1$ is used for estimating a loading matrix with large sample sizes; we perform the varimax rotation with MLE and regard the estimated loading matrix as a true loading matrix, say ${\mathbf{\Lambda }}_{\mathrm{true}}$. The true loading matrix is almost identical to the loading matrix obtained by the varimax with the entire dataset. We remark that the true loading matrix is also similar to the Model (B) of the Monte Carlo simulation described in Sect. 5.1.

The performance is investigated by subsampling the observations from ${\mathit{X}}_2$ with $n=100$ and $n=500$. Figure 6 depicts RMSE and rate of nonzero loadings for n random subsampled data over 100 simulations. The RMSE is defined as

$$\begin{array}{c}\hfill \text{RMSE}=\frac{1}{100}{\left(\sum _{s=1}^{100},\frac{\Vert {\mathbf{\Lambda }}_{\mathrm{true}}-{\widehat{\mathbf{\Lambda }}}^{(s)}{\Vert }_F^2}{\mathit{pm}}\right)}^{1/2},\end{array}$$

where ${\widehat{\mathbf{\Lambda }}}^{(s)}$ is the estimate of the loading matrix using the sth subsampled data. We apply the lasso, MCP with $\gamma =3$, prenet with $\gamma =1$, 0.1, 0.01, and the varimax rotation with MLE. The regularization parameter $\rho$ is selected by the AIC, BIC, and tenfold CV. We also compute the loading matrix when $\rho \to +0$, which results in the solution of the factor rotation with MLE. The nonzero pattern of the loading matrix for $\rho \to +0$ is estimated by a hard-thresholdings with a cutoff value being 0.1. The range of the error bar indicates 90% confidence interval over 100 simulations.

Fig. 6.

RMSE and rate of nonzero loadings when $n=100$ and 500. Here, “$\rho \to +0$” denotes a limit of the estimate of the factor loadings, ${\displaystyle \underset{\rho \to +0}{lim}{\widehat{\mathrm{\Lambda }}}_{\rho }}$, which corresponds to the factor rotation.

We have the following empirical observations from Fig. 6:

• The smaller the number of observations is, the sparser the solution is. An earlier study has shown that the model selection criterion can select a parsimonious model with small sample sizes in general frameworks (Cudeck and Henly, 1991).

• The BIC results in larger RMSE and lower rate of nonzero loadings than other criteria, especially for small sample sizes. Therefore, the BIC tends to select sparse solutions, and some of the small nonzero factor loadings are estimated to be zero.

• When the lasso or MCP is applied, the CV results in poor RMSE when $n=100$. This is because the estimated loading matrix is too sparse; it becomes (almost) zero matrix. When the prenet is applied, such a loading matrix cannot be obtained thanks to Proposition 1.

• With the prenet, small $\gamma$ tends to estimate a dense loading matrix and produce good RMSE. A similar tendency is found in Model (B) of the Monte Carlo simulation, described in Sect. 5.2.

Impact of Tuning Parameters

We investigate the impact of the tuning parameters $(\rho ,\gamma )$ on the estimation of the loading matrix. Figure 7 depicts the heatmaps of the loading matrices for various values of tuning parameters on the MCP and the prenet penalization. We find the tuning parameters so that the degrees of sparseness (proportion of nonzero values) of the loading matrix are approximately 20%, 25%, 40%, and 50%. For the MCP, we set $\gamma =\infty$ (i.e., the lasso), 5.0, 2.0, and 1.01. For prenet penalty, the values of gamma are $\gamma =1.0,$ 0.5,  and 0.01. Each cell describes the elements of the factor loadings as with Fig. 5.

Fig. 7.

Heatmaps of the loading matrices on big five personality traits data for various values of tuning parameters on the MCP and the prenet penalization.

From Fig. 7, we obtain the empirical observations as follows.

• With the prenet penalization, the characteristic of five personality traits are appropriately extracted for any values of tuning parameters, which suggests that the prenet penalization is relatively robust against the tuning parameters.

• The prenet penalization is able to estimate the perfect simple structure when the degree of sparseness is 20%. On the other hand, with the MCP, we are not able to estimate the perfect simple structure even when $\gamma$ is sufficiently small.

• With the lasso, the number of factors becomes less than five when the degrees of sparsity are 20% and 25%; the five personality traits are not able to be found. When the value of $\gamma$ is not sufficiently large, the MCP produces five factor model.

Discussion

We proposed a prenet penalty, which is based on the product of a pair of parameters in each row of the loading matrix. The prenet aims at the estimation of not only sparsity but also the simplicity. Indeed, the prenet is a generalization of the quartimin criterion, one of the most popular oblique techniques for simple structure estimation. Furthermore, the prenet is able to estimate the perfect simple structure, which gave us a new variables clustering method using factor models. The clustering of variables opens the door to the application of the factor analysis to a wide variety of sciences, such as image analysis, neuroscience, marketing, and biosciences.

The prenet penalization has two different purposes of analysis: clustering of variables and exploratory factor analysis. The way of using the prenet penalization depends on the purpose of the analysis. When the purpose of the analysis is the clustering of variables, the regularization parameter is set to be $\rho \to \infty$ to achieve the perfect simple structure estimation. It is shown that the prenet performs better than the lasso and varimax in terms of clustering accuracy, as described in Sect. 5.3. Furthermore, the real data analyses in Section S2 in the supplemental material show the superiority of the prenet over the conventional clustering methods, such as the k-means clustering. When the purpose of the analysis is exploratory factor analysis, the perfect simple structure estimation is not necessarily needed. In this case, the regularization parameter is selected by the model selection criteria. The numerical results show that the prenet penalization performs well when an appropriate value of $\gamma$ is selected.

Over a span of several decades, a number of researchers have developed methods for finding a simple loading matrix (e.g., Kaiser, 1958; Hendrickson and White, 1964) in the Thurstonian sense (Thurstone, 1947). As the simple structure is a special case of sparsity, it seems the lasso-type sparse estimation is more flexible than the prenet. Indeed, the recent trend in the exploratory factor analysis literature is to find a loading matrix that possesses the sparsity rather than simplicity (Jennrich, 2004, 2006; Trendafilov, 2013; Scharf and Nestler, 2019b, a).

Nevertheless, the lasso-type sparse estimation is not as flexible as expected. As mentioned in Model (B) in Monte Carlo simulation and Section S1 in the supplemental material, the lasso cannot often approximate the true loading matrix when the cross-loadings are not exactly but close to zero. Because some factor loadings are estimated to be exactly zero with the lasso, some other factor loadings turn out to be excessively large, which causes the difficulty in interpretation.

For this reason, we believe both sparsity and simplicity play important roles in the interpretation. The sparse estimation automatically produces the nonzero pattern of the loading matrix, which allows us to interpret the latent factors easily. In addition, simplicity is also helpful for the interpretation, as shown in Thurstone (1947). The prenet penalization is able to achieve simplicity and sparsity simultaneously. Indeed, a sparse loading matrix is estimated thanks to the penalty based on the absolute term in ${\sum }_{i,j,k}|{\lambda }_{\mathit{ij}}{\lambda }_{\mathit{ik}}|$. In addition, simplicity is also achieved because it generalizes the quartimin criterion that often produces a simple structure (Jennrich and Sampson, 1966). Furthermore, with a large value of the regularization parameter, the loading matrix enjoys the perfect simple structure. Meanwhile, the existing methods cannot always produce a loading matrix that is both sparse and simple. For example, the lasso produces a loading matrix that is sparse but not always simple.

The structural equation modeling (SEM) has been widely used in the social and behavioral sciences. The SEM covers a wide variety of statistical models, including the factor analysis model and the regression model. An analyst develops an assumption of causal relationship and determines whether the assumption is correct or not by testing the hypothesis or evaluating the goodness of fit indices. Recently, several researchers have proposed regularized structural equation models (Jacobucci et al., 2016; Huang et al., 2017; Huang, 2018). The analyst set lasso-type penalties to specific model parameters to conduct an automatic selection of the causal relationship, enhancing the flexibility in model specification. The application of the prenet to the SEM would be an interesting future research topic.

The lasso-type regularization extracts only the nonzero pattern of parameters. In some cases, the analyst needs to detect not only the nonzero pattern of parameters but also a more complex parameter structure. The penalty must be determined depending on the structure of the parameter. For example, when the analyst needs to estimate either ${\theta }_1$ or ${\theta }_2$ to be zero, the prenet penalty would be more useful than the lasso. More generally, when one of ${\theta }_1,\cdots ,{\theta }_k$ is exactly or close to zero, we may use the Geomin-type penalty, ${\prod }_{j=1}^k|{\theta }_j|$. An application of a penalty that leads to structured sparsity would further enhance the flexibility of the analysis but beyond the scope of this research. We would like to take this as a future research topic.

Another interesting extension to the prenet penalization is the clustering of not only variables but also observations. This method is referred to as biclustering (e.g., Tan and Witten, 2014; Flynn and Perry, 2020). To achieve this, we may need an entirely new formulation along with an algorithm to compute the optimal solution. This extension should also be a future research topic.

Supplemental Materials

Further numerical and theoretical investigations Analyses of resting-state fMRI data, electricity demand data, a loading matrix of big five data, and comparison with Geomin criterion.

R-package fanc R-package fanc containing code that performs our proposed algorithm.

Loadings Average of the estimated loading matrices for Monte Carlo simulations in Sect. 5 with excel files.

Supplementary Information

Below is the link to the electronic supplementary material.

Proofs

Proof of Proposition 2

Because of Proposition 1, with the prenet, ${\widehat{\lambda }}_{\mathit{ij}}{\widehat{\lambda }}_{\mathit{ik}}=0$ as $\rho \to \infty$. Thus, the prenet solution satisfies (9) as $\rho \to \infty$. We only need to show that the minimization problem of loss function ${\ell }_{\text{ML}}(\mathbf{\Lambda },\mathbf{\Psi })$ is equivalent to that of $\Vert \mathit{S}-\mathbf{\Lambda }{\mathbf{\Lambda }}^T{\Vert }_F^2$. The inverse covariance matrix of the observed variables is expressed as

$$\begin{array}{c}\hfill {\mathbf{\Sigma }}^{-1}={\mathbf{\Psi }}^{-1}-{\mathbf{\Psi }}^{-1}\mathbf{\Lambda }{({\mathbf{\Lambda }}^T{\mathbf{\Psi }}^{-1}\mathbf{\Lambda }+{\mathit{I}}_m)}^{-1}{\mathbf{\Lambda }}^T{\mathbf{\Psi }}^{-1}.\end{array}$$

Because ${\mathbf{\Lambda }}^T\mathbf{\Lambda }={\mathit{I}}_m$, we obtain

$$\begin{array}{c}\hfill {\mathbf{\Sigma }}^{-1}={\alpha }^{-1}{\mathit{I}}_p-\frac{{\alpha }^{-2}}{{\alpha }^{-1}+1}\mathbf{\Lambda }{\mathbf{\Lambda }}^T.\end{array}$$

The determinant of $\mathbf{\Sigma }$ can be calculated as

$$\begin{array}{c}\hfill |\mathbf{\Sigma }|={\alpha }^{p-m}{(1+\alpha )}^m.\end{array}$$

Then, the discrepancy function in (3) is expressed as

$$\begin{array}{c}\hfill \frac{1}{2}\left\{\mathrm{tr},({\alpha }^{-1}\mathit{S}),-,\frac{{\alpha }^{-2}}{{\alpha }^{-1}+1},\mathrm{tr},\left({\mathbf{\Lambda }}^T,\mathit{S},\mathbf{\Lambda }\right),+,p,log,\alpha ,+,m,log,\left(1,+,\frac{1}{\alpha }\right),-,log,|\mathit{S}|,-,p\right\}.\end{array}$$

Because $\alpha$ is given and $\Vert \mathit{S}-\mathbf{\Lambda }{\mathbf{\Lambda }}^T{\Vert }_F^2=-2\mathrm{tr}\left({\mathbf{\Lambda }}^T,\mathit{S},\mathbf{\Lambda }\right)+C.$ with constant value C, we can derive (10).

Proof of Proposition 3

Recall that $\widehat{\mathit{\theta }}$ is an unpenalized estimator that satisfies ${\displaystyle \ell (\widehat{\mathit{\theta }})=\underset{\mathit{\theta }\in \mathrm{\Theta }}{min}\ell (\mathit{\theta })}$ and ${\widehat{\mathit{\theta }}}_q$ is a quartimin solution obtained by the following problem.

$$\begin{array}{c}\hfill \underset{\mathit{\theta }\in \mathrm{\Theta }}{min}{P}_{\mathrm{qmin}}(\mathbf{\Lambda }),\text{subject}\text{to}\ell (\mathit{\theta })=\ell (\widehat{\mathit{\theta }}).\end{array}$$

First, we show that

$$\begin{array}{c}\hfill \underset{n\to \infty }{lim}d({\widehat{\mathit{\theta }}}_q,{\mathrm{\Theta }}_q^{\ast })=0a.s.\end{array}$$ A.1

From the assumptions, as the same manner of Chapter 6 in Pfanzagl (1994), we can obtain the following strong consistency.

$$\begin{array}{c}\hfill \underset{n\to \infty }{lim}d(\widehat{\mathit{\theta }},{\mathrm{\Theta }}_{\ast })=0\text{and}\underset{n\to \infty }{lim}d({\widehat{\mathit{\theta }}}_{{\rho }_n},{\mathrm{\Theta }}_{\ast })=0a.s.,\end{array}$$ A.2

where ${\mathrm{\Theta }}_{\ast }:=\{\mathit{\theta }\in \mathrm{\Theta }\mid {\ell }_{\ast }(\mathit{\theta })={min}_{\mathit{\theta }\in \mathrm{\Theta }}{\ell }_{\ast }(\mathit{\theta })\}$. When ${lim}_{n\to \infty }d(\widehat{\mathit{\theta }},{\mathrm{\Theta }}_{\ast })=0$, for all $ϵ>0$, by taking n large enough, we have

$$\begin{array}{c}\hfill \Vert \widehat{\mathbf{\Lambda }}-{\mathbf{\Lambda }}_{\ast }{\Vert }_F<ϵa.s.\end{array}$$

for some ${(\mathrm{vec}{({\mathbf{\Lambda }}_{\ast })}^T,\mathrm{diag}{({\mathbf{\Psi }}_{\ast })}^T,\mathrm{vech}{({\mathbf{\Phi }}_{\ast })}^T)}^T\in {\mathrm{\Theta }}_{\ast }$. From the uniform continuity of $P_{\mathrm{qmin}}$ on $\mathrm{\Theta }$ and the fact that $\Vert \widehat{\mathbf{\Lambda }}\mathit{T}-{\mathbf{\Lambda }}_{\ast }{\mathit{T}\Vert }_F={\Vert \widehat{\mathbf{\Lambda }}-{\mathbf{\Lambda }}_{\ast }\Vert }_F$ for any $\mathit{T}\in \mathcal{O}(m)$, we have

$$\begin{array}{c}\hfill \underset{\mathit{T}\in \mathcal{O}(m)}{sup}|P_{\mathrm{qmin}}(\widehat{\mathbf{\Lambda }}\mathit{T})-P_{\mathrm{qmin}}({\mathbf{\Lambda }}_{\ast }\mathit{T})|<ϵa.s.\end{array}$$ A.3

Write $\widehat{\mathit{T}}:={argmin}_{\mathit{T}\in \mathcal{O}(m)}{P}_{\mathrm{qmin}}(\widehat{\mathbf{\Lambda }}\mathit{T})$ and ${\mathit{T}}_{\ast }:={argmin}_{\mathit{T}\in \mathcal{O}(m)}{P}_{\mathrm{qmin}}({\mathbf{\Lambda }}_{\ast }\mathit{T})$. We have

$$\begin{array}{c}\hfill P_{\mathrm{qmin}}(\widehat{\mathbf{\Lambda }}\widehat{\mathit{T}})-P_{\mathrm{qmin}}({\mathbf{\Lambda }}_{\ast }\widehat{\mathit{T}})\le P_{\mathrm{qmin}}(\widehat{\mathbf{\Lambda }}\widehat{\mathit{T}})-P_{\mathrm{qmin}}({\mathbf{\Lambda }}_{\ast }{\mathit{T}}_{\ast })\le P_{\mathrm{qmin}}(\widehat{\mathbf{\Lambda }}{\mathit{T}}_{\ast })-P_{\mathrm{qmin}}({\mathbf{\Lambda }}_{\ast }{\mathit{T}}_{\ast }).\end{array}$$

From this, it follows that

$$\begin{array}{c}\hfill |P_{\mathrm{qmin}}(\widehat{\mathbf{\Lambda }}\widehat{\mathit{T}})-P_{\mathrm{qmin}}({\mathbf{\Lambda }}_{\ast }{\mathit{T}}_{\ast })|\le \underset{\mathit{T}\in \mathcal{O}(m)}{sup}|P_{\mathrm{qmin}}(\widehat{\mathbf{\Lambda }}\mathit{T})-P_{\mathrm{qmin}}({\mathbf{\Lambda }}_{\ast }\mathit{T})|.\end{array}$$

Thus, using (A.3), we obtain (A.1).

Next, as the similar manner of Proposition 15.1 in Foucart and Rauhut (2013), we prove ${lim}_{n\to \infty }d({\widehat{\mathit{\theta }}}_{{\rho }_n},{\mathrm{\Theta }}_q^{\ast })=0$, a.s. By the definition of ${\widehat{\mathit{\theta }}}_{{\rho }_n}$, for any ${\rho }_n>0$ we have

$$\begin{array}{c}\hfill \ell ({\widehat{\mathit{\theta }}}_{{\rho }_n})+{\rho }_n{P}_{\mathrm{qmin}}({\widehat{\mathbf{\Lambda }}}_{{\rho }_n})\le \ell ({\widehat{\mathit{\theta }}}_q)+{\rho }_n{P}_{\mathrm{qmin}}({\widehat{\mathbf{\Lambda }}}_q)\end{array}$$ A.4

and

$$\begin{array}{c}\hfill \ell ({\widehat{\mathit{\theta }}}_{{\rho }_n})\ge \ell ({\widehat{\mathit{\theta }}}_q).\end{array}$$ A.5

Combining (A.1), (A.4), (A.5), we obtain

$$\begin{array}{c}\hfill P_{\mathrm{qmin}}({\widehat{\mathbf{\Lambda }}}_{{\rho }_n})\le P_{\mathrm{qmin}}({\widehat{\mathbf{\Lambda }}}_q)\to P_{\mathrm{qmin}}({\mathbf{\Lambda }}_q^{\ast })a.s.\end{array}$$

for some ${(\mathrm{vec}{({\mathbf{\Lambda }}_q^{\ast })}^T,\mathrm{diag}{({\mathbf{\Psi }}_q^{\ast })}^T,\mathrm{vech}{({\mathbf{\Phi }}_q^{\ast })}^T)}^T\in {\mathrm{\Theta }}_q^{\ast }$. Therefore, we have

$$\begin{array}{c}\hfill \underset{n\to \infty }{lim}{P}_{\mathrm{qmin}}({\widehat{\mathbf{\Lambda }}}_{{\rho }_n})\le P_{\mathrm{qmin}}({\mathbf{\Lambda }}_q^{\ast })a.s.\end{array}$$

As shown in (A.2), ${lim}_{n\to \infty }d({\widehat{\mathit{\theta }}}_{{\rho }_n},{\mathrm{\Theta }}_{\ast })=0a.s.$, and ${\mathbf{\Lambda }}_q^{\ast }$ is a minimizer of $P_{\mathrm{qmin}}(·)$ over ${\mathrm{\Theta }}_{\ast }$, so that the proof is complete.

Detail of the Algorithm

Update Equation of EM Algorithm for Fixed Tuning Parameters

We provide update equations of factor loadings and unique variances when $\rho$ and $\gamma$ are fixed. Suppose that ${\mathbf{\Lambda }}_{\mathrm{old}}$, ${\mathbf{\Psi }}_{\mathrm{old}}$, and ${\mathbf{\Phi }}_{\mathrm{old}}$ are the current values of parameters. The parameter can be updated by minimizing the negative expectation of the complete-data penalized log-likelihood function with respect to $\mathbf{\Lambda }$, $\mathbf{\Psi }$, and $\mathbf{\Phi }$ (e.g., Hirose and Yamamoto, 2014):

$$\begin{array}{cc}\hfill Q(\mathbf{\Lambda },\mathbf{\Psi },\mathbf{\Phi })=& \sum _{i=1}^p\left(log,{\psi }_i,+,\frac{s_{\mathit{ii}}-2{\mathit{\lambda }}_i^T{\mathit{b}}_i+{\mathit{\lambda }}_i^T\mathit{A}{\mathit{\lambda }}_i}{{\psi }_i}\right)+log|\mathbf{\Phi }|+\mathrm{tr}({\mathbf{\Phi }}^{-1}\mathit{A})\hfill \\ \hfill & +\rho P(\mathbf{\Lambda })+C,\hfill \end{array}$$ A.6

where C is a constant and

$$\begin{array}{cc}\hfill \mathit{A}=& {\mathit{M}}^{-1}+{\mathit{M}}^{-1}{\mathbf{\Lambda }}_{\mathrm{old}}^T{\mathbf{\Psi }}_{\mathrm{old}}^{-1}\mathit{S}{\mathbf{\Psi }}_{\mathrm{old}}^{-1}{\mathbf{\Lambda }}_{\mathrm{old}}{\mathit{M}}^{-1},\hfill \end{array}$$ A.7

$$\begin{array}{cc}\hfill {\mathit{b}}_i=& {\mathit{M}}^{-1}{\mathbf{\Lambda }}_{\mathrm{old}}^T{\mathbf{\Psi }}_{\mathrm{old}}^{-1}{\mathit{s}}_i,\hfill \end{array}$$ A.8

$$\begin{array}{cc}\hfill \mathit{M}=& {\mathbf{\Lambda }}_{\mathrm{old}}^T{\mathbf{\Psi }}_{\mathrm{old}}^{-1}{\mathbf{\Lambda }}_{\mathrm{old}}+{\mathbf{\Phi }}_{\mathrm{old}}^{-1}.\hfill \end{array}$$ A.9

Here, ${\mathit{s}}_i$ is the ith column vector of $\mathit{S}$.

In practice, minimization of (A.6) is difficult, because the prenet penalty consists of nonconvex functions. Therefore, we use a coordinate descent algorithm to obtain updated loading matrix ${\mathbf{\Lambda }}_{\mathrm{new}}$. Let ${\tilde{\lambda }}_i^{(j)}$ be a ($m-1$)-dimensional vector ${({\tilde{\lambda }}_{i1},{\tilde{\lambda }}_{i2},\cdots ,{\tilde{\lambda }}_{i(j-1)},{\tilde{\lambda }}_{i(j+1)},\cdots ,{\tilde{\lambda }}_{\mathit{im}})}^T$. The parameter ${\lambda }_{\mathit{ij}}$ can be updated by maximizing (A.6) with the other parameters ${\tilde{\lambda }}_i^{(j)}$ and with $\mathbf{\Psi }$ being fixed, that is, we solve the following problem.

$$\begin{array}{cc}\hfill {\tilde{\lambda }}_{\mathit{ij}}=& \arg \underset{{\lambda }_{\mathit{ij}}}{min}\frac{1}{2{\psi }_i}\left\{a_{\mathit{jj}},{\lambda }_{\mathit{ij}}^2,-,2,\left(b_{\mathit{ij}},-,\sum _{k\ne j},a_{\mathit{kj}},{\tilde{\lambda }}_{\mathit{ik}}\right),{\lambda }_{\mathit{ij}}\right\}\hfill \\ \hfill & +\rho \left[\left\{\frac{1}{2},(1-\gamma ),\sum _{k\ne j},{\tilde{\lambda }}_{\mathit{ik}}^2\right\},{\lambda }_{\mathit{ij}}^2,+,\left(\gamma ,\sum _{k\ne j},|{\tilde{\lambda }}_{\mathit{ik}}|\right),|{\lambda }_{\mathit{ij}}|\right]\hfill \\ \hfill =& \arg \underset{{\lambda }_{\mathit{ij}}}{min}\frac{1}{2{\psi }_i}\left\{(a_{\mathit{jj}}+\beta ),{\lambda }_{\mathit{ij}}^2,-,2,\left(b_{\mathit{ij}},-,\sum _{k\ne j},a_{\mathit{kj}},{\tilde{\lambda }}_{\mathit{ik}}\right),{\lambda }_{\mathit{ij}}\right\}+\rho \xi |{\lambda }_{\mathit{ij}}|\hfill \\ \hfill =& \arg \underset{{\lambda }_{\mathit{ij}}}{min}\frac{1}{2}{\left({\lambda }_{\mathit{ij}},-,\frac{b_{\mathit{ij}}-{\sum }_{k\ne j}{a}_{\mathit{kj}}{\tilde{\lambda }}_{\mathit{ik}}}{a_{\mathit{jj}}+\beta }\right)}^2+\frac{{\psi }_i\rho \xi }{a_{\mathit{jj}}+\beta }|{\lambda }_{\mathit{ij}}|,\hfill \end{array}$$ A.10

where

$$\begin{array}{cc}\hfill \beta =& \rho {\psi }_i(1-\gamma )\sum _{k\ne j}{\tilde{\lambda }}_{\mathit{ik}}^2,\hfill \\ \hfill \xi =& \gamma \sum _{k\ne j}|{\tilde{\lambda }}_{\mathit{ik}}|.\hfill \end{array}$$

This is equivalent to minimizing the following penalized squared error loss function.

$$\begin{array}{c}\hfill S(\tilde{\theta })=\arg \underset{\theta }{min}\left\{\frac{1}{2},{(\theta -\tilde{\theta })}^2,+,{\rho }^{\ast },|\theta |\right\}.\end{array}$$ A.11

The solution $S(\tilde{\theta })$ can be expressed in a closed form using the soft thresholding function:

$$\begin{array}{c}\hfill S(\tilde{\theta })=\mathrm{sgn}(\tilde{\theta })(|\tilde{\theta }{|-{\rho }^{\ast })}_{+},\end{array}$$ A.12

where $A_{+}=max(A,0)$.

For given ${\mathbf{\Lambda }}_{\mathrm{new}}$, the parameters of unique variances and factor correlations, say ${\mathbf{\Psi }}_{\mathrm{new}}$ and ${\mathrm{\Phi }}_{\mathrm{new}}$, are expressed as

$$\begin{array}{cc}\hfill {\psi }_i^{\mathrm{new}}=& s_{\mathit{ii}}-2{({\mathit{\lambda }}_i^{\mathrm{new}})}^T{\mathit{b}}_i+{({\mathit{\lambda }}_i^{\mathrm{new}})}^T\mathit{A}{\mathit{\lambda }}_i^{\mathrm{new}}(i=1,\cdots ,p),\hfill \\ \hfill {\mathrm{\Phi }}_{\mathrm{new}}=& \underset{\mathrm{\Phi }}{\arg \min }\{log|\mathrm{\Phi }|+\mathrm{tr}({\mathrm{\Phi }}^{-1}\mathbf{A})\},\hfill \end{array}$$

where ${\psi }_i^{\mathrm{new}}$ is the ith diagonal element of ${\mathbf{\Psi }}_{\mathrm{new}}$, and ${\mathit{\lambda }}_i^{\mathrm{new}}$ is the ith row of ${\mathbf{\Lambda }}_{\mathrm{new}}$. The new value ${\mathrm{\Phi }}_{\mathrm{new}}$ may not be expressed in an explicit form, because all of the diagonal elements of $\mathrm{\Phi }$ are fixed by 1. Thus, ${\mathrm{\Phi }}_{\mathrm{new}}$ is obtained by the Broyden–Fletcher–Goldfarb–Shanno optimization procedure.

Algorithm Complexity

The complexity for our proposed algorithm for the orthogonal case is considered. To update $\mathbf{\Lambda }$, we need a matrix $\mathit{A}$ in (A.7). The matrix computation of $\mathit{A}$ requires $O(p^{2}m)$ operation (Zhao et al., 2007). In the coordinate descent algorithm, we need to compute $\tilde{\theta }$ in (A.11) for each step, in which O(m) operation is required. For simplicity, we consider the case where the number of cycles of the coordinate descent algorithm is one. We remark that our algorithm converges to the (local) optima for this case because both EM and coordinate descent algorithms monotonically decrease the objective function at each iteration. In this case, we need O(m) to update ${\lambda }_{\mathit{ij}}$ ($i=1,\cdots ,p$; $j=1,\cdots ,m$), and therefore, $O(p{m}^2)$ operation is required to update $\mathbf{\Lambda }$ in the coordinate descent algorithm. As a result, the algorithm complexity to update $\mathbf{\Lambda }$ is $O(p^{2}m)+O(p{m}^2)=O(p^{2}m)$.

For the update of $\mathbf{\Psi }$, we need $O(p{m}^2)$ operation because the computation of ${({\mathit{\lambda }}_i^{\mathrm{new}})}^T\mathit{A}{\mathit{\lambda }}_i^{\mathrm{new}}$ in (A.13) requires $O(m^2)$ operation for $i=1,\cdots ,p$. Note that when the unpenalized maximum likelihood estimation is conducted, the order O(pm) is achieved (Zhao et al., 2007); however, this order may not be achieved for the prenet penalization.