2 Exploratory factor analysis

The factor analysis model for a random vector of observed variables $\boldsymbol {x}$ and q factors $(q < p)$ is

(2.1) $$ \begin{align} \boldsymbol{x} = \boldsymbol{\mu} + \boldsymbol{\Lambda} \boldsymbol{z} +\boldsymbol{\epsilon} \,, \end{align} $$

where $\boldsymbol {\mu } = (\mu _1, \ldots , \mu _p)^\top \in \Re ^p$ , $\boldsymbol {\Lambda }$ is a $p \times q$ real matrix of factor loadings, $\boldsymbol {z} \sim \operatorname {\mathrm {N}}(\boldsymbol {0}_q, \boldsymbol {I}_q)$ , $\boldsymbol {\epsilon } \sim \operatorname {\mathrm {N}}(\boldsymbol {0}_p, \boldsymbol {\Psi })$ , and $\boldsymbol {z}$ is independent of $\boldsymbol {\epsilon }$ . In the latter expressions, $\boldsymbol {\Psi }$ is a $p \times p$ diagonal matrix with jth diagonal element $\psi _{j}> 0$ , and $\boldsymbol {0}_q$ is a vector of q zeros, and $\boldsymbol {I}_q$ is the $q \times q$ identity matrix. It follows that $\operatorname {\mathrm {E}}(\boldsymbol {x}) = \boldsymbol {\mu }$ and $\operatorname {\mathrm {var}} (\boldsymbol {x}) = \boldsymbol {\Sigma } = \boldsymbol {\Lambda }\boldsymbol {\Lambda }^\top + \boldsymbol {\Psi }$ . The exploratory factor analysis model is identifiable only up to orthogonal rotations of the factor loadings matrix $\boldsymbol {\Lambda }$ . Bartholomew et al. (Reference Bartholomew, Knott and Moustaki2011, Chapter 3) discuss approaches that resolve unidentifiability.

In the presence of realizations of n independent random vectors $\boldsymbol {x}_1, \ldots , \boldsymbol {x}_n$ , the log-likelihood function about the parameters $\boldsymbol {\mu }$ and $\boldsymbol {\Sigma }$ of the exploratory factor analysis model is

(2.2) $$ \begin{align} C - \frac{n}{2} \left[ \log \det \left( \boldsymbol{\Sigma} \right) + \operatorname{\mathrm{tr}} \left(\boldsymbol{\Sigma}^{-1} \boldsymbol{S} \right) + \sum_{i=1}^{n} ( \bar{\boldsymbol{x}} - \boldsymbol{\mu})^\top \boldsymbol{\Sigma}^{-1} (\bar{\boldsymbol{x}} - \boldsymbol{\mu})\right] \,, \end{align} $$

where $C = -np \log (2 \pi )/2$ , $\bar {\boldsymbol {x}} = \sum _{i=1}^n \boldsymbol {x}_i /n$ and $\boldsymbol {S} = \sum _{i=1}^n (\boldsymbol {x}_i - \bar {\boldsymbol {x}})(\boldsymbol {x}_i -\bar {\boldsymbol {x}} )^\top / n$ is the sample covariance matrix, assumed to be full rank. Clearly, the maximizer of (2.2) with respect to $\boldsymbol {\mu }$ is $\bar {\boldsymbol {x}}$ , and at that point the quadratic term in (2.2) involving $\bar {\boldsymbol {x}}$ and $\boldsymbol {\mu }$ vanishes. Then, the profile log-likelihood about $\boldsymbol {\Psi }$ and $\boldsymbol {\Lambda }$ is

(2.3) $$ \begin{align} \ell(\boldsymbol{\theta}; \boldsymbol{S}) = C - \frac{n}{2} \left[ \log \det \left( \boldsymbol{\Lambda} \boldsymbol{\Lambda}^\top + \boldsymbol{\Psi} \right) + \operatorname{\mathrm{tr}} \left\{ \left(\boldsymbol{\Lambda}\boldsymbol{\Lambda}^\top + \boldsymbol{\Psi}\right)^{-1} \boldsymbol{S} \right\} \right] \, \end{align} $$

with $\boldsymbol {\theta } = (\theta _1, \ldots , \theta _{p(q + 1)})^\top = (\lambda _{11}, \ldots , \lambda _{pq}, \psi _{1}, \ldots , \psi _{p})^\top $ , where $\lambda _{jk}$ and $\psi _{j}$ are the $(j, k)$ th and $(j, j)$ th elements of $\boldsymbol {\Lambda }$ and $\boldsymbol {\Psi }$ , respectively, $(j = 1, \ldots , p; k = 1, \ldots , q)$ . Heywood cases correspond to directions $\{\boldsymbol {\theta }(r)\}_{r \in \mathbb {N}}$ such that the value of $\ell (\boldsymbol {\theta }(r); \boldsymbol {S})$ increases but $\lim \limits _{r \to \infty }\boldsymbol {\Psi }(\boldsymbol {\theta }(r))$ is no longer positive definite. Ultra-Heywood cases, that is, maxima of (2.3) with some of the variances negative, can, of course, be prevented by maximizing the log-likelihood under the constraint that $\psi _{j}> 0$ . Nevertheless, this does not eliminate the possibility of at least one of the ML estimates of $\psi _{11}, \ldots , \psi _{pp}$ being exactly zero.

3 Maximum penalized likelihood for handling Heywood cases

A straightforward way to avoid Heywood cases is to employ an MPL estimator

(3.1) $$ \begin{align} \tilde{\boldsymbol{\theta}} \in \arg \underset{\boldsymbol{\theta} \in \boldsymbol{\Theta}}{\max} \, \ell^{\ast}(\boldsymbol{\theta}; \boldsymbol{S}) \,, \end{align} $$

