Statistical analysis of block structured latent variable models

2026-08-10

AI Summary

Block-structured latent variable models are widely employed in psychology, education, economics, and genetics, yet their identifiability and estimation performance have long lacked a systematic theoretical foundation. This work establishes, for the first time, identifiability conditions for such models under various block designs and introduces a Lagrangian-type nonconvex optimization framework based on constrained maximum likelihood estimation. The study derives both non-asymptotic error bounds and asymptotic distributions for the resulting estimators. The proposed algorithm enjoys strong theoretical guarantees and, as demonstrated through extensive simulations and empirical analyses, efficiently and accurately estimates latent variable models across diverse block structures.

Abstract

This paper studies block structured latent variable models, in which observed variables are grouped into distinct blocks based on their relationships with the underlying latent variables. These block structures are prevalent in various fields such as psychology, education, economics, and genetics. Despite their widespread applications, the fundamental statistical properties of these models remain largely unexplored. In this work, we present a comprehensive statistical analysis of the block structured latent variable models. In particular, we first derive conditions for model identifiability across various block designs. Furthermore, we investigate the maximum likelihood estimation under these identifiability constraints. To accommodate these intricate constraints associated with various block configurations, we introduce a Lagrangian-type formulation for the constrained nonconvex optimization problem and show that its optimum coincides with that of the original problem. This formulation serves as a critical tool for understanding the behavior of the constrained estimator under various block structures. Building on that, we establish sharp non-asymptotic error bounds and asymptotic distributions of the constrained maximum likelihood estimator. We also propose a computational framework to obtain the estimator and establish theoretical properties for the algorithm output. Our theoretical findings are validated through simulation studies and empirical data analyses.

Problem

• block structured latent variable models
• identifiability
• maximum likelihood estimation
• nonconvex optimization
• statistical analysis

Innovation

• block structured latent variable models
• identifiability
• constrained maximum likelihood estimation
• Lagrangian formulation
• non-asymptotic error bounds