Computational Approaches for Exponential-Family Factor Analysis
Liang Wang, Luis Carvalho

TL;DR
This paper develops a flexible, robust exponential-family factor analysis framework with improved computational methods that avoid bias and scale efficiently for large data matrices, accommodating mean-dependent covariance and missing data.
Contribution
It introduces a quasi-likelihood based factor analysis model with dispersion and weights, and proposes scalable, bias-free computational algorithms using EM and SGD methods.
Findings
Proposed algorithms scale well for large matrices.
Avoided asymptotic bias present in previous methods.
Validated effectiveness through simulations and case studies.
Abstract
We study a general factor analysis framework where the -by- data matrix is assumed to follow a general exponential family distribution entry-wise. While this model framework has been proposed before, we here further relax its distributional assumption by using a quasi-likelihood setup. By parameterizing the mean-variance relationship on data entries, we additionally introduce a dispersion parameter and entry-wise weights to model large variations and missing values. The resulting model is thus not only robust to distribution misspecification but also more flexible and able to capture mean-dependent covariance structures of the data matrix. Our main focus is on efficient computational approaches to perform the factor analysis. Previous modeling frameworks rely on simulated maximum likelihood (SML) to find the factorization solution, but this method was shown to lead to asymptotic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCognitive Abilities and Testing