where $\ell ^{\ast}(\boldsymbol {\theta }; \boldsymbol {S}) = \ell (\boldsymbol {\theta }; \boldsymbol {S}) + P^{\ast}(\boldsymbol {\theta }; \boldsymbol {S})$ and $\boldsymbol {\Theta } = \left \{\boldsymbol {\theta } \in \Re ^{p (q + 1)}: \theta _m> 0, m > pq \right \}$ , with a penalty function $P^{\ast}(\boldsymbol {\theta })$ that discourages estimates of $\psi _{ii}$ being zero, so that the set

$$ \begin{align*}\arg \underset{\boldsymbol{\theta} \in \boldsymbol{\Theta}}{\max} \, \ell^{\ast}(\boldsymbol{\theta}; \boldsymbol{S}) = \left\{\bar{\boldsymbol{\theta}}\in \boldsymbol{\Theta}: \ell^{\ast}(\bar{\boldsymbol{\theta}}; \boldsymbol{S}) = \underset{\boldsymbol{\theta} \in \boldsymbol{\Theta}}{\sup} \, \ell^{\ast}(\boldsymbol{\theta}; \boldsymbol{S}) \right\}, \end{align*} $$

is nonempty. Toward constructing an MPL estimator that always exists, Akaike (Reference Akaike1987) and Hirose et al. (Reference Hirose, Kawano, Konishi and Ichikawa2011) proposed the penalties

(3.2) $$ \begin{align} P^{\ast}(\boldsymbol{\theta}) = -\frac{\rho n}{2} \operatorname{\mathrm{tr}}\left(\boldsymbol{\Psi}^{-1/2} \boldsymbol{\Lambda} \boldsymbol{\Lambda}^\top \boldsymbol{\Psi}^{-1/2}\right) \,, \quad \text{and} \quad P^{\ast}(\boldsymbol{\theta}) = -\frac{\rho n}{2} \operatorname{\mathrm{tr}}\left(\boldsymbol{\Psi}^{-1/2} \boldsymbol{S} \boldsymbol{\Psi}^{-1/2}\right) \,, \end{align} $$

respectively, for $\rho> 0$ . The penalties in (3.2) are attractive because the MPL estimates preserve two particular equivariance properties that the ML estimator has, namely, equivariance under rescaling of the response vectors and equivariance under rotations of the factor loadings. The former is desirable to justify the common practice in factor analysis of setting $\boldsymbol {S}$ in (2.3) to the sample correlation matrix, and the latter is desirable because it ensures that any post-fit rotation of the factors is still the ML estimate of the rotated factors.

To see the equivariance under rescaling of the response vectors, let $\dot {\boldsymbol {x}}_i = \boldsymbol {L} \boldsymbol {x}_i$ , for a known, diagonal, invertible $p \times p$ matrix $\boldsymbol {L}$ . Then, $\dot {\boldsymbol {\Sigma }} = \operatorname {\mathrm {var}}(\dot {\boldsymbol {x}}_i) = \dot {\boldsymbol {\Lambda }} \dot {\boldsymbol {\Lambda }}^\top + \dot {\boldsymbol {\Psi }}$ , with $\dot {\boldsymbol {\Lambda }} = \boldsymbol {L} \boldsymbol {\Lambda }$ and $\dot {\boldsymbol {\Psi }} = \boldsymbol {L} \boldsymbol {\Psi } \boldsymbol {L}^\top $ , and the sample variance–covariance matrix based on $\dot {\boldsymbol {x}}_1, \ldots , \dot {\boldsymbol {x}}_n$ is $\dot {\boldsymbol {S}} = \boldsymbol {L} \boldsymbol {S} \boldsymbol {L}^\top $ . Denoting $\dot {\boldsymbol {\theta }} = (\dot \lambda _{11}, \ldots , \dot \lambda _{pq}, \dot \psi _{1}, \ldots , \dot \psi _{p})^\top $ , the cyclic property of the trace operator and properties of the determinant for products of invertible matrices can be used to show that $\ell (\dot {\boldsymbol {\theta }}; \dot {\boldsymbol {S}}) = \ell (\boldsymbol {\theta }; \boldsymbol {S}) + \dot {c}$ , where $\dot {c}$ does not depend on $\dot {\boldsymbol {\theta }}$ . Hence, if $\hat {\boldsymbol {\Lambda }}$ and $\hat {\boldsymbol {\Psi }}$ are the maximizers of $\ell (\boldsymbol {\theta }; \boldsymbol {S})$ , the maximizers of $\ell (\dot {\boldsymbol {\theta }}; \dot {\boldsymbol {S}})$ are $\boldsymbol {L} \hat {\boldsymbol {\Lambda }}$ and $\boldsymbol {L} \hat {\boldsymbol {\Psi }} \boldsymbol {L}^\top $ , respectively. Similar calculations show that, for both penalties in (3.2), $P^{\ast}(\dot {\boldsymbol {\theta }}) = P^{\ast}(\boldsymbol {\theta }) + \dot {d}$ for a known constant $\dot {d}$ that does not depend on $\dot {\boldsymbol {\theta }}$ . Hence, if $\tilde {\boldsymbol {\Lambda }}$ and $\tilde {\boldsymbol {\Psi }}$ are the maximizers of $\ell ^{\ast}(\boldsymbol {\theta }; \boldsymbol {S})$ , the maximizers of $\ell ^{\ast}(\dot {\boldsymbol {\theta }}; \dot {\boldsymbol {S}})$ are $\boldsymbol {L} \tilde {\boldsymbol {\Lambda }}$ and $\boldsymbol {L} \tilde {\boldsymbol {\Psi }} \boldsymbol {L}^\top $ , respectively. The equivariance under rotations of the factors is a direct consequence of the invariance of both $\ell (\boldsymbol {\theta }; \boldsymbol {S})$ and the penalties in (3.2), when $\boldsymbol {\Lambda }$ is replaced by $\boldsymbol {\Lambda } \boldsymbol {Q}$ , for an orthogonal $q \times q$ matrix $\boldsymbol {Q}$ .

