Optimal vintage factor analysis with deflation varimax
Not on the map. Why?
Abstract (arXiv)
Vintage factor analysis is one important type of factor analysis that aims to first find a low-dimensional representation of the original data, and then to seek a rotation such that the rotated low-dimensional representation is scientifically meaningful. The most widely used vintage factor analysis is the Principal Component Analysis (PCA) followed by the varimax rotation. Despite its popularity, little theoretical guarantee can be provided to date mainly because varimax rotation requires to solve a non-convex optimization over the set of orthogonal matrices. In this paper, we propose a deflation varimax procedure that solves each row of an orthogonal matrix sequentially. In addition to its net computational gain and flexibility, we are able to fully establish theoretical guarantees for the proposed procedure in a broader context. Adopting this new deflation varimax as the second step after PCA, we further analyze this two step procedure under a general class of factor models. Our results show that it estimates the factor loading matrix in the minimax optimal rate when the signal-to-noise-ratio (SNR) is moderate or large. In the low SNR regime, we offer possible improvement over using PCA and the deflation varimax when the additive noise under the factor model is structured. The modified procedure is shown to be minimax optimal in all SNR regimes. Our theory is valid for finite sample and allows the number of the latent factors to grow with the sample size as well as the ambient dimension to grow with, or even exceed, the sample size. Extensive simulation and real data analysis further corroborate our theoretical findings.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 12 of its 60 references that are in the map. First posted on arXiv 16 Oct 2023.
Builds on
12 of 60 references.
References · 12
- 2015Complete Dictionary Recovery over the Sphere I: Overview and the Geometric Picturecited by 49
- 2018Heteroskedastic PCA: Algorithm, Optimality, and Applicationscited by 34
- 2017Adaptive Estimation in Structured Factor Models with Applications to Overlapping Clusteringcited by 19
- 2018Subgradient Descent Learns Orthogonal Dictionariescited by 17
- 2020Vintage Factor Analysis with Varimax Performs Statistical Inferencecited by 17
- 2018Structured Local Optima in Sparse Blind Deconvolutioncited by 15
- 2015On the Minimax Risk of Dictionary Learningcited by 7
- 2015Tensor vs Matrix Methods: Robust Tensor Decomposition under Block Sparse Perturbationscited by 5
- 2021Unique sparse decomposition of low rank matricescited by 4
- 2014A convergence and asymptotic analysis of the generalized symmetric FastICA algorithmcited by 2
- 2020Detecting approximate replicate components of a high-dimensional random vector with latent structurecited by 2
- 2021Efficient Sparse Coding using Hierarchical Riemannian Pursuitcited by 2
Built on by
Citing papers per year: 2025: 2.
2 papers.