The Bayesian Covariance Lasso

• Published in: Statistics and its interface Vol. 6; no. 2; p. 243
• Main Authors: Khondker, Zakaria S, Zhu, Hongtu, Chu, Haitao, Lin, Weili, Ibrahim, Joseph G
• Format: Journal Article
• Language: English
• Published: United States 01.04.2013
• Subjects: Precision matrix; Bayesian covariance lasso; Penalized likelihood; Network exploration; non-full rank data
• ISSN: 1938-7989
• DOI: 10.4310/SII.2013.v6.n2.a8

Estimation of sparse covariance matrices and their inverse subject to positive definiteness constraints has drawn a lot of attention in recent years. The abundance of high-dimensional data, where the sample size ( ) is less than the dimension ( ), requires shrinkage estimation methods since the maximum likelihood estimator is not positive definite in this case. Furthermore, when is larger than but not sufficiently larger, shrinkage estimation is more stable than maximum likelihood as it reduces the condition number of the precision matrix. Frequentist methods have utilized penalized likelihood methods, whereas Bayesian approaches rely on matrix decompositions or Wishart priors for shrinkage. In this paper we propose a new method, called the Bayesian Covariance Lasso (BCLASSO), for the shrinkage estimation of a precision (covariance) matrix. We consider a class of priors for the precision matrix that leads to the popular frequentist penalties as special cases, develop a Bayes estimator for the precision matrix, and propose an efficient sampling scheme that does not precalculate boundaries for positive definiteness. The proposed method is permutation invariant and performs shrinkage and estimation simultaneously for non-full rank data. Simulations show that the proposed BCLASSO performs similarly as frequentist methods for non-full rank data.