Despite the above attractive equivariance properties, to our knowledge, there has been no formal proof that penalties (3.2) resolve Heywood cases. Furthermore, naive choice of $\rho $ can introduce considerable finite-sample bias in the estimation of $\boldsymbol {\theta }$ , as it is illustrated later in the simulations of Section 7.

4 Existence of maximum penalized likelihood estimates

Theorem 4.1 provides general conditions that ensure the existence of MPL estimates and uses them to examine the properties of the penalties (3.2).

The proof of Theorem 4.1 is in Section S2.2 of the Supplementary Material. The theorem is model-agnostic in that it only requires $\boldsymbol {S}$ to have full rank and that parameter estimation is conducted using the penalized log-likelihood function of (3.1); no assumptions about the true data generating process are made. Theorem 4.1 establishes that under conditions E1–E3 for the penalty to the log-likelihood, MPL estimation always results in estimates that are not Heywood cases, in the sense that $\tilde {\boldsymbol {\theta }}$ has $\tilde {\psi }_{j}> 0 (j = 1, \ldots , p)$ .

The penalties by Akaike (Reference Akaike1987) and Hirose et al. (Reference Hirose, Kawano, Konishi and Ichikawa2011) in (3.2) satisfy assumptions E1–E3 for ${\rho> 0}$ , and, hence, MPL estimation using either of those results in no Heywood cases. To see that, note that matrix inversion, matrix multiplication, and trace are all continuous operations on $\boldsymbol {\Theta }$ . As a result, the penalties in (3.2) are continuous and assumption E1 is satisfied. The penalties in (3.2) can be re-expressed as

(4.1) $$ \begin{align} P^{\ast}(\boldsymbol{\theta}) = - \frac{\rho n}{2} \sum_{j = 1}^p \frac{\boldsymbol{A}_{jj}(\boldsymbol{\theta})}{\boldsymbol{\Psi}_{jj}(\boldsymbol{\theta})} \, , \end{align} $$

where $\boldsymbol {A}_{jj}(\boldsymbol {\theta }) = \boldsymbol {S}_{jj}$ for the Hirose et al. (Reference Hirose, Kawano, Konishi and Ichikawa2011) penalty, and $\boldsymbol {A}_{jj}(\boldsymbol {\theta }) = \boldsymbol {\lambda }_j(\boldsymbol {\theta })^\top \boldsymbol {\lambda }_j(\boldsymbol {\theta })$ for the Akaike (Reference Akaike1987) penalty, where $\boldsymbol {\lambda }_j(\boldsymbol {\theta })$ is the jth row of $\boldsymbol {\Lambda }(\boldsymbol {\theta })$ , and $\boldsymbol {C}_{jk}$ denotes the $(j, k)$ th element of the matrix $\boldsymbol {C}$ . Note that $\boldsymbol {A}_{jj}(\boldsymbol {\theta }) / \boldsymbol {\Psi }_{jj}(\boldsymbol {\theta }) \ge 0$ for both penalties. Hence, (4.1) is bounded above by zero for $\rho> 0$ , and E2 is satisfied. Now, consider a sequence $\{\boldsymbol {\theta }(r)\}_{r \in \mathbb {N}}$ such that $\lim _{r \to \infty }\boldsymbol {\theta }(r) \in \partial \boldsymbol {\Theta }$ and $\lim _{r \to \infty }\lambda _{\min }(\boldsymbol {\Sigma }(\boldsymbol {\theta }(r)))> 0$ . Then, there exists at least one $j \in \{1, \ldots , p\}$ such that $\boldsymbol {\Psi }_{jj}(\boldsymbol {\theta }(r)) \to 0$ . For $\boldsymbol {A}(\boldsymbol {\theta }) = \boldsymbol {S}$ , the penalty (4.1) diverges to $-\infty $ as $\boldsymbol {\Psi }_{jj}(\boldsymbol {\theta }) \to 0$ . For the Akaike (Reference Akaike1987) version, $\boldsymbol {\lambda }_j(\boldsymbol {\theta }(r))^\top \boldsymbol {\lambda }_j(\boldsymbol {\theta }(r))$ can either diverge to $\infty $ or converge to a constant $c_j> 0$ . Only the former can happen for the chosen sequence $\{\boldsymbol {\theta }(r)\}_{r \in \mathbb {N}}$ , because, for the latter, $\boldsymbol {\lambda }_j(\boldsymbol {\theta }(r))^\top \boldsymbol {\lambda }_j(\boldsymbol {\theta }(r))$ would need to converge to zero at an appropriate rate, in which case $\boldsymbol {\lambda }_j(\boldsymbol {\theta }(r))^\top \boldsymbol {\lambda }_j(\boldsymbol {\theta }(r)) + \boldsymbol {\Psi }_{jj}(\boldsymbol {\theta })$ converges to zero, resulting in $\boldsymbol {\Sigma }(\boldsymbol {\theta }(r))$ having at least one zero eigenvalue. Hence, E3 is satisfied for both the Akaike (Reference Akaike1987) and Hirose et al. (Reference Hirose, Kawano, Konishi and Ichikawa2011) penalties.

Theorem A2 in the Supplementary Material provides an existence result under more general parameterizations of the factor analysis model, which is used for proving the consistency results in Section 5.2, and which might be useful if one wishes to impose further restrictions on the structure of $\boldsymbol {\Sigma }$ , as is being done, for example, in confirmatory factor analysis (see, e.g., Bartholomew et al., Reference Bartholomew, Knott and Moustaki2011, Chapter 8).

5 Asymptotics for maximum penalized likelihood

5.1 Consistency

