Sparse Cholesky covariance parametrization for recovering latent structure in ordered data

Abstract

The sparse Cholesky parametrization of the inverse covariance matrix can be interpreted as a Gaussian Bayesian network; however its counterpart, the covariance Cholesky factor, has received, with few notable exceptions, little attention so far, despite having a natural interpretation as a hidden variable model for ordered signal data. To fill this gap, in this paper we focus on arbitrary zero patterns in the Cholesky factor of a covariance matrix. We discuss how these models can also be extended, in analogy with Gaussian Bayesian networks, to data where no apparent order is available. For the ordered scenario, we propose a novel estimation method that is based on matrix loss penalization, as opposed to the existing regression-based approaches. The performance of this sparse model for the Cholesky factor, together with our novel estimator, is assessed in a simulation setting, as well as over spatial and temporal real data where a natural ordering arises among the variables. We give guidelines, based on the empirical results, about which of the methods analysed is more appropriate for each setting.

arXiv comment24 pages, 12 figures

References in corpus (11)

• Sparse permutation invariant covariance estimation
• Latent variable graphical model selection via convex optimization
• DAGs with NO TEARS: Continuous Optimization for Structure Learning
• Sparse estimation of large covariance matrices via a nested Lasso penalty
• Estimation of a Covariance Matrix with Zeros
• ${\ell }_0$-penalized maximum likelihood for sparse directed acyclic graphs
• Low Rank and Structured Modeling of High-dimensional Vector Autoregressions
• Optimizing regularized Cholesky score for order-based learning of Bayesian networks
• A review of Gaussian Markov models for conditional independence
• On generating random Gaussian graphical models
• Graphical continuous Lyapunov models