High dimensional sparse covariance estimation via directed acyclic graphs

Abstract

We present a graph-based technique for estimating sparse covariance matrices and their inverses from high-dimensional data. The method is based on learning a directed acyclic graph (DAG) and estimating parameters of a multivariate Gaussian distribution based on a DAG. For inferring the underlying DAG we use the PC-algorithm and for estimating the DAG-based covariance matrix and its inverse, we use a Cholesky decomposition approach which provides a positive (semi-)definite sparse estimate. We present a consistency result in the high-dimensional framework and we compare our method with the Glasso for simulated and real data.

References in corpus (7)

• High-dimensional graphs and variable selection with the Lasso
• Regularized estimation of large covariance matrices
• Covariance regularization by thresholding
• Sparse permutation invariant covariance estimation
• Causal Inference and Causal Explanation with Background Knowledge
• Estimating high-dimensional intervention effects from observational data
• Sparse estimation of large covariance matrices via a nested Lasso penalty

Cited by in corpus (3)

• A general framework for Vecchia approximations of Gaussian processes
• Multivariate Generalized Gaussian Distribution: Convexity and Graphical Models
• Markov models for fMRI correlation structure: is brain functional connectivity small world, or decomposable into networks?