To discuss the consistency of estimates for $\boldsymbol {\Lambda }, \boldsymbol {\Psi }$ in factor analysis models, we must i) define the estimands $\boldsymbol {\Lambda }_0, \boldsymbol {\Psi }_0$ , and $\boldsymbol {\Sigma }_0 = \boldsymbol {\Lambda }_0\boldsymbol {\Lambda }_0^\top + \boldsymbol {\Psi }_0$ and ii) ensure identifiability.

If the modeling assumption of Section 2 is met for matrices $\boldsymbol {\Lambda }_0$ and $\boldsymbol {\Psi }_0$ , then the latter are the parameter values that identify the data-generating process. This is the viewpoint taken in Kano (Reference Kano1983) in their consistency proofs, where they introduce and use the concept of strong identifiability.

Let $\boldsymbol {B}$ be any $p \times q$ matrix and $\boldsymbol {V} $ be any positive-definite $p \times p$ diagonal matrix and define $\boldsymbol {\Sigma } = \boldsymbol {B} \boldsymbol {B}^\top + \boldsymbol {V}$ . A factor model is said to be strongly identifiable if and only if, for any $\epsilon> 0$ , there exists a $\delta> 0$ such that

(5.1)

for some orthogonal matrix $\boldsymbol {Q}$ of order q and where is some matrix norm. Since our results are derived in a fixed p and fixed q asymptotic regime, the particular choice of matrix and vector norm is irrelevant for the developments (see Horn & Johnson, Reference Horn and Johnson2012, Corollary 5.4.5 and Section S2.1 of the Supplementary Material for details). Hence, throughout, let and denote any vector and matrix norm, respectively.

Theorem 5.1. Assume that

1. (C1) the factor model is strongly identifiable;

2. (C2) the set of MPL estimates $\arg \max _{\boldsymbol {\theta } \in \boldsymbol {\Theta }} \ell ^{\ast}(\boldsymbol {\theta }; \boldsymbol {S}) $ is non-empty;

3. (C3) $P^{\ast}(\boldsymbol {\theta }) \leq 0$ for all $\boldsymbol {\theta } \in \boldsymbol {\Theta }$ .

Then, for any $\epsilon> 0$ , there exists a $\delta>0$ such that

(5.2)

for some orthogonal $q \times q$ matrix $\boldsymbol {Q}$ .

The proof of Theorem 5.1 is in Section S2.3 of the Supplementary Material. Theorem 5.1 shows that if $\boldsymbol {S} \to \boldsymbol {\Sigma }_0$ and $n^{-1} P^{\ast}(\boldsymbol {\theta }_0) \to 0$ either in probability or almost surely, then the MPL estimates $\boldsymbol {\Lambda }(\tilde {\boldsymbol {\theta }})$ , $\boldsymbol {\Psi }(\tilde {\boldsymbol {\theta }})$ converge to $\boldsymbol {\Lambda }_0$ , $\boldsymbol {\Psi }_0$ , respectively, in probability or almost surely, up to orthogonal rotations of $\boldsymbol {\Lambda }(\tilde {\boldsymbol {\theta }})$ . Note that the conditions that we require of the penalty function are mild; $P^{\ast}(\boldsymbol {\theta })$ can be deterministic or depend on the responses, as long as it is pointwise $o_p(n)$ .

5.2 $\sqrt {n}$ -consistency and asymptotic distribution

Results on the rate of consistency and the asymptotic distribution of the MPL estimator can be derived under a stronger condition on the order of the penalty than that of Theorem 5.1. In particular, we are interested in $\sqrt {n}$ -consistency of the MPL estimates, that is,

where $\tilde {\boldsymbol {\theta }}$ and $\hat {\boldsymbol {\theta }}$ denote the MPL and ML estimates, respectively, and $\boldsymbol {Q}_1, \boldsymbol {Q}_2$ are appropriate sequences of orthogonal rotation matrices. Under stronger identification conditions, we can also establish results on the asymptotic distribution of $\tilde {\boldsymbol {\theta }}$ and $\hat {\boldsymbol {\theta }}$ .

Central to such results is the local identification restriction that the Jacobian of $\operatorname {\mathrm {vec}}(\boldsymbol {\Sigma }(\boldsymbol {\theta }))$ has full column rank at the parameter of interest $\boldsymbol {\theta }_{0}$ . If the map $\boldsymbol {\theta } \mapsto \operatorname {\mathrm {vec}}(\boldsymbol {\Sigma }(\boldsymbol {\theta }))$ is continuously differentiable with full column rank Jacobian at $\boldsymbol {\theta }_{0}$ , then there exists an open neighborhood $\mathcal {U}_0$ around $\boldsymbol {\theta }_{0}$ , such that for any $\varepsilon> 0$ , there exists a $\delta> 0$ , with

for all $\boldsymbol {\theta } \in \mathcal {U}_0$ . This assumption ensures that the information matrix is invertible, which is required for $\sqrt {n}$ -asymptotics. The full column rank condition N2 in Theorem 5.2 is, for example, also present in Anderson and Amemiya (Reference Anderson and Amemiya1988, Theorems 2 and 3), who establish the asymptotic normal distribution of the $\sqrt {n} (\hat {\boldsymbol {\theta }} - \boldsymbol {\theta }_0)$ in factor analysis models under that and additional conditions.

