Asymptotic Analysis of a Matrix Latent Decomposition Model

Matrix data sets arise in network analysis for medical applications, where each network belongs to a subject and represents a measurable phenotype. These large dimensional data are often modeled using lower-dimensional latent variables, which explain most of the observed variability and can be used for predictive purposes. In this paper, we provide asymptotic convergence guarantees for the estimation of a hierarchical statistical model for matrix data sets. It captures the variability of matrices by modeling a truncation of their eigendecomposition. We show that this model is identifiable, and that consistent Maximum A Posteriori (MAP) estimation can be performed to estimate the distribution of eigenvalues and eigenvectors. The MAP estimator is shown to be asymptotically normal for a restricted version of the model.

Automated summary

This paper provides asymptotic convergence guarantees for a hierarchical statistical model for matrix data sets. The model captures the variability of matrices by modeling a truncation of their eigendecomposition and offers consistent MAP estimation.