Vintage Factor Analysis with Varimax Performs Statistical Inference
Not on the map. Why?
Abstract (arXiv)
Psychologists developed Multiple Factor Analysis to decompose multivariate data into a small number of interpretable factors without any a priori knowledge about those factors. In this form of factor analysis, the Varimax "factor rotation" is a key step to make the factors interpretable. Charles Spearman and many others objected to factor rotations because the factors seem to be rotationally invariant. These objections are still reported in all contemporary multivariate statistics textbooks. This is an engima because this vintage form of factor analysis has survived and is widely popular because, empirically, the factor rotation often makes the factors easier to interpret. We argue that the rotation makes the factors easier to interpret because, in fact, the Varimax factor rotation performs statistical inference. We show that Principal Components Analysis (PCA) with the Varimax rotation provides a unified spectral estimation strategy for a broad class of modern factor models, including the Stochastic Blockmodel and a natural variation of Latent Dirichlet Allocation (i.e., "topic modeling"). In addition, we show that Thurstone's widely employed sparsity diagnostics implicitly assess a key "leptokurtic" condition that makes the rotation statistically identifiable in these models. Taken together, this shows that the know-how of Vintage Factor Analysis performs statistical inference, reversing nearly a century of statistical thinking on the topic. With a sparse eigensolver, PCA with Varimax is both fast and stable. Combined with Thurstone's straightforward diagnostics, this vintage approach is suitable for a wide array of modern applications.
Key facts. Cited by 17 papers in the map (data through 14 Oct 2026). First posted on arXiv 11 Apr 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 4; 2024: 1; 2025: 6; 2026: 2.
17 papers.
Sort:
By area:
- 2022On the Identifiability of Nonlinear ICA: Sparsity and Beyondcited by 85
- 2021Identifiable Deep Generative Models via Sparse Decodingcited by 54
- 2025Towards Interpretable Deep Generative Models via Causal Representation Learningcited by 13
- 2023Doubly High-Dimensional Contextual Bandits: An Interpretable Model for Joint Assortment-Pricingcited by 8
- 2021Estimating Graph Dimension with Cross-validated Eigenvaluescited by 6
- 2025Quantifying Structure in CLIP Embeddings: A Statistical Framework for Concept Interpretationcited by 6
- 2023Optimal vintage factor analysis with deflation varimaxcited by 2
- 2025Deep Discrete Encoders: Identifiable Deep Generative Models for Rich Data with Discrete Latent Layerscited by 2
- 2025A Latent Variable Framework for Scaling Laws in Large Language Modelscited by 2
- 2023T-Stochastic Graphscited by 1
- 2026Probing for Representation Manifolds in Superpositioncited by 1
- 2022Entrywise Recovery Guarantees for Sparse PCA via Sparsistent Algorithmscited by 0
5 more
- 2023Empirical Bayes Covariance Decomposition, and a Solution to the Multiple Tuning Problem in Sparse PCAcited by 0
- 2024Nonparametric Evaluation of Noisy ICA Solutionscited by 0
- 2025Community Detection for Contextual-LSBM: Theoretical Limitations of Misclassification Rate and Efficient Algorithmscited by 0
- 2025Federated Independent Component Analysis via Spectral Alignment and Robust Aggregationcited by 0
- 2026DAG-CLIP: A DAG Learning Framework in the Presence of Latent Variablescited by 0
- 2026DAG-CLIP: A DAG Learning Framework in the Presence of Latent Variables5 Oct 2026
- 2026Probing for Representation Manifolds in Superposition18 May 2026
- 2025A Latent Variable Framework for Scaling Laws in Large Language Models6 Dec 2025
- 2025Quantifying Structure in CLIP Embeddings: A Statistical Framework for Concept Interpretation16 Jun 2025
- 2025Federated Independent Component Analysis via Spectral Alignment and Robust Aggregation26 May 2025
- 2025Towards Interpretable Deep Generative Models via Causal Representation Learning15 Apr 2025
- 2025Community Detection for Contextual-LSBM: Theoretical Limitations of Misclassification Rate and Efficient Algorithms19 Jan 2025
- 2025Deep Discrete Encoders: Identifiable Deep Generative Models for Rich Data with Discrete Latent Layers2 Jan 2025
- 2024Nonparametric Evaluation of Noisy ICA Solutions16 Jan 2024
- 2023Empirical Bayes Covariance Decomposition, and a Solution to the Multiple Tuning Problem in Sparse PCA6 Dec 2023
- 2023Optimal vintage factor analysis with deflation varimax16 Oct 2023
- 2023Doubly High-Dimensional Contextual Bandits: An Interpretable Model for Joint Assortment-Pricing14 Sep 2023
5 more
- 2023T-Stochastic Graphs4 Sep 2023
- 2022On the Identifiability of Nonlinear ICA: Sparsity and Beyond15 Jun 2022
- 2022Entrywise Recovery Guarantees for Sparse PCA via Sparsistent Algorithms8 Feb 2022
- 2021Identifiable Deep Generative Models via Sparse Decoding20 Oct 2021
- 2021Estimating Graph Dimension with Cross-validated Eigenvalues6 Aug 2021
- 2026Probing for Representation Manifolds in Superpositioncited by 1
- 2026Probing for Representation Manifolds in Superposition18 May 2026
- 2022On the Identifiability of Nonlinear ICA: Sparsity and Beyondcited by 85
- 2021Identifiable Deep Generative Models via Sparse Decodingcited by 54
- 2025Towards Interpretable Deep Generative Models via Causal Representation Learningcited by 13
- 2023Doubly High-Dimensional Contextual Bandits: An Interpretable Model for Joint Assortment-Pricingcited by 8
- 2021Estimating Graph Dimension with Cross-validated Eigenvaluescited by 6
- 2025Quantifying Structure in CLIP Embeddings: A Statistical Framework for Concept Interpretationcited by 6
- 2023Optimal vintage factor analysis with deflation varimaxcited by 2
- 2025Deep Discrete Encoders: Identifiable Deep Generative Models for Rich Data with Discrete Latent Layerscited by 2
- 2025A Latent Variable Framework for Scaling Laws in Large Language Modelscited by 2
- 2023T-Stochastic Graphscited by 1
- 2022Entrywise Recovery Guarantees for Sparse PCA via Sparsistent Algorithmscited by 0
- 2023Empirical Bayes Covariance Decomposition, and a Solution to the Multiple Tuning Problem in Sparse PCAcited by 0
12 most cited of 16 All 16 (JSON)
- 2026DAG-CLIP: A DAG Learning Framework in the Presence of Latent Variables5 Oct 2026
- 2025A Latent Variable Framework for Scaling Laws in Large Language Models6 Dec 2025
- 2025Quantifying Structure in CLIP Embeddings: A Statistical Framework for Concept Interpretation16 Jun 2025
- 2025Federated Independent Component Analysis via Spectral Alignment and Robust Aggregation26 May 2025
- 2025Towards Interpretable Deep Generative Models via Causal Representation Learning15 Apr 2025
- 2025Community Detection for Contextual-LSBM: Theoretical Limitations of Misclassification Rate and Efficient Algorithms19 Jan 2025
- 2025Deep Discrete Encoders: Identifiable Deep Generative Models for Rich Data with Discrete Latent Layers2 Jan 2025
- 2024Nonparametric Evaluation of Noisy ICA Solutions16 Jan 2024
- 2023Empirical Bayes Covariance Decomposition, and a Solution to the Multiple Tuning Problem in Sparse PCA6 Dec 2023
- 2023Optimal vintage factor analysis with deflation varimax16 Oct 2023
- 2023Doubly High-Dimensional Contextual Bandits: An Interpretable Model for Joint Assortment-Pricing14 Sep 2023
- 2023T-Stochastic Graphs4 Sep 2023
12 newest of 16 All 16 (JSON)