In the unrestricted model, where $\boldsymbol {\Theta } = \{\boldsymbol {\theta } \in \Re ^{p(q + 1)}: \theta _m> 0, m > pq\}$ , this full rank condition does not hold due to the invariance of the variance–covariance matrix under orthogonal rotations of $\boldsymbol {\Lambda }$ . Thus, henceforth, we focus on a restricted parameter space $\bar {\boldsymbol {\Theta }} \subseteq \Re ^d$ with covariance mapping $\boldsymbol {\Sigma }(\boldsymbol {\theta }) = \boldsymbol {\Lambda }(\boldsymbol {\theta }) \boldsymbol {\Lambda }(\boldsymbol {\theta })^\top + \boldsymbol {\Psi }(\boldsymbol {\theta })$ that does not allow for a rank-deficient Jacobian. We further assume that $\bar {\boldsymbol {\Theta }}$ is contained in $\boldsymbol {\Theta }$ in the sense that for every $\boldsymbol {\theta } \in \boldsymbol {\Theta }$ , there exists a $\bar {\boldsymbol {\theta }} \in \bar {\boldsymbol {\Theta }}$ and an orthogonal rotation $\boldsymbol Q$ , such that $\boldsymbol {\Lambda }(\boldsymbol {\theta })\boldsymbol {Q} = \boldsymbol {\Lambda }(\bar {\boldsymbol {\theta }})$ and $\boldsymbol {\Psi }(\boldsymbol {\theta }) = \boldsymbol {\Psi }(\bar {\boldsymbol {\theta }})$ . Common parameter restrictions encountered in practice, that accommodate this requirement include requiring $\boldsymbol {\Lambda }$ to be upper-triangular, or requiring $\boldsymbol {\Lambda }^\top \boldsymbol {\Psi }^{-1} \boldsymbol {\Lambda }$ to be diagonal (see, e.g., Bartholomew et al., Reference Bartholomew, Knott and Moustaki2011, Chapter 3).

Note that the parameter vector defining the matrices $\boldsymbol {\Lambda }_0$ and $\boldsymbol {\Psi }_0$ need not itself be in $\bar {\boldsymbol {\Theta }}$ . Rather, we assume that $\bar {\boldsymbol {\Theta }}$ contains a parameter vector that corresponds to a loading matrix that can be appropriately rotated to give $\boldsymbol {\Lambda }_0$ . Unless $\boldsymbol {\Lambda }_0$ and $\boldsymbol {\Psi }_0$ correspond to a parameter vector in $\bar {\boldsymbol {\Theta }}$ , convergence of loading matrices is therefore naturally stated after appropriate rotation.

Theorem 5.2. Assume that

1. (N1) there exists a $\boldsymbol {\theta }_0 \in \bar {\boldsymbol {\Theta }}$ such that $\boldsymbol {S} \overset {p}{\longrightarrow } \boldsymbol {\Sigma }(\boldsymbol {\theta }_0)$ as $n \to \infty $ ;

2. (N2) $\boldsymbol {\Sigma }(\boldsymbol {\theta }_{0})$ is strongly identifiable in $\bar {\boldsymbol {\Theta }}$ and the Jacobian of $\textrm {vec}(\boldsymbol {\Sigma }(\boldsymbol {\theta }))$ with respect to $\boldsymbol {\theta }$ has full column rank at $\boldsymbol {\theta }_{0}$ ;

3. (N3) the set of MPL estimates $\arg \underset {\boldsymbol {\theta } \in \bar {\boldsymbol {\Theta }}}{\max } \, \{ \ell ^{\ast}(\boldsymbol {\theta }; \boldsymbol {S}) \}$ is not empty;

4. (N4) $P^{\ast}(\boldsymbol {\theta }) = c_n P(\boldsymbol {\theta })$ , where $P(\boldsymbol {\theta })$ is nonpositive, deterministic, invariant under orthogonal rotations of $\boldsymbol {\Lambda }$ , and continuously differentiable on $\bar {\boldsymbol {\Theta }}$ , with $c_n = o_p(\sqrt {n})$ positive.

Then, there exist sequences of orthogonal rotation matrices $\boldsymbol {Q}_1, \boldsymbol {Q}_2$ such that:

(5.3)

and

(5.4)

where $\hat {\boldsymbol {\theta }}$ and $\tilde {\boldsymbol {\theta }}$ denote two sequences of the ML and MPL estimates, respectively.

The proof of Theorem 5.2 is in Section S2.4 of the Supplementary Material. Theorem 5.2 as presented above gives conditions about the consistency of ML and MPL estimators, as well as the rate of convergence to one another. If one is interested in establishing the asymptotic distribution of the MPL estimator $\tilde {\boldsymbol {\theta }}$ based on the limiting distribution of the ML estimator $\hat {\boldsymbol {\theta }}$ , one can replace the strong identifiability condition on $\boldsymbol {\Lambda }_0, \boldsymbol {\Psi }_0$ with a more stringent point-identification condition on $\boldsymbol {\theta }_0$ :

1. N2^*) for any $\epsilon>0$ , there exists a $\delta>0$ such that for all $\boldsymbol {\theta } \in \bar {\boldsymbol {\Theta }}$ , implies that and the Jacobian of $\textrm {vec}(\boldsymbol {\Sigma }(\boldsymbol {\theta }))$ with respect to $\boldsymbol {\theta }$ has full column rank at $\boldsymbol {\theta }_{0}$ .

In this instance, the conclusion of Theorem 5.2 is that $\tilde {\boldsymbol {\theta }} \overset {p}{\longrightarrow } \boldsymbol {\theta }_{0}$ and . This stronger identification condition may be required when one wishes to establish the asymptotic distribution of $\tilde {\boldsymbol {\theta }}, \hat {\boldsymbol {\theta }}$ . Slutsky’s lemma then implies that if $\sqrt {n} (\hat {\boldsymbol {\theta }} - \boldsymbol {\theta }_0)$ has a normal distribution asymptotically, then $\sqrt {n} (\tilde {\boldsymbol {\theta }} - \boldsymbol {\theta }_0)$ with a penalty scaled as in N4 has the same asymptotic distribution.

Note that the conditions of Theorems 5.1 and 5.2 only require that the limit of the estimator of the variance–covariance matrix $\boldsymbol {S}$ decomposes in an exploratory factor analysis fashion, and normality of errors is not essential.

6 Maximum softly penalized likelihood

