Sparse estimation via nonconcave penalized likelihood in factor analysis model
From MaRDI portal
Abstract: We consider the problem of sparse estimation in a factor analysis model. A traditional estimation procedure in use is the following two-step approach: the model is estimated by maximum likelihood method and then a rotation technique is utilized to find sparse factor loadings. However, the maximum likelihood estimates cannot be obtained when the number of variables is much larger than the number of observations. Furthermore, even if the maximum likelihood estimates are available, the rotation technique does not often produce a sufficiently sparse solution. In order to handle these problems, this paper introduces a penalized likelihood procedure that imposes a nonconvex penalty on the factor loadings. We show that the penalized likelihood procedure can be viewed as a generalization of the traditional two-step approach, and the proposed methodology can produce sparser solutions than the rotation technique. A new algorithm via the EM algorithm along with coordinate descent is introduced to compute the entire solution path, which permits the application to a wide variety of convex and nonconvex penalties. Monte Carlo simulations are conducted to investigate the performance of our modeling strategy. A real data example is also given to illustrate our procedure.
Recommendations
- A penalized maximum likelihood approach to sparse factor analysis
- Sparse factor regression via penalized maximum likelihood estimation
- Estimation of an oblique structure via penalized likelihood factor analysis
- Sparse exploratory factor analysis
- Single- and multiple-group penalized factor analysis: a trust-region algorithm approach with integrated automatic multiple tuning parameter selection
Cites work
- scientific article; zbMATH DE number 5957245 (Why is no real title available?)
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 3117083 (Why is no real title available?)
- scientific article; zbMATH DE number 3444596 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3045859 (Why is no real title available?)
- A RAPIDLY CONVERGENT METHOD FOR MAXIMUM‐LIKELIHOOD FACTOR ANALYSIS
- A Statistical View of Some Chemometrics Regression Tools
- A penalized maximum likelihood approach to sparse factor analysis
- Bayesian learning in sparse graphical factor models via variational mean-field annealing
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- EM algorithms for ML factor analysis
- Efficient estimation of approximate factor models via penalized maximum likelihood
- Estimation of the mean of a multivariate normal distribution
- Extended Bayesian information criteria for model selection with large model spaces
- Factor analysis and AIC
- Forecasting Using Principal Components From a Large Number of Predictors
- Foundations of factor analysis
- High-dimensional sparse factor modeling: applications in gene expression genomics
- How Biased is the Apparent Error Rate of a Prediction Rule?
- Least angle regression. (With discussion)
- Model selection and Akaike's information criterion (AIC): The general theory and its analytical extensions
- Model selection and estimation in the Gaussian graphical model
- Nearly unbiased variable selection under minimax concave penalty
- On Measuring and Correcting the Effects of Data Mining and Model Selection
- On the ``degrees of freedom of the lasso
- On the degrees of freedom in shrinkage estimation
- One-step sparse estimates in nonconcave penalized likelihood models
- Pathwise coordinate optimization
- Probabilistic Principal Component Analysis
- Rotation to simple loadings using component loss functions: the oblique case
- Rotation to simple loadings using component loss functions: the orthogonal case
- Simplimax: Oblique rotation to an optimal target with simple structure
- Some contributions to maximum likelihood factor analysis
- SparseNet: coordinate descent with nonconvex penalties
- Statistical analysis of factor models of high dimension
- The Adaptive Lasso and Its Oracle Properties
- The Estimation of Prediction Error
- The varimax criterion for analytic rotation in factor analysis
- Tuning parameter selection in sparse regression modeling
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variable selection via the weighted group Lasso for factor analysis models
Cited in
(27)- Multidimensional item response theory in the style of collaborative filtering
- Sparse online principal component analysis for parameter estimation in factor model
- A penalized maximum likelihood approach to sparse factor analysis
- Estimation of an oblique structure via penalized likelihood factor analysis
- On the penalized maximum likelihood estimation of high-dimensional approximate factor model
- Sparsest factor analysis for clustering variables: a matrix decomposition approach
- Mediation analysis with latent factors using simultaneous group-wise and parameter-wise penalization
- Single- and multiple-group penalized factor analysis: a trust-region algorithm approach with integrated automatic multiple tuning parameter selection
- High-dimensional disjoint factor analysis with its EM algorithm version
- Parsimonious Bayesian factor analysis for modelling latent structures in spectroscopy data
- Approximated penalized maximum likelihood for exploratory factor analysis: an orthogonal case
- Rotation to sparse loadings using \(L^p\) losses and related inference problems
- Sparse principal component regression for generalized linear models
- Integrating approximate single factor graphical models
- Sparse factor model based on trend filtering
- Sparse and simple structure estimation via prenet penalization
- Sparse factor regression via penalized maximum likelihood estimation
- Sparse exploratory factor analysis
- Sparse exploratory factor analysis
- In the pursuit of sparseness: a new rank-preserving penalty for a finite mixture of factor analyzers
- Statistical analysis of sparse approximate factor models
- A penalized likelihood method for structural equation modeling
- Clustering of multivariate binary data with dimension reduction via \(L_{1}\)-regularized likelihood maximization
- scientific article; zbMATH DE number 7387188 (Why is no real title available?)
- Heterogeneous large datasets integration using Bayesian factor regression
- Simultaneous variable and factor selection via sparse group lasso in factor analysis
- Discussion: One-step sparse estimates in nonconcave penalized likelihood models
This page was built for publication: Sparse estimation via nonconcave penalized likelihood in factor analysis model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q261015)
