2018arXiv (Cornell University)Open access

On Variable Ordination of Modified Cholesky Decomposition for Sparse Covariance Matrix Estimation

Xiaoning Kang, Xinwei Deng

Open full text 0 citations

Abstract

Estimation of large sparse covariance matrices is of great importance for statistical analysis, especially in the high-dimensional settings. The traditional approach such as the sample covariance matrix performs poorly due to the high dimensionality. The modified Cholesky decomposition (MCD) is a commonly used method for sparse covariance matrix estimation. However, the MCD method relies on the order of variables, which is often not available or cannot be pre-determined in practice. In this work, we solve this order issue by obtaining a set of covariance matrix estimates under different orders of variables used in the MCD. Then we consider an ensemble estimator as the "center" of such a set of covariance matrix estimates with respect to the Frobenius norm. The proposed method not only ensures the estimator to be positive definite, but also can capture the underlying sparse structure of the covariance matrix. Under some weak regularity conditions, we establish both algorithmic convergence and asymptotical convergence of the proposed method. The merits of the proposed method are illustrated through simulation studies and one real data example.

Open-access reader

About this research paper

What this paper is about

Estimation of large sparse covariance matrices is of great importance for statistical analysis, especially in the high-dimensional settings. The traditional approach such as the sample covariance matrix performs poorly due to the high dimensionality. The modified Cholesky decomposition (MCD) is a commonly used method for sparse covariance matrix estimation. However, the MCD method relies on the order of variables, which is often not available or cannot be pre-determined in practice. In this work, we solve this order issue by obtaining a set of covariance matrix estimates under different orders of variables used in the MCD. Then we consider an ensemble estimator as the "center" of such a set of covariance matrix estimates with respect to the Frobenius norm. The proposed method not only ensures the estimator to be positive definite, but also can capture the underlying sparse structure of the covariance matrix. Under some weak regularity conditions, we establish both algorithmic convergence and asymptotical convergence of the proposed method. The merits of the proposed method are illustrated through simulation studies and one real data example.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Estimation of large sparse covariance matrices is of great importance for statistical analysis, especially in the high-dimensional settings. The traditional approach such as the sample covariance matrix performs poorly due to the high dimensionality. The modified Cholesky decomposition (MCD) is a commonly used method for sparse covariance matrix estimation. However, the MCD method relies on the order of variables, which is often not available or cannot be pre-determined in practice. In this work, we solve this order issue by obtaining a set of covariance matrix estimates under different orders of variables used in the MCD. Then we consider an ensemble estimator as the "center" of such a set of covariance matrix estimates with respect to the Frobenius norm. The proposed method not only ensures the estimator to be positive definite, but also can capture the underlying sparse structure of the covariance matrix. Under some weak regularity conditions, we establish both algorithmic convergence and asymptotical convergence of the proposed method. The merits of the proposed method are illustrated through simulation studies and one real data example.

Key concepts: Cholesky decomposition, Estimation of covariance matrices, Covariance matrix, Covariance, Mathematics, Estimator, Covariance intersection, Minimum degree algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
On Variable Ordination of Modified Cholesky Decomposition for Sparse Covariance Matrix Estimation — Research Paper | ScholarLens