Theorem 4.1 establishes conditions on $P^{\ast}(\boldsymbol {\theta })$ that ensure the existence of the MPL estimates. On the other hand, Theorems 5.1 and 5.2 involve sufficient conditions on the order of the penalty $P^{\ast}(\boldsymbol {\theta })$ for the consistency of the MPL estimator. Specifically, if $P^{\ast}(\boldsymbol {\theta }) = o_p(\sqrt {n})$ , the respective order conditions in Theorems 5.1 and 5.2 are satisfied.

Suppose that $P^{\ast}(\boldsymbol {\theta }) = c_n P(\boldsymbol {\theta })$ , where the functional part $P(\boldsymbol {\theta })$ satisfies the conditions of Theorem 4.1 for the existence of MPL estimates, and where $c_n> 0$ is a scaling factor. One way to derive a suitable scaling factor is to consider how information about the model parameters accumulates as n increases. For example, we can derive a principled heuristic for $c_n$ by considering the exploratory factor analysis model in (2.3) under independence (i.e., $\boldsymbol {\Lambda }$ is a matrix of zeros). The unknown parameters are the vector of variances $\sigma _1^2, \ldots \sigma _p^2$ , and the information matrix about those parameters is a diagonal matrix with jth diagonal element $n / (2 \sigma ^4_j)$ . Standard results on the asymptotic distribution of the ML estimator give that $\sqrt {n / 2} (s_j^2 / \sigma _j^2 - 1)$ converges in distribution to a standard normal random variable for all $j \in \{1, \ldots , p\}$ . The rate of information accumulation for each coordinate is $\sqrt {n / 2}$ and, hence, we can choose $c_n = \sqrt {2 / n}$ . This choice is in line with the requirements of Theorems 5.1 and 5.2 for any exploratory factor analysis model, while ensuring that the penalization strength is asymptotically negligible. We call MSPL estimation, MPL estimation with asymptotically negligible penalties that guarantee existence and $\sqrt {n}$ -consistency. In Section 4, we showed that the conditions for the existence of the MPL estimates are satisfied for the penalties (3.2) in Akaike (Reference Akaike1987) and Hirose et al. (Reference Hirose, Kawano, Konishi and Ichikawa2011). In particular, both penalties have the form $P^{\ast}(\boldsymbol {\theta }) = \rho n P(\boldsymbol {\theta }) / 2$ , $\rho> 0$ , $P(\boldsymbol {\theta }) \le 0,$ and $P(\boldsymbol {\theta }) = O(1)$ . Both penalties can be adapted for MSPL estimation by setting $\rho = 2 \sqrt {2 / n^{3}}$ .

7 Simulation studies

We conduct a series of simulation experiments to compare the performance of ML estimation, MPL estimation based on the penalties (3.2) with vanilla choices of $\rho $ , and MSPL estimation. The methods are compared in terms of their ability to handle Heywood cases, frequentist properties of the estimators, and selection of the number of factors when Heywood cases are present.

Our simulation settings have been informed by the simulation-based results reported in Cooperman and Waller (Reference Cooperman and Waller2022). Specifically, Cooperman and Waller (Reference Cooperman and Waller2022) identified, through an extensive simulation study, the following causes of Heywood cases in order of importance: item-to-factor ratio, model specification (correct, fitting one factor less than the actual number, and fitting one extra factor than the actual number), sample size, and loading matrix pattern (low against high loadings on the same factor, and factors with all low loadings against factors with all high loadings).

We fix the number of factors to $q = 3$ . We then consider sample sizes $n \in \left \{50, 100, 400 \right \}$ and the item-to-factor ratios 3:1, 5:1, and 8:1, and let the loading matrix $\boldsymbol {\Lambda }$ vary across experimental settings. Specifically, for the loading matrix with item-to-factor ratio 3:1, we use the matrices in settings $A_3$ and $B_3$ in Table 1, which are motivated from the settings of Cooperman and Waller (Reference Cooperman and Waller2022, Table 2). Setting $A_3$ decreases the factor loadings sequentially, while setting $B_3$ assumes two strong and one weak factor. Setting $A_5$ for the 5:1 ratio and setting $A_8$ for the 8:1 ratio are defined correspondingly to $A_3$ , where we choose the nonzero column blocks to be $(0.80, 0.65, 0.50, 0.35, 0.20)$ and $(0.80, 0.70, 0.60, 0.50, 0.40, 0.30, 0.20, 0.10)$ , respectively. For settings $B_5$ for the 5:1 ratio and $B_8$ for the 8:1 ratio, we simply repeat the non-zero loadings in Table 1 according to the item-to-factor ratio. The specific variances $\boldsymbol {\Psi }$ are set so that the diagonal elements of $\boldsymbol {\Sigma } = \boldsymbol {\Lambda }\boldsymbol {\Lambda }^\top + \boldsymbol {\Psi }$ are all one.

Table 1

Loading matrix settings $A_3$ and $B_3$

We compare the ML estimator with the MSPL estimators using appropriately scaled versions of the penalties (3.2) with $\rho = 2\sqrt {2 / n^{3}}$ based on the discussion in Section 6. We refer to those penalties as “Akaike[ $n^{-1/2}$ ]” and “Hirose[ $n^{-1/2}$ ].” We also consider MPL with the non-decaying scaling $\rho = 1$ , which was also used in Hirose et al. (Reference Hirose, Kawano, Konishi and Ichikawa2011). We refer to those penalties as “Akaike[n]” and “Hirose[n].”

For each combination of loading matrix, sample size, and item-to-factor ratio, we draw $1,000$ independent samples according to the factor analysis model (2.1) and, for each sample, we compute the estimates of (3.1). The estimates are computed by first getting MPL estimates from $100$ iterations of an EM-maximization of the penalized log-likelihood, which we then use as starting values for a Newton–Raphson optimization routine. We identify Heywood cases heuristically, when at least one of the following occurs: the estimation procedure fails, the normalized gradient $\{\nabla \nabla ^\top \ell ^{\ast}(\boldsymbol {\theta })\}^{-1} \nabla \ell ^{\ast}(\boldsymbol {\theta })$ has at least one element with absolute value greater than $10^{-4}$ , and at least one of the estimates of $\psi _{1}, \ldots , \psi _{p}$ is less than $10^{-4}$ .

Figure 1 shows the percentage of samples that have been identified as Heywood cases. It is evident that ML estimation results in a considerable number of Heywood cases across experimental settings, while, as expected from Theorem 4.1, MPL and MSPL estimation are effective in dealing with them. The negligible fraction of estimates that are identified as Heywood cases for MPL and MSPL estimation are attributable to the heuristics we use for the identification of Heywood cases and can be eliminated by less stringent heuristics.

Figure 1

Percentage of samples (out of $1,000$ ) that have been identified as Heywood cases for ML (“None”), MPL with Akaike[n] and Hirose[n] penalties, and MSPL with Akaike[ $n^{-1/2}$ ] and Hirose[ $n^{-1/2}$ ] penalties, $n \in \left \{50,100,400\right \}$ , and loading matrix settings $A_3$ , $B_3$ , $A_5$ , $B_5$ , $A_8$ , and $B_8$ .

We evaluate the finite-sample performance of ML, MPL, and MSPL estimators in terms of bias, probability of underestimation, and root mean-squared error (RMSE), estimated excluding the samples that have been identified as Heywood cases.

Figure 2 shows violin plots of coordinatewise estimates of the logarithm of the absolute bias, the logarithm of the RMSE, and the probability of underestimation of the unique elements of $\boldsymbol {\Lambda }\boldsymbol {\Lambda }^\top $ , for each estimator, $n \in \left \{50, 100, 400\right \}$ , and loading matrix settings $A_3$ and $B_3$ . A black dot indicates the average over all coordinates in each specification. The MSPL estimates, with soft scaling of order $n^{-1/2}$ , exhibit the smallest or close to the smallest bias across all methods and a rate of decay that is in line with Theorem 5.2. Notably, the Akaike[n] and Hirose[n] penalized estimators exhibit large finite sample bias. We also see that the MSPL estimators are well calibrated, with a probability of underestimation close to $1/2$ across all settings. In contrast, the Akaike[n] and Hirose[n] estimators consistently underestimate the elements of $\boldsymbol {\Lambda } \boldsymbol {\Lambda }^\top $ . This underestimation is expected from the excessive penalization that results from using a scaling factor of order n. Similarly to bias, the RMSE of the MSPL estimates is the lowest or close to the minimal RMSE across all methods. The coordinatewise estimates of the logarithm of absolute bias, the logarithm of RMSE, and probability of underestimation for loading matrix settings $A_5$ and $B_5$ , and $A_8$ and $B_8$ are shown in Figures S1 and S2 in the Supplementary Material, respectively. The findings are the same as above for $A_3$ and $B_3$ .

Figure 2

Violin plots of estimates of $\log (|\mathrm {Bias}|)$ (top panel), $\log (\mathrm {RMSE})$ (middle panel), and probability of underestimation (bottom panel) for the elements of $\boldsymbol {\Lambda }\boldsymbol {\Lambda }^\top $ , for each estimator, $n \in \left \{50,100,400\right \}$ , and loading matrix settings $A_3$ and $B_3$ . The average over all elements for each setting is noted with a dot.

We also assess the performance of AIC and BIC selection of the number of factors based on each estimator (see Akaike, Reference Akaike1987 and Hirose et al., Reference Hirose, Kawano, Konishi and Ichikawa2011 for details on these criteria for factor models) for item-to-factor ratio 3:1 with settings $A_3$ and $B_3$ for the loading matrix, and $n \in \{50, 400, 1,000, 5,000\}$ . We note that when fitting models with $q \in \{1,2\}$ , the model is misspecified and the assumptions of Theorems 5.1 and 5.2 do not apply. This design choice mirrors common practitioner behavior in factor selection and motivates our inclusion of this scenario. We fit the factor analysis model (2.1) for $q \in \{1, \ldots , 5\}$ . The AIC and BIC are computed from the unpenalized log-likelihood evaluated at the ML and MSPL estimates, respectively. We use all the samples, including those that have been identified as leading to Heywood cases, for computing AIC and BIC. Figure 3 shows the percentage of times that the model with three factors was selected with AIC and BIC at each estimator and $n \in \left \{50, 400, 1,000, 5,000\right \}$ . We note that AIC- and BIC-based model selection performs as expected with the MSPL estimators with Akaike[ $n^{-1/2}$ ] and Hirose[ $n^{-1/2}$ ] penalties. BIC-based model selection selects the correct model with increasing probability as n increases, which is the result of the consistency of BIC-based model selection (see, e.g., Claeskens & Hjort, Reference Claeskens and Hjort2008, Chapter 4). For $n = 50$ , model selection based on MSPL estimators is also found to outperform that based on the ML estimator, most probably due to the strong handling of Heywood cases, even in small samples. On the other hand, the MPL estimators with Akaike[n] and Hirose[n] penalties result in poor performance in both AIC- and BIC-based model selection, mainly due to the strength of the penalty.

Figure 3

Percentage of times the model with $three$ factors is selected for each estimator, $n \in \{50, 400, 1000, 5000 \}$ , and loading matrix settings $A_3$ and $B_3$ , using AIC and BIC. The absence of vertical bars pertaining to the Akaike[n]- and Hirose[n]-based model selection procedures indicate that these methods have never selected the correct model.

For $n < 5,000$ , we observe the poor performance of BIC in selecting the correct number of factors in setting $B_3$ across all estimators which we attribute to the two strong and one extremely weak factor (see Table 1). As Table 2 shows, BIC identifies the two strong factors in the majority of cases for small n, and starts identifying the weak factor more frequently slowly as n increases with ML or MSPL estimators.

Table 2

Percentage of times each number of factors has been selected using minimum BIC, for ML and MSPL with Akaike[n], Hirose[n], Akaike[ $n^{-1/2}$ ], and Hirose[ $n^{-1/2}$ ] penalties, under loading matrix setting $B_3$ and $n \in \left \{50,400, 1000, 5000\right \}$

8 Real data examples

We estimate the factor model (2.1) using ML, and MSPL using the Akaike[ $n^{-1/2}$ ] and Hirose[ $n^{-1/2}$ ] penalties for three data sets, where Heywood cases have been encountered in published work. The data sets are i) the Davis data (Rao, Reference Rao1955), which involve $n = 421$ observations and $p = 9$ items, ii) the Emmett data (Emmett, Reference Emmett1949; Lawley & Maxwell, Reference Lawley and Maxwell1971), which involve $n = 211$ observations and $p = 9$ items, and iii) the Maxwell data (Maxwell, Reference Maxwell1961, and Lawley & Maxwell, Reference Lawley and Maxwell1971, p. 44), which involve $n = 810$ observations and $p = 10$ items. Heywood cases result in the ML estimates of the factor model (2.1) with $q = 2$ for the Davis data, $q = 5$ for the Emmett data, and $q = 4$ for the Maxwell data. The three data sets have also been analyzed in Akaike (Reference Akaike1987).

Table 3 gives the estimates of the communalities $\sum _{k = 1}^q \lambda _{jk}^2 (j = 1, \ldots , p)$ using ML, and MSPL with Akaike $[n^{-1/2}]$ and Hirose $[n^{-1/2}]$ penalties, across different number of factors, along with the corresponding AIC and BIC values. As expected, ML estimation can lead to Heywood cases, which manifest as atypically large estimated communalities. In contrast, and as expected, there are no Heywood cases when MSPL estimation is used, and communality estimates are reasonable with no substantial impact on AIC and BIC values. Specifically, in the Davis data set, item $1$ has an atypically large communality ML estimate for $q = 2$ , while the MSPL estimates are all within reasonable ranges. MSPL estimation also resolves the Heywood cases that result in atypically large ML communality estimates for the Emmett data for $q = 4$ and $q = 5$ , and the Maxwell data for $q = 4$ . Tables S1–S3 in the Supplementary Material show the estimates of $\boldsymbol {\Psi }$ and $\boldsymbol {\Lambda }$ for the Emmett data, for $q \in \{1, \ldots , 5\}$ . As is apparent, the large ML estimated communalities for $q = 4$ and item 3, and $q = 5$ and item 4, correspond to negative ML variance estimates for those items. In contrast, and as expected all MSPL variance estimates are positive. Notably, due to soft penalization, the ML and MSPL estimates that do not correspond to Heywood cases are similar.

Table 3

Estimated communalities ( $\times 10^3$ ) for the Davis, Emmett, and Maxwell data, using ML, and MSPL with Akaike[ $n^{-1/2}$ ] and Hirose[ $n^{-1/2}$ ] penalties, for $q \in \{1, \ldots , 5\}$ , with AIC and BIC values

Note: Heywood cases are shown in bold.

9 Concluding remarks

In this article, we introduced a novel MSPL framework for factor analysis models to address improper solutions known as Heywood cases that frequently occur in statistical practice. Heywood cases can lead to unstable and inconclusive results related to factor loading estimates and factor scores, as well as inaccurate inferences and model selection. Our approach provides a comprehensive blueprint for constructing penalties and scaling factors that ensure the existence of estimators within the admissible parameter space and avoid the proposed ad hoc solutions in the literature. Our work focuses on exploratory factor analysis, but the proposed estimator can also be applied in a confirmatory factor analysis setting by enforcing additional constraints that practitioners might wish to impose on the model (e.g., zero loadings, equal error variances, etc.).

We provide sufficient conditions for the existence of the MPL estimator in factor analysis, together with the asymptotic properties of consistency and asymptotic normality of the MPL estimators. Additionally, we derive decay rates for the scaling of the penalty function to ensure consistency and asymptotic normality of the MSPL estimators, thus preserving the favorable asymptotic properties expected by the ML estimator. Through extensive simulation studies, we compared MSPL with appropriately scaled versions of the penalties proposed by Hirose et al. (Reference Hirose, Kawano, Konishi and Ichikawa2011), which are derived from Bayesian considerations and thus lack soft penalization by default. The MSPL estimators are found to recover the performance expected from ML theory while resolving the issues related to Heywood cases, across various model specifications, sample sizes, and item-to-factor ratios, making them a valuable tool for practical applications in exploratory and potentially confirmatory factor analysis. Our findings further reveal that naive penalties not only can undermine frequentist properties, in terms of higher bias, RMSE, and probability of underestimation, but can also have a deteriorating effect on the performance of model selection procedures. Our framework enables hypothesis testing by ensuring the existence of interior estimates in finite samples, even when the ML estimator may fail to exist, while preserving standard ML asymptotic behavior.

A limitation of our results is that they assume the probability limit of the sample covariance lies within the exploratory factor analysis model class; extending the theory to a least-false interpretation under covariance misspecification, in the spirit of White (Reference White1982), is a natural and important direction for future work. Further research directions include exploring alternative penalty functions, within the MSPL framework, for the factor analysis model (2.1) and for related models such as logistic factor analysis (see Bartholomew et al., Reference Bartholomew, Knott and Moustaki2011, Chapter 4). For example, in the logistic model, steep item characteristic curves lead to infinite estimates of the loadings (see, e.g., Wang & Yotebieng, Reference Wang and Yotebieng2023 for a discussion of Heywood cases in item response models for binary data). MSPL can be readily extended to handle those cases, too.